java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:18:23,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:18:23,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:18:23,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:18:23,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:18:23,681 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:18:23,682 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:18:23,683 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:18:23,685 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:18:23,685 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:18:23,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:18:23,686 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:18:23,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:18:23,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:18:23,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:18:23,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:18:23,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:18:23,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:18:23,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:18:23,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:18:23,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:18:23,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:18:23,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:18:23,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:18:23,697 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:18:23,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:18:23,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:18:23,699 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:18:23,699 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:18:23,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:18:23,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:18:23,700 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:18:23,709 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:18:23,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:18:23,710 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:18:23,710 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:18:23,710 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:18:23,711 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:18:23,711 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:18:23,711 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:18:23,711 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:18:23,711 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:18:23,711 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:18:23,712 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:18:23,712 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:18:23,712 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:18:23,712 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:18:23,712 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:18:23,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:18:23,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:18:23,713 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:18:23,713 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:18:23,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:18:23,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:18:23,713 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:18:23,713 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:18:23,714 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:18:23,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:18:23,754 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:18:23,757 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:18:23,758 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:18:23,758 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:18:23,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_true-valid-memsafety.i [2018-02-03 23:18:23,892 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:18:23,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:18:23,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:18:23,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:18:23,898 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:18:23,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:18:23" (1/1) ... [2018-02-03 23:18:23,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290ba63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:23, skipping insertion in model container [2018-02-03 23:18:23,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:18:23" (1/1) ... [2018-02-03 23:18:23,911 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:18:23,936 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:18:24,017 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:18:24,028 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:18:24,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:24 WrapperNode [2018-02-03 23:18:24,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:18:24,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:18:24,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:18:24,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:18:24,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:24" (1/1) ... [2018-02-03 23:18:24,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:24" (1/1) ... [2018-02-03 23:18:24,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:24" (1/1) ... [2018-02-03 23:18:24,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:24" (1/1) ... [2018-02-03 23:18:24,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:24" (1/1) ... [2018-02-03 23:18:24,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:24" (1/1) ... [2018-02-03 23:18:24,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:24" (1/1) ... [2018-02-03 23:18:24,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:18:24,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:18:24,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:18:24,056 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:18:24,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:24" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-03 23:18:24,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:18:24,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:18:24,087 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-03 23:18:24,087 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:18:24,087 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 23:18:24,087 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 23:18:24,087 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:18:24,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:18:24,088 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:18:24,088 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:18:24,088 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:18:24,088 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-03 23:18:24,088 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:18:24,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:18:24,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:18:24,228 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:18:24,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:18:24 BoogieIcfgContainer [2018-02-03 23:18:24,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:18:24,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:18:24,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:18:24,230 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:18:24,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:18:23" (1/3) ... [2018-02-03 23:18:24,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f4b899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:18:24, skipping insertion in model container [2018-02-03 23:18:24,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:18:24" (2/3) ... [2018-02-03 23:18:24,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f4b899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:18:24, skipping insertion in model container [2018-02-03 23:18:24,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:18:24" (3/3) ... [2018-02-03 23:18:24,232 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_true-valid-memsafety.i [2018-02-03 23:18:24,237 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:18:24,240 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-03 23:18:24,269 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:18:24,269 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:18:24,269 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:18:24,269 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:18:24,269 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:18:24,270 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:18:24,270 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:18:24,270 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:18:24,270 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:18:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-03 23:18:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-03 23:18:24,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:24,287 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:24,288 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-02-03 23:18:24,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:24,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:24,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:24,323 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:24,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:24,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:24,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:18:24,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:18:24,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:18:24,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:18:24,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:18:24,444 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-03 23:18:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:24,585 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-03 23:18:24,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:18:24,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-03 23:18:24,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:24,594 INFO L225 Difference]: With dead ends: 52 [2018-02-03 23:18:24,594 INFO L226 Difference]: Without dead ends: 49 [2018-02-03 23:18:24,596 INFO L554 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 [2018-02-03 23:18:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-03 23:18:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-03 23:18:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-03 23:18:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-03 23:18:24,624 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-02-03 23:18:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:24,625 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-03 23:18:24,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:18:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-03 23:18:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-03 23:18:24,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:24,625 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:24,626 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-02-03 23:18:24,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:24,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:24,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:24,627 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:24,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:24,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:24,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:18:24,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:18:24,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:18:24,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:18:24,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:18:24,693 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-02-03 23:18:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:24,755 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-03 23:18:24,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:18:24,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-03 23:18:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:24,756 INFO L225 Difference]: With dead ends: 48 [2018-02-03 23:18:24,756 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 23:18:24,757 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:18:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 23:18:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-03 23:18:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-03 23:18:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-03 23:18:24,763 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-02-03 23:18:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:24,763 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-03 23:18:24,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:18:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-03 23:18:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:18:24,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:24,764 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:24,764 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:24,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-02-03 23:18:24,764 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:24,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:24,765 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:24,765 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:24,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:24,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:24,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:18:24,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:18:24,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 23:18:24,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 23:18:24,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:18:24,838 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-02-03 23:18:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:24,883 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-03 23:18:24,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:18:24,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-03 23:18:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:24,884 INFO L225 Difference]: With dead ends: 45 [2018-02-03 23:18:24,884 INFO L226 Difference]: Without dead ends: 45 [2018-02-03 23:18:24,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:18:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-03 23:18:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-03 23:18:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-03 23:18:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-02-03 23:18:24,887 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-02-03 23:18:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:24,887 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-02-03 23:18:24,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 23:18:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-02-03 23:18:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:18:24,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:24,888 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:24,888 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-02-03 23:18:24,888 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:24,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:24,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:24,889 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:24,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:24,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:24,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:18:24,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:18:24,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:18:24,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:18:24,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:18:24,996 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-02-03 23:18:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:25,062 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-03 23:18:25,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 23:18:25,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-03 23:18:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:25,063 INFO L225 Difference]: With dead ends: 53 [2018-02-03 23:18:25,063 INFO L226 Difference]: Without dead ends: 53 [2018-02-03 23:18:25,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:18:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-03 23:18:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-02-03 23:18:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-03 23:18:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-03 23:18:25,069 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-02-03 23:18:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:25,069 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-03 23:18:25,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:18:25,069 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-03 23:18:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-03 23:18:25,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:25,070 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:25,070 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:25,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-02-03 23:18:25,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:25,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:25,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:25,071 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:25,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:25,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:25,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:25,190 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:25,199 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:25,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:25,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:18:25,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:25,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:25,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-03 23:18:25,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-03 23:18:25,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:25,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:18:25,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-02-03 23:18:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:25,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:18:25,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-02-03 23:18:25,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:18:25,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:18:25,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:18:25,358 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 12 states. [2018-02-03 23:18:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:25,556 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-03 23:18:25,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:18:25,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-02-03 23:18:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:25,558 INFO L225 Difference]: With dead ends: 63 [2018-02-03 23:18:25,559 INFO L226 Difference]: Without dead ends: 63 [2018-02-03 23:18:25,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:18:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-03 23:18:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-02-03 23:18:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-03 23:18:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-03 23:18:25,563 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 21 [2018-02-03 23:18:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:25,563 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-03 23:18:25,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:18:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-03 23:18:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 23:18:25,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:25,564 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:25,564 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-02-03 23:18:25,564 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:25,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:25,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:25,569 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:25,569 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:25,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:25,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:25,722 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:25,726 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:18:25,745 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:18:25,745 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:18:25,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:25,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:18:25,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:25,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:18:25,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:25,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:25,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-03 23:18:25,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:25,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:25,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:18:25,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:25,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-03 23:18:25,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:25,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:18:25,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-02-03 23:18:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:25,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:18:25,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-02-03 23:18:25,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 23:18:25,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 23:18:25,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:18:25,910 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 17 states. [2018-02-03 23:18:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:26,288 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-03 23:18:26,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:18:26,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-02-03 23:18:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:26,289 INFO L225 Difference]: With dead ends: 73 [2018-02-03 23:18:26,289 INFO L226 Difference]: Without dead ends: 73 [2018-02-03 23:18:26,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-02-03 23:18:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-03 23:18:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-02-03 23:18:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-03 23:18:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-03 23:18:26,292 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-02-03 23:18:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:26,292 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-03 23:18:26,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 23:18:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-03 23:18:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 23:18:26,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:26,293 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:26,293 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:26,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-02-03 23:18:26,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:26,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:26,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:26,294 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:18:26,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:26,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:26,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:26,424 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:26,429 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:18:26,450 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-03 23:18:26,450 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:18:26,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:26,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:18:26,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:26,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:18:26,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:26,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:26,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-03 23:18:26,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:26,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-03 23:18:26,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:26,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:26,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:26,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:18:26,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:26,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:26,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-03 23:18:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-03 23:18:26,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:18:26,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-02-03 23:18:26,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-03 23:18:26,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-03 23:18:26,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-02-03 23:18:26,649 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 18 states. [2018-02-03 23:18:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:27,140 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-03 23:18:27,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:18:27,141 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-02-03 23:18:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:27,143 INFO L225 Difference]: With dead ends: 90 [2018-02-03 23:18:27,143 INFO L226 Difference]: Without dead ends: 90 [2018-02-03 23:18:27,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2018-02-03 23:18:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-03 23:18:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-02-03 23:18:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-03 23:18:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-03 23:18:27,146 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-02-03 23:18:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:27,146 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-03 23:18:27,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-03 23:18:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-03 23:18:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-03 23:18:27,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:27,147 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:27,147 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash -645884181, now seen corresponding path program 1 times [2018-02-03 23:18:27,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:27,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:27,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:27,148 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:18:27,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:27,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:27,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:27,217 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:27,224 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:27,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:27,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:18:27,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-03 23:18:27,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:18:27,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:18:27,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:18:27,343 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-02-03 23:18:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:27,441 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-02-03 23:18:27,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:18:27,441 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-02-03 23:18:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:27,442 INFO L225 Difference]: With dead ends: 102 [2018-02-03 23:18:27,442 INFO L226 Difference]: Without dead ends: 102 [2018-02-03 23:18:27,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:18:27,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-03 23:18:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2018-02-03 23:18:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-03 23:18:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-02-03 23:18:27,445 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 40 [2018-02-03 23:18:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:27,445 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-02-03 23:18:27,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:18:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-02-03 23:18:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-03 23:18:27,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:27,446 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:27,446 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2113361740, now seen corresponding path program 2 times [2018-02-03 23:18:27,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:27,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:27,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:27,447 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:27,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:27,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:18:27,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:27,537 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:27,548 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:18:27,566 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-03 23:18:27,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:18:27,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:27,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:18:27,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:27,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:18:27,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-03 23:18:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-03 23:18:27,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:18:27,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-02-03 23:18:27,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:18:27,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:18:27,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:18:27,689 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 15 states. [2018-02-03 23:18:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:28,187 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-02-03 23:18:28,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 23:18:28,187 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-03 23:18:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:28,187 INFO L225 Difference]: With dead ends: 104 [2018-02-03 23:18:28,187 INFO L226 Difference]: Without dead ends: 104 [2018-02-03 23:18:28,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 23:18:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-03 23:18:28,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2018-02-03 23:18:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-03 23:18:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-02-03 23:18:28,191 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 44 [2018-02-03 23:18:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:28,192 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-02-03 23:18:28,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:18:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-02-03 23:18:28,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 23:18:28,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:28,193 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:28,193 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:28,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1590645252, now seen corresponding path program 1 times [2018-02-03 23:18:28,193 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:28,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:28,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:28,194 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:18:28,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:28,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-03 23:18:28,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:18:28,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:18:28,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:18:28,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:18:28,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:18:28,231 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 4 states. [2018-02-03 23:18:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:28,255 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-02-03 23:18:28,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:18:28,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-02-03 23:18:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:28,256 INFO L225 Difference]: With dead ends: 85 [2018-02-03 23:18:28,256 INFO L226 Difference]: Without dead ends: 85 [2018-02-03 23:18:28,257 INFO L554 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 [2018-02-03 23:18:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-03 23:18:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-03 23:18:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-03 23:18:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-02-03 23:18:28,260 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 48 [2018-02-03 23:18:28,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:28,260 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-02-03 23:18:28,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:18:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-02-03 23:18:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-03 23:18:28,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:28,262 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:28,262 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:28,262 INFO L82 PathProgramCache]: Analyzing trace with hash 221692532, now seen corresponding path program 1 times [2018-02-03 23:18:28,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:28,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:28,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:28,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:28,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:28,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-03 23:18:28,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:28,355 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:28,363 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:28,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-03 23:18:28,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:18:28,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-03 23:18:28,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-03 23:18:28,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-03 23:18:28,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-02-03 23:18:28,495 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 20 states. [2018-02-03 23:18:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:28,577 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-02-03 23:18:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:18:28,578 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-02-03 23:18:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:28,578 INFO L225 Difference]: With dead ends: 101 [2018-02-03 23:18:28,578 INFO L226 Difference]: Without dead ends: 101 [2018-02-03 23:18:28,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-02-03 23:18:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-03 23:18:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-02-03 23:18:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-03 23:18:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-02-03 23:18:28,583 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 77 [2018-02-03 23:18:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:28,584 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-02-03 23:18:28,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-03 23:18:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-02-03 23:18:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-03 23:18:28,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:28,585 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:28,585 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2016762915, now seen corresponding path program 2 times [2018-02-03 23:18:28,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:28,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:28,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:28,586 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:28,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:28,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-03 23:18:28,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:28,692 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:28,697 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:18:28,711 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-03 23:18:28,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:18:28,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:28,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:18:28,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:28,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:28,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-02-03 23:18:28,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:28,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:28,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:18:28,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:28,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:28,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-02-03 23:18:28,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:28,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 23:18:28,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:28,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:18:28,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-03 23:18:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-02-03 23:18:28,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:18:28,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2018-02-03 23:18:28,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-03 23:18:28,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-03 23:18:28,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-02-03 23:18:28,836 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 19 states. [2018-02-03 23:18:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:29,281 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-02-03 23:18:29,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-03 23:18:29,282 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-02-03 23:18:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:29,282 INFO L225 Difference]: With dead ends: 107 [2018-02-03 23:18:29,282 INFO L226 Difference]: Without dead ends: 107 [2018-02-03 23:18:29,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=475, Invalid=1595, Unknown=0, NotChecked=0, Total=2070 [2018-02-03 23:18:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-03 23:18:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-02-03 23:18:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-03 23:18:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-02-03 23:18:29,287 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 89 [2018-02-03 23:18:29,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:29,287 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-02-03 23:18:29,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-03 23:18:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-02-03 23:18:29,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-03 23:18:29,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:29,289 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:29,289 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:29,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1885333684, now seen corresponding path program 1 times [2018-02-03 23:18:29,289 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:29,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:29,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:29,290 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:18:29,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:29,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-03 23:18:29,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:29,422 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:29,427 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:29,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-03 23:18:29,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:18:29,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-02-03 23:18:29,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-03 23:18:29,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-03 23:18:29,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=353, Unknown=0, NotChecked=0, Total=552 [2018-02-03 23:18:29,540 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 24 states. [2018-02-03 23:18:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:29,627 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-02-03 23:18:29,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:18:29,627 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2018-02-03 23:18:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:29,628 INFO L225 Difference]: With dead ends: 115 [2018-02-03 23:18:29,628 INFO L226 Difference]: Without dead ends: 115 [2018-02-03 23:18:29,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2018-02-03 23:18:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-03 23:18:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-02-03 23:18:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-03 23:18:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-02-03 23:18:29,632 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 97 [2018-02-03 23:18:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:29,632 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-02-03 23:18:29,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-03 23:18:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-02-03 23:18:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-03 23:18:29,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:29,633 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:29,633 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:29,633 INFO L82 PathProgramCache]: Analyzing trace with hash -984574572, now seen corresponding path program 2 times [2018-02-03 23:18:29,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:29,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:29,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:29,634 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:18:29,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:29,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-03 23:18:29,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:29,765 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:29,770 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:18:29,799 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:18:29,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:18:29,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-03 23:18:29,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:18:29,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-02-03 23:18:29,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 23:18:29,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 23:18:29,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=415, Unknown=0, NotChecked=0, Total=650 [2018-02-03 23:18:29,902 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 26 states. [2018-02-03 23:18:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:30,001 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-02-03 23:18:30,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 23:18:30,001 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2018-02-03 23:18:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:30,002 INFO L225 Difference]: With dead ends: 123 [2018-02-03 23:18:30,002 INFO L226 Difference]: Without dead ends: 123 [2018-02-03 23:18:30,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=260, Invalid=442, Unknown=0, NotChecked=0, Total=702 [2018-02-03 23:18:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-03 23:18:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-02-03 23:18:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-03 23:18:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-02-03 23:18:30,006 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 105 [2018-02-03 23:18:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:30,006 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-02-03 23:18:30,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 23:18:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-02-03 23:18:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-03 23:18:30,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:30,007 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:30,007 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1299772556, now seen corresponding path program 3 times [2018-02-03 23:18:30,008 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:30,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:30,008 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:30,008 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:18:30,009 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:30,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-03 23:18:30,200 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:30,258 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:30,263 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:18:30,379 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-02-03 23:18:30,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:18:30,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 42 proven. 242 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-03 23:18:30,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:18:30,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2018-02-03 23:18:30,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-03 23:18:30,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-03 23:18:30,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=666, Unknown=0, NotChecked=0, Total=992 [2018-02-03 23:18:30,524 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 32 states. [2018-02-03 23:18:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:18:30,635 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-02-03 23:18:30,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-03 23:18:30,635 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 113 [2018-02-03 23:18:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:18:30,636 INFO L225 Difference]: With dead ends: 137 [2018-02-03 23:18:30,636 INFO L226 Difference]: Without dead ends: 137 [2018-02-03 23:18:30,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=356, Invalid=700, Unknown=0, NotChecked=0, Total=1056 [2018-02-03 23:18:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-03 23:18:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2018-02-03 23:18:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-03 23:18:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-02-03 23:18:30,638 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 113 [2018-02-03 23:18:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:18:30,638 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-02-03 23:18:30,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-03 23:18:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-02-03 23:18:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-03 23:18:30,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:18:30,639 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:18:30,639 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-03 23:18:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash -310498389, now seen corresponding path program 4 times [2018-02-03 23:18:30,640 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:18:30,640 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:18:30,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:30,640 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:18:30,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:18:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:18:30,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:18:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-03 23:18:30,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:18:30,806 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:18:30,811 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 23:18:30,838 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 23:18:30,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:18:30,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:18:30,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:18:30,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:30,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:30,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:18:30,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:30,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:30,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:18:30,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:30,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:30,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-03 23:18:30,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:18:30,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:18:30,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:30,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:30,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:30,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-02-03 23:18:30,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-02-03 23:18:30,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:18:30,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:30,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:30,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:18:30,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:8 [2018-02-03 23:18:30,939 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((foo_~i~0 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-03 23:18:30,976 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (= (store |c_old(#memory_int)| c_~a.base (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1))) |c_#memory_int|))) is different from true [2018-02-03 23:18:30,984 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_4 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (= (store |c_old(#memory_int)| c_~a.base (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1))) |c_#memory_int|))) is different from true [2018-02-03 23:18:31,055 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-03 23:18:31,299 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 v_prenex_7) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_8)) (- 1)) (+ c_~a.offset (* 4 v_prenex_9)) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-03 23:18:31,313 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 v_prenex_7) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_8)) (- 1)) (+ c_~a.offset (* 4 v_prenex_9)) (- 1)) (+ c_~a.offset (* 4 v_prenex_10)) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1))) |c_#memory_int|))) is different from true [2018-02-03 23:18:31,330 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 v_prenex_7) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_8)) (- 1)) (+ c_~a.offset (* 4 v_prenex_9)) (- 1)) (+ c_~a.offset (* 4 v_prenex_10)) (- 1)) (+ (* 4 v_prenex_11) c_~a.offset) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-03 23:18:31,348 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_12 Int) (v_prenex_3 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 v_prenex_7) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_8)) (- 1)) (+ c_~a.offset (* 4 v_prenex_9)) (- 1)) (+ c_~a.offset (* 4 v_prenex_10)) (- 1)) (+ (* 4 v_prenex_11) c_~a.offset) (- 1)) (+ (* 4 v_prenex_12) c_~a.offset) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-03 23:18:31,369 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 v_prenex_7) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_8)) (- 1)) (+ c_~a.offset (* 4 v_prenex_9)) (- 1)) (+ c_~a.offset (* 4 v_prenex_10)) (- 1)) (+ (* 4 v_prenex_11) c_~a.offset) (- 1)) (+ (* 4 v_prenex_12) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_13)) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown