/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label00.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:29:05,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:29:05,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:29:05,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:29:05,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:29:05,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:29:05,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:29:05,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:29:05,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:29:05,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:29:05,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:29:05,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:29:05,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:29:05,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:29:05,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:29:05,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:29:05,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:29:05,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:29:05,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:29:05,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:29:05,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:29:05,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:29:05,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:29:05,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:29:05,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:29:05,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:29:05,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:29:05,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:29:05,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:29:05,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:29:05,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:29:05,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:29:05,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:29:05,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:29:05,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:29:05,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:29:05,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:29:05,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:29:05,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:29:05,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:29:05,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:29:05,828 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:29:05,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:29:05,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:29:05,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:29:05,843 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:29:05,843 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:29:05,844 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:29:05,844 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:29:05,844 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:29:05,844 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:29:05,844 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:29:05,845 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:29:05,845 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:29:05,845 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:29:05,846 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:29:05,846 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:29:05,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:29:05,848 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:29:05,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:29:05,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:29:05,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:29:05,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:29:05,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:29:05,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:29:05,849 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:29:05,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:29:05,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:29:05,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:29:05,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:29:05,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:29:05,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:05,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:29:05,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:29:05,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:29:05,852 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:29:05,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:29:05,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:29:05,853 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:29:05,853 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:29:06,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:29:06,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:29:06,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:29:06,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:29:06,180 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:29:06,181 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label00.c [2019-11-23 23:29:06,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d59254b/034eb7b127064f079e4f9dfa05777b53/FLAG0be35628f [2019-11-23 23:29:06,799 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:29:06,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label00.c [2019-11-23 23:29:06,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d59254b/034eb7b127064f079e4f9dfa05777b53/FLAG0be35628f [2019-11-23 23:29:07,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d59254b/034eb7b127064f079e4f9dfa05777b53 [2019-11-23 23:29:07,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:29:07,132 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:29:07,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:07,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:29:07,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:29:07,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:07" (1/1) ... [2019-11-23 23:29:07,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce7b69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:07, skipping insertion in model container [2019-11-23 23:29:07,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:07" (1/1) ... [2019-11-23 23:29:07,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:29:07,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:29:07,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:07,914 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:29:08,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:08,020 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:29:08,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08 WrapperNode [2019-11-23 23:29:08,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:08,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:08,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:29:08,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:29:08,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (1/1) ... [2019-11-23 23:29:08,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (1/1) ... [2019-11-23 23:29:08,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:08,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:29:08,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:29:08,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:29:08,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (1/1) ... [2019-11-23 23:29:08,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (1/1) ... [2019-11-23 23:29:08,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (1/1) ... [2019-11-23 23:29:08,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (1/1) ... [2019-11-23 23:29:08,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (1/1) ... [2019-11-23 23:29:08,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (1/1) ... [2019-11-23 23:29:08,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (1/1) ... [2019-11-23 23:29:08,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:29:08,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:29:08,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:29:08,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:29:08,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:08,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:29:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:29:10,281 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:29:10,282 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:29:10,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:10 BoogieIcfgContainer [2019-11-23 23:29:10,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:29:10,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:29:10,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:29:10,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:29:10,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:07" (1/3) ... [2019-11-23 23:29:10,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94b470d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:10, skipping insertion in model container [2019-11-23 23:29:10,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:08" (2/3) ... [2019-11-23 23:29:10,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94b470d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:10, skipping insertion in model container [2019-11-23 23:29:10,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:10" (3/3) ... [2019-11-23 23:29:10,292 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label00.c [2019-11-23 23:29:10,301 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:29:10,309 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:29:10,321 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:29:10,348 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:29:10,348 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:29:10,348 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:29:10,348 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:29:10,348 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:29:10,349 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:29:10,349 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:29:10,349 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:29:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:29:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:29:10,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:10,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:10,377 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:10,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1323237596, now seen corresponding path program 1 times [2019-11-23 23:29:10,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:10,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853409536] [2019-11-23 23:29:10,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:29:10,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853409536] [2019-11-23 23:29:10,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:10,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:10,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234262310] [2019-11-23 23:29:10,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:10,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:10,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:10,771 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:29:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:11,561 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:29:11,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:11,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:29:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:11,579 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:29:11,579 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:29:11,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:29:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:29:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:29:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:29:11,640 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:29:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:11,641 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:29:11,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:29:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:29:11,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:11,645 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:11,645 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:11,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1048390217, now seen corresponding path program 1 times [2019-11-23 23:29:11,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:11,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264452754] [2019-11-23 23:29:11,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:29:11,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264452754] [2019-11-23 23:29:11,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:11,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:11,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039395027] [2019-11-23 23:29:11,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:11,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:11,757 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:29:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:12,311 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:29:12,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:12,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:29:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:12,316 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:29:12,316 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:12,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:29:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:29:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-23 23:29:12,358 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-23 23:29:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:12,358 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-23 23:29:12,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-23 23:29:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:29:12,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:12,362 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:12,363 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:12,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:12,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2123294889, now seen corresponding path program 1 times [2019-11-23 23:29:12,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:12,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764099598] [2019-11-23 23:29:12,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:29:12,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764099598] [2019-11-23 23:29:12,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:12,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:12,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096535972] [2019-11-23 23:29:12,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:12,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:12,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:12,572 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 4 states. [2019-11-23 23:29:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:13,212 INFO L93 Difference]: Finished difference Result 857 states and 1413 transitions. [2019-11-23 23:29:13,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:13,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-23 23:29:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:13,218 INFO L225 Difference]: With dead ends: 857 [2019-11-23 23:29:13,218 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:13,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:29:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:29:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 633 transitions. [2019-11-23 23:29:13,242 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 633 transitions. Word has length 78 [2019-11-23 23:29:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:13,243 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 633 transitions. [2019-11-23 23:29:13,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 633 transitions. [2019-11-23 23:29:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 23:29:13,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:13,248 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:13,248 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 293127354, now seen corresponding path program 1 times [2019-11-23 23:29:13,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:13,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065719149] [2019-11-23 23:29:13,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:29:13,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065719149] [2019-11-23 23:29:13,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:13,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:13,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58749793] [2019-11-23 23:29:13,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:13,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:13,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:13,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:13,307 INFO L87 Difference]: Start difference. First operand 429 states and 633 transitions. Second operand 3 states. [2019-11-23 23:29:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:13,709 INFO L93 Difference]: Finished difference Result 1212 states and 1788 transitions. [2019-11-23 23:29:13,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:13,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-23 23:29:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:13,713 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:29:13,713 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:29:13,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:29:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-11-23 23:29:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:29:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 888 transitions. [2019-11-23 23:29:13,747 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 888 transitions. Word has length 89 [2019-11-23 23:29:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:13,747 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 888 transitions. [2019-11-23 23:29:13,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 888 transitions. [2019-11-23 23:29:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:29:13,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:13,756 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:13,756 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:13,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1374584242, now seen corresponding path program 1 times [2019-11-23 23:29:13,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:13,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507465919] [2019-11-23 23:29:13,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:29:13,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507465919] [2019-11-23 23:29:13,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:13,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:13,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167184795] [2019-11-23 23:29:13,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:13,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:13,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:13,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:13,913 INFO L87 Difference]: Start difference. First operand 642 states and 888 transitions. Second operand 4 states. [2019-11-23 23:29:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:14,380 INFO L93 Difference]: Finished difference Result 1374 states and 1884 transitions. [2019-11-23 23:29:14,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:29:14,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-23 23:29:14,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:14,385 INFO L225 Difference]: With dead ends: 1374 [2019-11-23 23:29:14,385 INFO L226 Difference]: Without dead ends: 733 [2019-11-23 23:29:14,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:29:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-11-23 23:29:14,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 713. [2019-11-23 23:29:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:29:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 965 transitions. [2019-11-23 23:29:14,405 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 965 transitions. Word has length 97 [2019-11-23 23:29:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:14,406 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 965 transitions. [2019-11-23 23:29:14,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 965 transitions. [2019-11-23 23:29:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 23:29:14,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:14,408 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:14,409 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:14,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:14,409 INFO L82 PathProgramCache]: Analyzing trace with hash 251998854, now seen corresponding path program 1 times [2019-11-23 23:29:14,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:14,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251886694] [2019-11-23 23:29:14,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:29:14,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251886694] [2019-11-23 23:29:14,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:14,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:14,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418054569] [2019-11-23 23:29:14,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:14,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:14,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:14,500 INFO L87 Difference]: Start difference. First operand 713 states and 965 transitions. Second operand 4 states. [2019-11-23 23:29:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:15,102 INFO L93 Difference]: Finished difference Result 1851 states and 2529 transitions. [2019-11-23 23:29:15,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:15,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-23 23:29:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:15,109 INFO L225 Difference]: With dead ends: 1851 [2019-11-23 23:29:15,109 INFO L226 Difference]: Without dead ends: 1210 [2019-11-23 23:29:15,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-23 23:29:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 926. [2019-11-23 23:29:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:29:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1220 transitions. [2019-11-23 23:29:15,137 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1220 transitions. Word has length 101 [2019-11-23 23:29:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:15,137 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1220 transitions. [2019-11-23 23:29:15,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1220 transitions. [2019-11-23 23:29:15,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 23:29:15,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:15,140 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:15,141 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:15,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:15,141 INFO L82 PathProgramCache]: Analyzing trace with hash 526056009, now seen corresponding path program 1 times [2019-11-23 23:29:15,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:15,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594316855] [2019-11-23 23:29:15,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:29:15,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594316855] [2019-11-23 23:29:15,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:15,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:29:15,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11292028] [2019-11-23 23:29:15,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:29:15,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:29:15,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:15,304 INFO L87 Difference]: Start difference. First operand 926 states and 1220 transitions. Second operand 8 states. [2019-11-23 23:29:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:16,054 INFO L93 Difference]: Finished difference Result 1958 states and 2588 transitions. [2019-11-23 23:29:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:29:16,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-11-23 23:29:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:16,060 INFO L225 Difference]: With dead ends: 1958 [2019-11-23 23:29:16,060 INFO L226 Difference]: Without dead ends: 1104 [2019-11-23 23:29:16,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-11-23 23:29:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 997. [2019-11-23 23:29:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1291 transitions. [2019-11-23 23:29:16,085 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1291 transitions. Word has length 115 [2019-11-23 23:29:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:16,085 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1291 transitions. [2019-11-23 23:29:16,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:29:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1291 transitions. [2019-11-23 23:29:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 23:29:16,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:16,088 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:16,089 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1428376252, now seen corresponding path program 1 times [2019-11-23 23:29:16,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:16,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465482610] [2019-11-23 23:29:16,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:29:16,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465482610] [2019-11-23 23:29:16,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:16,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:16,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146090944] [2019-11-23 23:29:16,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:16,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:16,182 INFO L87 Difference]: Start difference. First operand 997 states and 1291 transitions. Second operand 4 states. [2019-11-23 23:29:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:16,705 INFO L93 Difference]: Finished difference Result 2561 states and 3275 transitions. [2019-11-23 23:29:16,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:16,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-23 23:29:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:16,712 INFO L225 Difference]: With dead ends: 2561 [2019-11-23 23:29:16,712 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 23:29:16,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 23:29:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 926. [2019-11-23 23:29:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:29:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1025 transitions. [2019-11-23 23:29:16,735 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1025 transitions. Word has length 118 [2019-11-23 23:29:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:16,736 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1025 transitions. [2019-11-23 23:29:16,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1025 transitions. [2019-11-23 23:29:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 23:29:16,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:16,739 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:16,739 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash 863644729, now seen corresponding path program 1 times [2019-11-23 23:29:16,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:16,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587793956] [2019-11-23 23:29:16,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 23:29:16,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587793956] [2019-11-23 23:29:16,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140643234] [2019-11-23 23:29:16,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:16,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:29:17,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:29:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-23 23:29:17,059 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:29:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-23 23:29:17,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:29:17,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:29:17,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024860591] [2019-11-23 23:29:17,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:17,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:17,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:17,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:29:17,092 INFO L87 Difference]: Start difference. First operand 926 states and 1025 transitions. Second operand 3 states. [2019-11-23 23:29:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:17,329 INFO L93 Difference]: Finished difference Result 926 states and 1025 transitions. [2019-11-23 23:29:17,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:17,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 23:29:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:17,330 INFO L225 Difference]: With dead ends: 926 [2019-11-23 23:29:17,330 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:29:17,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:29:17,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:29:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:29:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:29:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:29:17,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2019-11-23 23:29:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:17,333 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:29:17,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:17,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:29:17,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:29:17,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:29:17,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:29:18,075 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 24 [2019-11-23 23:29:18,426 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 24 [2019-11-23 23:29:18,432 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:29:18,433 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:29:18,433 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:18,433 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:29:18,433 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:29:18,434 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 23:29:18,434 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:29:18,434 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:29:18,434 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:29:18,434 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:29:18,434 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:29:18,434 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:29:18,435 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:29:18,435 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:29:18,435 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:29:18,435 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:29:18,435 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:29:18,435 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:29:18,435 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:29:18,436 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (<= ~a21~0 0)) (.cse1 (= 13 ~a8~0)) (.cse4 (= ~a17~0 1)) (.cse3 (not (= ~a16~0 5))) (.cse0 (= ~a21~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 .cse1 .cse3) (and .cse2 .cse1 .cse4) (and .cse4 .cse3 .cse0) (and (= ~a16~0 4) .cse0))) [2019-11-23 23:29:18,436 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:29:18,436 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:29:18,436 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:29:18,437 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:29:18,437 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:29:18,437 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:29:18,437 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:29:18,437 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:29:18,437 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:29:18,437 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:29:18,438 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:29:18,438 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:29:18,438 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:29:18,438 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:29:18,438 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:29:18,438 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:29:18,438 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:29:18,438 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:29:18,439 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:29:18,439 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:29:18,439 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:29:18,439 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:29:18,439 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:29:18,439 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (<= ~a21~0 0)) (.cse1 (= 13 ~a8~0)) (.cse4 (= ~a17~0 1)) (.cse3 (not (= ~a16~0 5))) (.cse0 (= ~a21~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 .cse1 .cse3) (and .cse2 .cse1 .cse4) (and .cse4 .cse3 .cse0) (and (= ~a16~0 4) .cse0))) [2019-11-23 23:29:18,440 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:29:18,440 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:29:18,440 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:29:18,445 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:29:18,445 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:29:18,445 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:29:18,445 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:29:18,446 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:29:18,446 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:29:18,446 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:29:18,446 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:29:18,446 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:29:18,446 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:29:18,446 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:29:18,447 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:29:18,447 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:29:18,447 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:29:18,447 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:29:18,447 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:29:18,447 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:29:18,447 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:29:18,447 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:29:18,448 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:29:18,448 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 500) no Hoare annotation was computed. [2019-11-23 23:29:18,448 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:29:18,448 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:29:18,448 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:29:18,448 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:18,448 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:29:18,449 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:29:18,449 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:29:18,449 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:29:18,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:29:18 BoogieIcfgContainer [2019-11-23 23:29:18,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:29:18,488 INFO L168 Benchmark]: Toolchain (without parser) took 11349.86 ms. Allocated memory was 137.9 MB in the beginning and 363.3 MB in the end (delta: 225.4 MB). Free memory was 100.7 MB in the beginning and 264.6 MB in the end (delta: -164.0 MB). Peak memory consumption was 243.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:18,489 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-11-23 23:29:18,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.34 ms. Allocated memory was 137.9 MB in the beginning and 205.0 MB in the end (delta: 67.1 MB). Free memory was 100.4 MB in the beginning and 165.8 MB in the end (delta: -65.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:18,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.63 ms. Allocated memory is still 205.0 MB. Free memory was 165.8 MB in the beginning and 160.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:18,495 INFO L168 Benchmark]: Boogie Preprocessor took 105.39 ms. Allocated memory is still 205.0 MB. Free memory was 160.1 MB in the beginning and 155.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:18,496 INFO L168 Benchmark]: RCFGBuilder took 2066.13 ms. Allocated memory was 205.0 MB in the beginning and 249.0 MB in the end (delta: 44.0 MB). Free memory was 155.2 MB in the beginning and 198.8 MB in the end (delta: -43.6 MB). Peak memory consumption was 109.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:18,505 INFO L168 Benchmark]: TraceAbstraction took 8195.38 ms. Allocated memory was 249.0 MB in the beginning and 363.3 MB in the end (delta: 114.3 MB). Free memory was 198.8 MB in the beginning and 264.6 MB in the end (delta: -65.8 MB). Peak memory consumption was 230.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:18,513 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 888.34 ms. Allocated memory was 137.9 MB in the beginning and 205.0 MB in the end (delta: 67.1 MB). Free memory was 100.4 MB in the beginning and 165.8 MB in the end (delta: -65.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.63 ms. Allocated memory is still 205.0 MB. Free memory was 165.8 MB in the beginning and 160.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.39 ms. Allocated memory is still 205.0 MB. Free memory was 160.1 MB in the beginning and 155.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2066.13 ms. Allocated memory was 205.0 MB in the beginning and 249.0 MB in the end (delta: 44.0 MB). Free memory was 155.2 MB in the beginning and 198.8 MB in the end (delta: -43.6 MB). Peak memory consumption was 109.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8195.38 ms. Allocated memory was 249.0 MB in the beginning and 363.3 MB in the end (delta: 114.3 MB). Free memory was 198.8 MB in the beginning and 264.6 MB in the end (delta: -65.8 MB). Peak memory consumption was 230.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 500]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((a21 == 1 && !(13 == a8)) || ((a21 <= 0 && 13 == a8) && !(a16 == 5))) || ((a21 <= 0 && 13 == a8) && a17 == 1)) || ((a17 == 1 && !(a16 == 5)) && a21 == 1)) || (a16 == 4 && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((a21 == 1 && !(13 == a8)) || ((a21 <= 0 && 13 == a8) && !(a16 == 5))) || ((a21 <= 0 && 13 == a8) && a17 == 1)) || ((a17 == 1 && !(a16 == 5)) && a21 == 1)) || (a16 == 4 && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 8.1s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 564 SDtfs, 1413 SDslu, 77 SDs, 0 SdLazy, 2916 SolverSat, 954 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 304 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 837 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 97 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7026 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2550 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1179 ConstructedInterpolants, 0 QuantifiedInterpolants, 337062 SizeOfPredicates, 1 NumberOfNonLiveVariables, 329 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 592/619 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...