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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:57:50,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:57:50,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:57:50,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:57:50,067 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:57:50,068 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:57:50,069 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:57:50,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:57:50,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:57:50,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:57:50,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:57:50,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:57:50,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:57:50,077 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:57:50,078 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:57:50,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:57:50,082 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:57:50,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:57:50,085 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:57:50,086 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:57:50,088 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:57:50,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:57:50,089 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:57:50,090 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:57:50,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:57:50,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:57:50,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:57:50,092 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:57:50,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:57:50,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:57:50,093 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:57:50,094 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:57:50,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:57:50,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:57:50,104 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:57:50,104 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:57:50,104 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:57:50,104 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:57:50,105 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:57:50,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:57:50,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:57:50,106 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:57:50,106 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:57:50,106 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:57:50,106 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:57:50,106 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:57:50,107 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:57:50,107 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:57:50,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:57:50,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:57:50,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:57:50,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:57:50,108 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:57:50,108 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:57:50,108 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:57:50,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:57:50,108 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:57:50,109 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:57:50,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:57:50,109 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:57:50,109 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:57:50,109 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:57:50,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:57:50,110 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:57:50,110 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:57:50,111 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:57:50,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:57:50,155 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:57:50,159 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:57:50,160 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:57:50,161 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:57:50,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_true-valid-memsafety.i [2018-01-24 11:57:50,342 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:57:50,346 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:57:50,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:57:50,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:57:50,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:57:50,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:57:50" (1/1) ... [2018-01-24 11:57:50,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f959c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50, skipping insertion in model container [2018-01-24 11:57:50,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:57:50" (1/1) ... [2018-01-24 11:57:50,372 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:57:50,410 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:57:50,513 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:57:50,533 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:57:50,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50 WrapperNode [2018-01-24 11:57:50,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:57:50,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:57:50,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:57:50,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:57:50,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50" (1/1) ... [2018-01-24 11:57:50,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50" (1/1) ... [2018-01-24 11:57:50,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50" (1/1) ... [2018-01-24 11:57:50,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50" (1/1) ... [2018-01-24 11:57:50,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50" (1/1) ... [2018-01-24 11:57:50,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50" (1/1) ... [2018-01-24 11:57:50,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50" (1/1) ... [2018-01-24 11:57:50,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:57:50,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:57:50,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:57:50,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:57:50,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50" (1/1) ... No working directory specified, using /storage/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-01-24 11:57:50,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:57:50,613 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:57:50,613 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 11:57:50,613 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:57:50,613 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:57:50,613 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:57:50,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:57:50,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:57:50,613 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:57:50,613 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 11:57:50,614 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 11:57:50,614 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 11:57:50,614 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:57:50,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:57:50,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:57:50,820 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:57:50,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:57:50 BoogieIcfgContainer [2018-01-24 11:57:50,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:57:50,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:57:50,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:57:50,823 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:57:50,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:57:50" (1/3) ... [2018-01-24 11:57:50,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9423e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:57:50, skipping insertion in model container [2018-01-24 11:57:50,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:57:50" (2/3) ... [2018-01-24 11:57:50,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9423e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:57:50, skipping insertion in model container [2018-01-24 11:57:50,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:57:50" (3/3) ... [2018-01-24 11:57:50,826 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_true-valid-memsafety.i [2018-01-24 11:57:50,833 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:57:50,838 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 11:57:50,873 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:57:50,873 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:57:50,873 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:57:50,873 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:57:50,873 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:57:50,874 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:57:50,874 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:57:50,874 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:57:50,874 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:57:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-01-24 11:57:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 11:57:50,892 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:50,892 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:57:50,893 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:50,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-01-24 11:57:50,900 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:50,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:50,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:50,941 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:50,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:50,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:51,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:57:51,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:57:51,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:57:51,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:57:51,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:57:51,077 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-01-24 11:57:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:51,314 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-24 11:57:51,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:57:51,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-24 11:57:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:51,327 INFO L225 Difference]: With dead ends: 84 [2018-01-24 11:57:51,327 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 11:57:51,331 INFO L525 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-01-24 11:57:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 11:57:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 11:57:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 11:57:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-01-24 11:57:51,359 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-01-24 11:57:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:51,360 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-01-24 11:57:51,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:57:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-01-24 11:57:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 11:57:51,360 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:51,360 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:57:51,360 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-01-24 11:57:51,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:51,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:51,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:51,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:51,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:51,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:51,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:57:51,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:57:51,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:57:51,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:57:51,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:57:51,455 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-01-24 11:57:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:51,536 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-24 11:57:51,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:57:51,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-24 11:57:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:51,537 INFO L225 Difference]: With dead ends: 49 [2018-01-24 11:57:51,537 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 11:57:51,538 INFO L525 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-01-24 11:57:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 11:57:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 11:57:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 11:57:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-24 11:57:51,543 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-01-24 11:57:51,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:51,543 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-24 11:57:51,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:57:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-24 11:57:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:57:51,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:51,544 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:57:51,544 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:51,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-01-24 11:57:51,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:51,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:51,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:51,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:51,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:51,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:51,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:57:51,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:57:51,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:57:51,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:57:51,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:57:51,656 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-01-24 11:57:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:51,767 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-24 11:57:51,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:57:51,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-24 11:57:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:51,768 INFO L225 Difference]: With dead ends: 48 [2018-01-24 11:57:51,769 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 11:57:51,769 INFO L525 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-01-24 11:57:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 11:57:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 11:57:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 11:57:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-01-24 11:57:51,777 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-01-24 11:57:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:51,777 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-01-24 11:57:51,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:57:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-01-24 11:57:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:57:51,778 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:51,778 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:57:51,778 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-01-24 11:57:51,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:51,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:51,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:51,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:51,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:51,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:51,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:57:51,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:57:51,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:57:51,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:57:51,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:57:51,957 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-01-24 11:57:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:52,075 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-01-24 11:57:52,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:57:52,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-24 11:57:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:52,076 INFO L225 Difference]: With dead ends: 80 [2018-01-24 11:57:52,076 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 11:57:52,076 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:57:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 11:57:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-01-24 11:57:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 11:57:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-24 11:57:52,083 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-01-24 11:57:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:52,083 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-24 11:57:52,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:57:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-24 11:57:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 11:57:52,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:52,085 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:57:52,085 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:52,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-01-24 11:57:52,085 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:52,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:52,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:52,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:52,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:52,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:52,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:57:52,253 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:57:52,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:52,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:57:52,330 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-01-24 11:57:52,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:52,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:57:52,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 11:57:52,361 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-01-24 11:57:52,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:52,368 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-01-24 11:57:52,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-24 11:57:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:52,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:57:52,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-01-24 11:57:52,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:57:52,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:57:52,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:57:52,537 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 12 states. [2018-01-24 11:57:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:52,964 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-24 11:57:52,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:57:52,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-01-24 11:57:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:52,966 INFO L225 Difference]: With dead ends: 90 [2018-01-24 11:57:52,966 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 11:57:52,967 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:57:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 11:57:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-01-24 11:57:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 11:57:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-24 11:57:52,975 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 21 [2018-01-24 11:57:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:52,975 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-24 11:57:52,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:57:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-24 11:57:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:57:52,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:52,977 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:57:52,977 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-01-24 11:57:52,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:52,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:52,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:52,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:52,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:52,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:53,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:57:53,154 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:57:53,161 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:57:53,176 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:57:53,180 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:57:53,181 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:57:53,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:57:53,187 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-01-24 11:57:53,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:53,193 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-01-24 11:57:53,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:53,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:57:53,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-24 11:57:53,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:57:53,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:57:53,229 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-01-24 11:57:53,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:53,236 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-01-24 11:57:53,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:53,243 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-01-24 11:57:53,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-01-24 11:57:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:53,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:57:53,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-01-24 11:57:53,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:57:53,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:57:53,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:57:53,399 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 17 states. [2018-01-24 11:57:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:53,917 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-24 11:57:53,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:57:53,917 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-01-24 11:57:53,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:53,918 INFO L225 Difference]: With dead ends: 104 [2018-01-24 11:57:53,918 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 11:57:53,919 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-01-24 11:57:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 11:57:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-01-24 11:57:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 11:57:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-01-24 11:57:53,929 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-01-24 11:57:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:53,929 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-01-24 11:57:53,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:57:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-01-24 11:57:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:57:53,930 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:53,931 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:57:53,931 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-01-24 11:57:53,931 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:53,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:53,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:53,932 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:57:53,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:53,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:54,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:57:54,233 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:57:54,238 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:57:54,261 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:54,266 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:54,267 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:57:54,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:57:54,274 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-01-24 11:57:54,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:54,279 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-01-24 11:57:54,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:54,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:57:54,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 11:57:54,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:57:54,323 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-01-24 11:57:54,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:54,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:57:54,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:57:54,335 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-01-24 11:57:54,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:54,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:57:54,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 11:57:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 11:57:54,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:57:54,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-01-24 11:57:54,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 11:57:54,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 11:57:54,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-01-24 11:57:54,542 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 18 states. [2018-01-24 11:57:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:55,197 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-01-24 11:57:55,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:57:55,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-01-24 11:57:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:55,200 INFO L225 Difference]: With dead ends: 125 [2018-01-24 11:57:55,201 INFO L226 Difference]: Without dead ends: 90 [2018-01-24 11:57:55,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2018-01-24 11:57:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-24 11:57:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-01-24 11:57:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 11:57:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-24 11:57:55,213 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-01-24 11:57:55,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:55,214 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-24 11:57:55,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 11:57:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-24 11:57:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 11:57:55,215 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:55,215 INFO L322 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-01-24 11:57:55,215 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:55,215 INFO L82 PathProgramCache]: Analyzing trace with hash -645884181, now seen corresponding path program 1 times [2018-01-24 11:57:55,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:55,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:55,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:55,216 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:57:55,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:55,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:55,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:57:55,307 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:57:55,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:55,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:57:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:55,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:57:55,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-01-24 11:57:55,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:57:55,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:57:55,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:57:55,449 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-01-24 11:57:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:55,591 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-24 11:57:55,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:57:55,594 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-01-24 11:57:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:55,596 INFO L225 Difference]: With dead ends: 136 [2018-01-24 11:57:55,596 INFO L226 Difference]: Without dead ends: 102 [2018-01-24 11:57:55,596 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:57:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-24 11:57:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2018-01-24 11:57:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 11:57:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-01-24 11:57:55,610 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 40 [2018-01-24 11:57:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:55,611 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-01-24 11:57:55,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:57:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-01-24 11:57:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 11:57:55,612 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:55,612 INFO L322 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-01-24 11:57:55,612 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:55,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2113361740, now seen corresponding path program 2 times [2018-01-24 11:57:55,613 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:55,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:55,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:55,614 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:55,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:55,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:57:55,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:57:55,742 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:57:55,753 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:57:55,770 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:57:55,773 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:57:55,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:57:55,781 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-01-24 11:57:55,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:55,789 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-01-24 11:57:55,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-24 11:57:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-24 11:57:55,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:57:55,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-01-24 11:57:55,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:57:55,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:57:55,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:57:55,946 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 15 states. [2018-01-24 11:57:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:56,546 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-01-24 11:57:56,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 11:57:56,546 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-01-24 11:57:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:56,547 INFO L225 Difference]: With dead ends: 150 [2018-01-24 11:57:56,547 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 11:57:56,548 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:57:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 11:57:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2018-01-24 11:57:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-24 11:57:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-01-24 11:57:56,559 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 44 [2018-01-24 11:57:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:56,559 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-01-24 11:57:56,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:57:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-01-24 11:57:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 11:57:56,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:56,560 INFO L322 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-01-24 11:57:56,560 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:56,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1590645252, now seen corresponding path program 1 times [2018-01-24 11:57:56,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:56,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:56,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:56,561 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:57:56,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:56,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-01-24 11:57:56,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:57:56,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:57:56,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:57:56,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:57:56,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:57:56,626 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 4 states. [2018-01-24 11:57:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:56,667 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-01-24 11:57:56,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:57:56,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-24 11:57:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:56,668 INFO L225 Difference]: With dead ends: 87 [2018-01-24 11:57:56,669 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 11:57:56,669 INFO L525 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-01-24 11:57:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 11:57:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-24 11:57:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 11:57:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-01-24 11:57:56,688 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 48 [2018-01-24 11:57:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:56,689 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-01-24 11:57:56,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:57:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-01-24 11:57:56,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-24 11:57:56,692 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:56,693 INFO L322 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-01-24 11:57:56,693 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:56,693 INFO L82 PathProgramCache]: Analyzing trace with hash 221692532, now seen corresponding path program 1 times [2018-01-24 11:57:56,693 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:56,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:56,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:56,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:56,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:56,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-24 11:57:56,846 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:57:56,846 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:57:56,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:56,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:57:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-24 11:57:57,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:57:57,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-24 11:57:57,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 11:57:57,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 11:57:57,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:57:57,020 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 20 states. [2018-01-24 11:57:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:57,155 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-01-24 11:57:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:57:57,155 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-01-24 11:57:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:57,156 INFO L225 Difference]: With dead ends: 142 [2018-01-24 11:57:57,156 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 11:57:57,157 INFO L525 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-01-24 11:57:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 11:57:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-01-24 11:57:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 11:57:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-01-24 11:57:57,168 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 77 [2018-01-24 11:57:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:57,168 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-01-24 11:57:57,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 11:57:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-01-24 11:57:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-24 11:57:57,170 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:57,170 INFO L322 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-01-24 11:57:57,170 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:57,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2016762915, now seen corresponding path program 2 times [2018-01-24 11:57:57,171 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:57,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:57,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:57,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:57,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:57,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-24 11:57:57,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:57:57,394 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:57:57,400 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:57:57,417 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:57:57,419 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:57:57,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:57:57,442 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-01-24 11:57:57,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:57,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:57:57,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-24 11:57:57,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:57:57,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:57:57,480 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-01-24 11:57:57,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:57,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:57:57,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-01-24 11:57:57,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:57:57,574 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-01-24 11:57:57,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:57:57,580 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-01-24 11:57:57,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-24 11:57:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-01-24 11:57:57,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:57:57,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2018-01-24 11:57:57,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 11:57:57,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 11:57:57,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:57:57,635 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 19 states. [2018-01-24 11:57:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:58,191 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2018-01-24 11:57:58,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 11:57:58,191 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-01-24 11:57:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:58,192 INFO L225 Difference]: With dead ends: 156 [2018-01-24 11:57:58,192 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 11:57:58,193 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=475, Invalid=1595, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 11:57:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 11:57:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-01-24 11:57:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 11:57:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-01-24 11:57:58,204 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 89 [2018-01-24 11:57:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:58,204 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-01-24 11:57:58,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 11:57:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-01-24 11:57:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-24 11:57:58,206 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:58,206 INFO L322 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-01-24 11:57:58,206 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1885333684, now seen corresponding path program 1 times [2018-01-24 11:57:58,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:58,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:58,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:58,208 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:57:58,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:58,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-01-24 11:57:58,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:57:58,394 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:57:58,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:58,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:57:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-01-24 11:57:58,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:57:58,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-01-24 11:57:58,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 11:57:58,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 11:57:58,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=353, Unknown=0, NotChecked=0, Total=552 [2018-01-24 11:57:58,538 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 24 states. [2018-01-24 11:57:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:58,647 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-01-24 11:57:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:57:58,648 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2018-01-24 11:57:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:58,649 INFO L225 Difference]: With dead ends: 166 [2018-01-24 11:57:58,649 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 11:57:58,649 INFO L525 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-01-24 11:57:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 11:57:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-24 11:57:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 11:57:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-01-24 11:57:58,662 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 97 [2018-01-24 11:57:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:58,662 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-01-24 11:57:58,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 11:57:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-01-24 11:57:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-24 11:57:58,663 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:58,663 INFO L322 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-01-24 11:57:58,663 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:58,663 INFO L82 PathProgramCache]: Analyzing trace with hash -984574572, now seen corresponding path program 2 times [2018-01-24 11:57:58,663 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:58,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:58,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:58,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:57:58,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:58,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-24 11:57:58,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:57:58,873 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:57:58,880 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:57:58,895 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:57:58,910 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:57:58,914 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:57:58,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:57:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-24 11:57:59,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:57:59,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-01-24 11:57:59,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 11:57:59,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 11:57:59,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=415, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:57:59,078 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 26 states. [2018-01-24 11:57:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:57:59,216 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2018-01-24 11:57:59,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:57:59,216 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2018-01-24 11:57:59,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:57:59,218 INFO L225 Difference]: With dead ends: 178 [2018-01-24 11:57:59,218 INFO L226 Difference]: Without dead ends: 123 [2018-01-24 11:57:59,218 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=260, Invalid=442, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:57:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-24 11:57:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-01-24 11:57:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 11:57:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-01-24 11:57:59,236 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 105 [2018-01-24 11:57:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:57:59,236 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-01-24 11:57:59,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 11:57:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-01-24 11:57:59,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-24 11:57:59,237 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:57:59,238 INFO L322 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-01-24 11:57:59,238 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:57:59,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1299772556, now seen corresponding path program 3 times [2018-01-24 11:57:59,238 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:57:59,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:57:59,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:59,239 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:57:59,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:57:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:57:59,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:57:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-01-24 11:57:59,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:57:59,560 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:57:59,565 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:57:59,583 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,588 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,592 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,596 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,602 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,608 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,621 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,645 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,662 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,693 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,714 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,766 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:57:59,768 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:57:59,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:57:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 42 proven. 242 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-24 11:57:59,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:57:59,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2018-01-24 11:57:59,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-24 11:57:59,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-24 11:57:59,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=666, Unknown=0, NotChecked=0, Total=992 [2018-01-24 11:57:59,994 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 32 states. [2018-01-24 11:58:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:58:00,151 INFO L93 Difference]: Finished difference Result 196 states and 201 transitions. [2018-01-24 11:58:00,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 11:58:00,151 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 113 [2018-01-24 11:58:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:58:00,152 INFO L225 Difference]: With dead ends: 196 [2018-01-24 11:58:00,152 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 11:58:00,153 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=356, Invalid=700, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 11:58:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 11:58:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2018-01-24 11:58:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 11:58:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-01-24 11:58:00,167 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 113 [2018-01-24 11:58:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:58:00,167 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-01-24 11:58:00,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-24 11:58:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-01-24 11:58:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-01-24 11:58:00,169 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:58:00,169 INFO L322 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-01-24 11:58:00,169 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:58:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash -310498389, now seen corresponding path program 4 times [2018-01-24 11:58:00,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:58:00,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:58:00,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:00,170 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:58:00,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:58:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:58:00,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:58:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-24 11:58:00,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:58:00,457 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:58:00,462 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 11:58:00,502 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:58:00,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:58:00,510 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-01-24 11:58:00,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:58:00,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:58:00,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:58:00,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:58:00,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:58:00,528 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-01-24 11:58:00,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:58:00,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:58:00,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-24 11:58:00,553 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-01-24 11:58:00,555 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-01-24 11:58:00,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:58:00,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:58:00,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:58:00,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-01-24 11:58:00,574 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-01-24 11:58:00,576 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-01-24 11:58:00,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:58:00,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:58:00,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:58:00,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:8 [2018-01-24 11:58:00,596 WARN L1029 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((foo_~i~3 Int)) (= (store |c_old(#memory_int)| c_~a.base (store (select |c_old(#memory_int)| c_~a.base) (+ c_~a.offset (* 4 foo_~i~3)) (- 1))) |c_#memory_int|))) is different from true [2018-01-24 11:58:00,602 WARN L1029 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_2 Int) (foo_~i~3 Int)) (= (store |c_old(#memory_int)| c_~a.base (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 foo_~i~3)) (- 1))) |c_#memory_int|))) is different from true [2018-01-24 11:58:00,611 WARN L1029 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (foo_~i~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)) (+ c_~a.offset (* 4 foo_~i~3)) (- 1))) |c_#memory_int|))) is different from true [2018-01-24 11:58:00,618 WARN L1029 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (foo_~i~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)) (+ c_~a.offset (* 4 foo_~i~3)) (- 1))) |c_#memory_int|))) is different from true [2018-01-24 11:58:00,632 WARN L1029 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (foo_~i~3 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (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)) (+ c_~a.offset (* 4 foo_~i~3)) (- 1)))))) is different from true [2018-01-24 11:58:00,656 WARN L1029 $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) (v_prenex_2 Int) (v_prenex_3 Int) (foo_~i~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)) (+ c_~a.offset (* 4 foo_~i~3)) (- 1)))))) is different from true [2018-01-24 11:58:00,668 WARN L1029 $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) (v_prenex_2 Int) (v_prenex_3 Int) (foo_~i~3 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (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 foo_~i~3)) (- 1)))))) is different from true [2018-01-24 11:58:00,682 WARN L1029 $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) (v_prenex_2 Int) (v_prenex_3 Int) (foo_~i~3 Int) (v_prenex_8 Int)) (= (store |c_old(#memory_int)| c_~a.base (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 foo_~i~3)) (- 1))) |c_#memory_int|))) is different from true [2018-01-24 11:58:00,698 WARN L1029 $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) (v_prenex_2 Int) (v_prenex_3 Int) (foo_~i~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)) (+ c_~a.offset (* 4 foo_~i~3)) (- 1)))))) is different from true [2018-01-24 11:58:00,716 WARN L1029 $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) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_10 Int) (foo_~i~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 (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)) (+ c_~a.offset (* 4 foo_~i~3)) (- 1)))))) is different from true [2018-01-24 11:58:00,738 WARN L1029 $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) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_11 Int) (v_prenex_10 Int) (foo_~i~3 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 (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)) (+ c_~a.offset (* 4 foo_~i~3)) (- 1))) |c_#memory_int|))) is different from true [2018-01-24 11:58:00,776 WARN L1029 $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) (v_prenex_2 Int) (v_prenex_12 Int) (v_prenex_3 Int) (v_prenex_11 Int) (v_prenex_10 Int) (foo_~i~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 (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 foo_~i~3)) (- 1)))))) is different from true [2018-01-24 11:58:00,805 WARN L1029 $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) (v_prenex_2 Int) (v_prenex_3 Int) (foo_~i~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)) (+ c_~a.offset (* 4 foo_~i~3)) (- 1)))))) is different from true [2018-01-24 11:58:05,557 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 75 [2018-01-24 11:58:17,946 WARN L143 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 83 [2018-01-24 11:58:23,974 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 86 [2018-01-24 11:58:27,682 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 89 [2018-01-24 11:58:30,252 WARN L143 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 92 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown