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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:49:38,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:49:38,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:49:38,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:49:38,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:49:38,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:49:38,681 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:49:38,684 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:49:38,686 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:49:38,686 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:49:38,687 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:49:38,687 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:49:38,688 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:49:38,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:49:38,690 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:49:38,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:49:38,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:49:38,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:49:38,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:49:38,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:49:38,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:49:38,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:49:38,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:49:38,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:49:38,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:49:38,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:49:38,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:49:38,702 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:49:38,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:49:38,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:49:38,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:49:38,703 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:49:38,714 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:49:38,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:49:38,715 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:49:38,715 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:49:38,715 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:49:38,715 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:49:38,715 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:49:38,715 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:49:38,715 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:49:38,716 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:49:38,716 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:49:38,716 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:49:38,716 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:49:38,716 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:49:38,716 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:49:38,716 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:49:38,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:49:38,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:49:38,716 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:49:38,717 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:49:38,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:49:38,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:49:38,717 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:49:38,717 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:49:38,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:49:38,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:49:38,751 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:49:38,753 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:49:38,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:49:38,754 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:49:38,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-deref.i [2018-02-02 08:49:38,919 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:49:38,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:49:38,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:49:38,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:49:38,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:49:38,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:49:38" (1/1) ... [2018-02-02 08:49:38,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b04038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:38, skipping insertion in model container [2018-02-02 08:49:38,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:49:38" (1/1) ... [2018-02-02 08:49:38,938 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:49:38,964 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:49:39,041 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:49:39,052 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:49:39,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:39 WrapperNode [2018-02-02 08:49:39,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:49:39,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:49:39,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:49:39,057 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:49:39,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:39" (1/1) ... [2018-02-02 08:49:39,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:39" (1/1) ... [2018-02-02 08:49:39,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:39" (1/1) ... [2018-02-02 08:49:39,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:39" (1/1) ... [2018-02-02 08:49:39,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:39" (1/1) ... [2018-02-02 08:49:39,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:39" (1/1) ... [2018-02-02 08:49:39,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:39" (1/1) ... [2018-02-02 08:49:39,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:49:39,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:49:39,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:49:39,079 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:49:39,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:39" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:49:39,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:49:39,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:49:39,116 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 08:49:39,116 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:49:39,116 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:49:39,116 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:49:39,116 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:49:39,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:49:39,117 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:49:39,117 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 08:49:39,117 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 08:49:39,117 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 08:49:39,117 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:49:39,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:49:39,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:49:39,291 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:49:39,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:49:39 BoogieIcfgContainer [2018-02-02 08:49:39,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:49:39,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:49:39,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:49:39,294 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:49:39,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:49:38" (1/3) ... [2018-02-02 08:49:39,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e07115a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:49:39, skipping insertion in model container [2018-02-02 08:49:39,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:39" (2/3) ... [2018-02-02 08:49:39,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e07115a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:49:39, skipping insertion in model container [2018-02-02 08:49:39,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:49:39" (3/3) ... [2018-02-02 08:49:39,296 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-deref.i [2018-02-02 08:49:39,302 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:49:39,307 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-02 08:49:39,331 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:49:39,331 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:49:39,331 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:49:39,331 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:49:39,332 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:49:39,332 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:49:39,332 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:49:39,332 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:49:39,333 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:49:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-02 08:49:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 08:49:39,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:39,353 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:39,353 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:39,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-02-02 08:49:39,359 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:39,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:39,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:39,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:39,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:39,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:39,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:39,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:49:39,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:49:39,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:49:39,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:49:39,533 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-02 08:49:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:39,634 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-02 08:49:39,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:49:39,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-02 08:49:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:39,696 INFO L225 Difference]: With dead ends: 52 [2018-02-02 08:49:39,696 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 08:49:39,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:49:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 08:49:39,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 08:49:39,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 08:49:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-02 08:49:39,725 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-02-02 08:49:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:39,725 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-02 08:49:39,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:49:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-02 08:49:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 08:49:39,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:39,726 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:39,726 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:39,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-02-02 08:49:39,727 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:39,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:39,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:39,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:39,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:39,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:39,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:39,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:49:39,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:49:39,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:49:39,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:49:39,805 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-02-02 08:49:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:39,861 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-02 08:49:39,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:49:39,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-02 08:49:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:39,863 INFO L225 Difference]: With dead ends: 48 [2018-02-02 08:49:39,863 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 08:49:39,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:49:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 08:49:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 08:49:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 08:49:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-02 08:49:39,868 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-02-02 08:49:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:39,868 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-02 08:49:39,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:49:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-02 08:49:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 08:49:39,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:39,869 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:39,869 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-02-02 08:49:39,870 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:39,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:39,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:39,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:39,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:39,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:39,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:39,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:49:39,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:49:39,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:49:39,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:49:39,939 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-02-02 08:49:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:39,990 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-02 08:49:39,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:49:39,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-02 08:49:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:39,991 INFO L225 Difference]: With dead ends: 45 [2018-02-02 08:49:39,991 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 08:49:39,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:49:39,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 08:49:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 08:49:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 08:49:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-02-02 08:49:39,995 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-02-02 08:49:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:39,995 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-02-02 08:49:39,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:49:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-02-02 08:49:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 08:49:39,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:39,996 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:39,996 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:39,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-02-02 08:49:39,997 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:39,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:39,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:39,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:39,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:40,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:40,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:40,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:49:40,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:49:40,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:49:40,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:49:40,116 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-02-02 08:49:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:40,232 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-02 08:49:40,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:49:40,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-02 08:49:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:40,234 INFO L225 Difference]: With dead ends: 53 [2018-02-02 08:49:40,234 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 08:49:40,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:49:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 08:49:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-02-02 08:49:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 08:49:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-02 08:49:40,238 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-02-02 08:49:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:40,239 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-02 08:49:40,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:49:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-02 08:49:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 08:49:40,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:40,240 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:40,240 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:40,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-02-02 08:49:40,240 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:40,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:40,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:40,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:40,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:40,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:40,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:40,364 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:40,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:40,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:40,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:49:40,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:40,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:49:40,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 08:49:40,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-02 08:49:40,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:40,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:49:40,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-02-02 08:49:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:40,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:40,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-02-02 08:49:40,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:49:40,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:49:40,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:49:40,572 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 12 states. [2018-02-02 08:49:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:40,782 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-02 08:49:40,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:49:40,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-02-02 08:49:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:40,783 INFO L225 Difference]: With dead ends: 63 [2018-02-02 08:49:40,783 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 08:49:40,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:49:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 08:49:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-02-02 08:49:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 08:49:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-02 08:49:40,786 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 21 [2018-02-02 08:49:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:40,786 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-02 08:49:40,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:49:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-02 08:49:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:49:40,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:40,787 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:40,787 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:40,787 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-02-02 08:49:40,787 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:40,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:40,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:40,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:40,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:40,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:40,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:40,951 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:40,957 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:49:40,970 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:40,973 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:40,974 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:40,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:40,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:49:40,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:40,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:49:40,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:40,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:49:40,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-02 08:49:41,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:49:41,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:49:41,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:49:41,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:41,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-02 08:49:41,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:41,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:49:41,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-02-02 08:49:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:41,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:41,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-02-02 08:49:41,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 08:49:41,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 08:49:41,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:49:41,181 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 17 states. [2018-02-02 08:49:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:41,593 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-02 08:49:41,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:49:41,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-02-02 08:49:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:41,594 INFO L225 Difference]: With dead ends: 73 [2018-02-02 08:49:41,594 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 08:49:41,594 INFO L554 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-02-02 08:49:41,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 08:49:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-02-02 08:49:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 08:49:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-02 08:49:41,597 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-02-02 08:49:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:41,597 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-02 08:49:41,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 08:49:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-02 08:49:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 08:49:41,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:41,597 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:41,598 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:41,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-02-02 08:49:41,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:41,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:41,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:41,599 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:41,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:41,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:41,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:41,737 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:41,741 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:49:41,754 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:41,756 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:41,757 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:41,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:41,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:49:41,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:41,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:49:41,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:41,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:49:41,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-02 08:49:41,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:49:41,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-02 08:49:41,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:41,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:49:41,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:49:41,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:49:41,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:41,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:49:41,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-02 08:49:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 08:49:42,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:42,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-02-02 08:49:42,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 08:49:42,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 08:49:42,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-02-02 08:49:42,006 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 18 states. [2018-02-02 08:49:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:42,573 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-02 08:49:42,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:49:42,574 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-02-02 08:49:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:42,576 INFO L225 Difference]: With dead ends: 90 [2018-02-02 08:49:42,576 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 08:49:42,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2018-02-02 08:49:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 08:49:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-02-02 08:49:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 08:49:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-02 08:49:42,579 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-02-02 08:49:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:42,579 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-02 08:49:42,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 08:49:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-02 08:49:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 08:49:42,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:42,580 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:42,580 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash -645884181, now seen corresponding path program 1 times [2018-02-02 08:49:42,580 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:42,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:42,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:42,581 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:42,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:42,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:42,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:42,688 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:42,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:42,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:42,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:42,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-02 08:49:42,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:49:42,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:49:42,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:49:42,780 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-02-02 08:49:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:42,912 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-02-02 08:49:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:49:42,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-02-02 08:49:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:42,915 INFO L225 Difference]: With dead ends: 102 [2018-02-02 08:49:42,915 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 08:49:42,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:49:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 08:49:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2018-02-02 08:49:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 08:49:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-02-02 08:49:42,919 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 40 [2018-02-02 08:49:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:42,919 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-02-02 08:49:42,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:49:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-02-02 08:49:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 08:49:42,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:42,920 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:42,920 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2113361740, now seen corresponding path program 2 times [2018-02-02 08:49:42,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:42,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:42,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:42,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:42,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:42,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:43,219 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:43,219 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:43,224 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:49:43,235 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:43,236 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:43,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:43,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:49:43,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:43,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:49:43,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-02 08:49:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 08:49:43,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:49:43,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-02-02 08:49:43,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:49:43,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:49:43,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:49:43,383 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 15 states. [2018-02-02 08:49:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:43,857 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-02-02 08:49:43,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 08:49:43,858 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-02 08:49:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:43,859 INFO L225 Difference]: With dead ends: 94 [2018-02-02 08:49:43,859 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 08:49:43,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:49:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 08:49:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2018-02-02 08:49:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 08:49:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 08:49:43,864 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 44 [2018-02-02 08:49:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:43,864 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 08:49:43,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:49:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 08:49:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:49:43,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:43,865 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:43,865 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1590645252, now seen corresponding path program 1 times [2018-02-02 08:49:43,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:43,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:43,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:43,866 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:43,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:43,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-02 08:49:43,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:43,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:49:43,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:49:43,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:49:43,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:49:43,906 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 4 states. [2018-02-02 08:49:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:43,923 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-02-02 08:49:43,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:49:43,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-02-02 08:49:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:43,924 INFO L225 Difference]: With dead ends: 75 [2018-02-02 08:49:43,924 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 08:49:43,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:49:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 08:49:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-02 08:49:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 08:49:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-02-02 08:49:43,928 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 48 [2018-02-02 08:49:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:43,929 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-02-02 08:49:43,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:49:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-02-02 08:49:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 08:49:43,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:43,930 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:43,930 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:43,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1106929516, now seen corresponding path program 1 times [2018-02-02 08:49:43,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:43,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:43,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:43,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:43,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:43,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 08:49:44,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:44,023 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:44,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:44,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 08:49:44,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:44,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-02 08:49:44,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 08:49:44,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 08:49:44,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-02-02 08:49:44,154 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2018-02-02 08:49:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:44,260 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-02-02 08:49:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:49:44,260 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-02-02 08:49:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:44,261 INFO L225 Difference]: With dead ends: 91 [2018-02-02 08:49:44,261 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 08:49:44,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:49:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 08:49:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-02-02 08:49:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 08:49:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-02-02 08:49:44,265 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 74 [2018-02-02 08:49:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:44,265 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-02-02 08:49:44,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 08:49:44,266 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-02-02 08:49:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 08:49:44,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:44,267 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:44,267 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:44,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2069780427, now seen corresponding path program 2 times [2018-02-02 08:49:44,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:44,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:44,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:44,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:44,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:44,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 08:49:44,383 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:44,383 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:44,388 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:49:44,398 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:44,409 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:44,411 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:44,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 08:49:44,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:44,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-02-02 08:49:44,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:49:44,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:49:44,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=296, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:49:44,507 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 22 states. [2018-02-02 08:49:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:44,598 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-02-02 08:49:44,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:49:44,598 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2018-02-02 08:49:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:44,599 INFO L225 Difference]: With dead ends: 99 [2018-02-02 08:49:44,599 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 08:49:44,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=187, Invalid=319, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:49:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 08:49:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-02 08:49:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 08:49:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-02-02 08:49:44,602 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 86 [2018-02-02 08:49:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:44,602 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-02-02 08:49:44,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:49:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-02-02 08:49:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 08:49:44,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:44,603 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:44,603 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:44,603 INFO L82 PathProgramCache]: Analyzing trace with hash 67534827, now seen corresponding path program 3 times [2018-02-02 08:49:44,604 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:44,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:44,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:44,604 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:44,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:44,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 08:49:44,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:44,734 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:44,742 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:49:44,753 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:44,756 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:44,758 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:44,762 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:44,765 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:44,770 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:44,782 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:44,821 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:44,834 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:44,864 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:44,865 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:44,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 08:49:44,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:44,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-02-02 08:49:44,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:49:44,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:49:44,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:49:44,917 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 15 states. [2018-02-02 08:49:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:45,049 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-02-02 08:49:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:49:45,049 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2018-02-02 08:49:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:45,050 INFO L225 Difference]: With dead ends: 107 [2018-02-02 08:49:45,050 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 08:49:45,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=213, Invalid=387, Unknown=0, NotChecked=0, Total=600 [2018-02-02 08:49:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 08:49:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-02-02 08:49:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 08:49:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-02-02 08:49:45,054 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 94 [2018-02-02 08:49:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:45,054 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-02-02 08:49:45,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:49:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-02-02 08:49:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 08:49:45,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:45,056 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:45,056 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash 306183947, now seen corresponding path program 4 times [2018-02-02 08:49:45,056 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:45,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:45,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:45,057 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:45,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:45,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 08:49:45,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:45,190 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:45,197 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:49:45,222 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:45,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:45,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:49:45,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:45,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:49:45,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-02-02 08:49:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 200 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:45,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:45,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27] total 40 [2018-02-02 08:49:45,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 08:49:45,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 08:49:45,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 08:49:45,589 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 40 states. [2018-02-02 08:49:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:45,917 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-02-02 08:49:45,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 08:49:45,918 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 102 [2018-02-02 08:49:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:45,918 INFO L225 Difference]: With dead ends: 115 [2018-02-02 08:49:45,918 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 08:49:45,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=613, Invalid=2467, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 08:49:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 08:49:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-02-02 08:49:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 08:49:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-02-02 08:49:45,921 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 102 [2018-02-02 08:49:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:45,921 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-02-02 08:49:45,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 08:49:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-02-02 08:49:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 08:49:45,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:45,922 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:45,922 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2043652821, now seen corresponding path program 5 times [2018-02-02 08:49:45,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:45,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:45,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:45,923 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:45,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:45,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 08:49:46,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:46,066 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:46,073 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 08:49:46,084 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,087 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,090 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,095 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,103 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,109 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,132 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,138 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,145 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,166 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,182 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,209 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:46,211 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:46,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 08:49:46,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:46,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2018-02-02 08:49:46,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 08:49:46,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 08:49:46,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:49:46,245 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 17 states. [2018-02-02 08:49:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:46,399 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-02-02 08:49:46,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:49:46,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-02-02 08:49:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:46,399 INFO L225 Difference]: With dead ends: 123 [2018-02-02 08:49:46,399 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 08:49:46,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=290, Invalid=522, Unknown=0, NotChecked=0, Total=812 [2018-02-02 08:49:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 08:49:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-02-02 08:49:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 08:49:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-02-02 08:49:46,401 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 110 [2018-02-02 08:49:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:46,402 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-02-02 08:49:46,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 08:49:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-02-02 08:49:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-02 08:49:46,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:46,403 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:46,403 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash -130219445, now seen corresponding path program 6 times [2018-02-02 08:49:46,404 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:46,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:46,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:46,404 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:46,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:46,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-02 08:49:46,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:46,597 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:46,601 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 08:49:46,610 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:46,613 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:46,615 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:46,619 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:46,625 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:46,638 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:46,667 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:46,717 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:46,769 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:46,800 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:46,864 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:47,057 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:47,340 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:49:47,341 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:47,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 08:49:47,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:47,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 22 [2018-02-02 08:49:47,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:49:47,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:49:47,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:49:47,399 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 22 states. [2018-02-02 08:49:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:47,596 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2018-02-02 08:49:47,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 08:49:47,597 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 118 [2018-02-02 08:49:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:47,597 INFO L225 Difference]: With dead ends: 131 [2018-02-02 08:49:47,597 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 08:49:47,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 08:49:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 08:49:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-02 08:49:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 08:49:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-02-02 08:49:47,599 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 118 [2018-02-02 08:49:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:47,600 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-02-02 08:49:47,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:49:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-02-02 08:49:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-02-02 08:49:47,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:47,601 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:47,601 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:47,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1727297941, now seen corresponding path program 7 times [2018-02-02 08:49:47,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:47,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:47,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:47,601 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:47,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:47,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-02 08:49:47,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:47,753 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:47,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:47,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-02 08:49:47,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:47,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-02-02 08:49:47,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 08:49:47,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 08:49:47,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=631, Unknown=0, NotChecked=0, Total=992 [2018-02-02 08:49:47,964 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 32 states. [2018-02-02 08:49:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:48,085 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-02-02 08:49:48,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:49:48,086 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-02-02 08:49:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:48,086 INFO L225 Difference]: With dead ends: 139 [2018-02-02 08:49:48,086 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 08:49:48,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=664, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 08:49:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 08:49:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-02-02 08:49:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 08:49:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-02-02 08:49:48,088 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 126 [2018-02-02 08:49:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:48,089 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-02-02 08:49:48,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 08:49:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-02-02 08:49:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-02 08:49:48,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:48,089 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:48,089 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash 293691787, now seen corresponding path program 8 times [2018-02-02 08:49:48,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:48,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:48,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:48,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:48,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:48,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-02 08:49:48,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:48,271 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:48,276 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:49:48,288 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:48,304 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:48,306 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:48,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-02 08:49:48,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:48,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-02-02 08:49:48,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 08:49:48,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 08:49:48,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=713, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:49:48,467 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 34 states. [2018-02-02 08:49:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:48,616 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-02-02 08:49:48,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 08:49:48,616 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 134 [2018-02-02 08:49:48,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:48,617 INFO L225 Difference]: With dead ends: 147 [2018-02-02 08:49:48,617 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 08:49:48,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=442, Invalid=748, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 08:49:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 08:49:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-02-02 08:49:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 08:49:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-02-02 08:49:48,620 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 134 [2018-02-02 08:49:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:48,620 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-02-02 08:49:48,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 08:49:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-02-02 08:49:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 08:49:48,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:48,623 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:48,623 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1657017259, now seen corresponding path program 9 times [2018-02-02 08:49:48,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:48,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:48,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:48,624 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:48,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:48,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-02 08:49:48,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:48,906 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:48,910 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:49:48,922 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:48,925 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:48,927 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:48,930 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:48,933 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:48,941 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:48,948 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:48,963 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:49,000 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:49,031 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:49,076 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:49,177 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:49,205 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:49,519 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:49,665 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:49,854 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:49:49,855 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:49,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 58 proven. 450 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-02 08:49:50,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:50,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2018-02-02 08:49:50,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 08:49:50,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 08:49:50,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1112, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 08:49:50,082 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 41 states. [2018-02-02 08:49:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:50,311 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-02-02 08:49:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:49:50,312 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2018-02-02 08:49:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:50,312 INFO L225 Difference]: With dead ends: 161 [2018-02-02 08:49:50,312 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 08:49:50,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=572, Invalid=1234, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 08:49:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 08:49:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2018-02-02 08:49:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 08:49:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-02-02 08:49:50,316 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 142 [2018-02-02 08:49:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:50,316 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-02-02 08:49:50,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 08:49:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-02-02 08:49:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 08:49:50,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:50,317 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:50,317 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:50,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1444851412, now seen corresponding path program 10 times [2018-02-02 08:49:50,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:50,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:50,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:50,318 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:50,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:50,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-02 08:49:50,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:50,537 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:50,542 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:49:52,020 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:49:52,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-02 08:49:52,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:52,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2018-02-02 08:49:52,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 08:49:52,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 08:49:52,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=989, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 08:49:52,209 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 40 states. [2018-02-02 08:49:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:52,358 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-02-02 08:49:52,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 08:49:52,359 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-02-02 08:49:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:52,360 INFO L225 Difference]: With dead ends: 171 [2018-02-02 08:49:52,360 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 08:49:52,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=610, Invalid=1030, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 08:49:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 08:49:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-02-02 08:49:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 08:49:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-02-02 08:49:52,363 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 154 [2018-02-02 08:49:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:52,364 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-02-02 08:49:52,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 08:49:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-02-02 08:49:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-02 08:49:52,365 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:52,365 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:52,365 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:49:52,365 INFO L82 PathProgramCache]: Analyzing trace with hash 43004939, now seen corresponding path program 11 times [2018-02-02 08:49:52,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:52,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:52,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:52,366 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:49:52,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:52,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-02 08:49:52,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:52,642 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:52,647 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 08:49:52,657 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:52,659 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:52,661 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:52,666 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:52,672 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:52,693 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:52,742 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:52,772 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:52,853 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:52,912 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:53,095 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:53,196 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:53,803 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:54,098 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:49:59,575 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:50:01,962 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:50:05,053 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:50:07,597 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:50:17,536 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:50:17,755 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:50:17,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-02 08:50:17,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:50:17,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2018-02-02 08:50:17,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 08:50:17,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 08:50:17,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2018-02-02 08:50:17,818 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 24 states. [2018-02-02 08:50:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:18,061 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-02-02 08:50:18,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 08:50:18,061 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 166 [2018-02-02 08:50:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:18,061 INFO L225 Difference]: With dead ends: 179 [2018-02-02 08:50:18,062 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 08:50:18,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=654, Invalid=1152, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 08:50:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 08:50:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-02-02 08:50:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 08:50:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-02-02 08:50:18,065 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 166 [2018-02-02 08:50:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:18,065 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-02-02 08:50:18,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 08:50:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-02-02 08:50:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-02-02 08:50:18,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:18,066 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:18,066 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:50:18,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1199391275, now seen corresponding path program 12 times [2018-02-02 08:50:18,066 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:18,066 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:18,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:18,067 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:50:18,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:18,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-02 08:50:18,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:50:18,328 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:50:18,334 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 08:50:18,345 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:18,348 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:18,350 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:18,354 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:18,368 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:18,382 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:18,405 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:18,459 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:18,514 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:18,622 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:18,760 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:19,080 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:19,410 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:19,979 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:20,747 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:22,469 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:25,924 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:32,342 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:36,658 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:37,856 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:50:37,859 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:50:37,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-02 08:50:37,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:50:37,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 25 [2018-02-02 08:50:37,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 08:50:37,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 08:50:37,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2018-02-02 08:50:37,914 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 25 states. [2018-02-02 08:50:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:38,171 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-02-02 08:50:38,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:50:38,173 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 174 [2018-02-02 08:50:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:38,173 INFO L225 Difference]: With dead ends: 187 [2018-02-02 08:50:38,173 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 08:50:38,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=718, Invalid=1262, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 08:50:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 08:50:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-02 08:50:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 08:50:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-02-02 08:50:38,176 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 174 [2018-02-02 08:50:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:38,176 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-02-02 08:50:38,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 08:50:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-02-02 08:50:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-02 08:50:38,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:38,177 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:38,177 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:50:38,177 INFO L82 PathProgramCache]: Analyzing trace with hash 917677899, now seen corresponding path program 13 times [2018-02-02 08:50:38,177 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:38,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:38,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:38,178 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:50:38,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:38,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-02 08:50:38,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:50:38,476 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:50:38,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:38,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-02 08:50:38,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:50:38,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2018-02-02 08:50:38,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 08:50:38,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 08:50:38,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=1310, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 08:50:38,856 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 46 states. [2018-02-02 08:50:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:39,012 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-02-02 08:50:39,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 08:50:39,012 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 182 [2018-02-02 08:50:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:39,013 INFO L225 Difference]: With dead ends: 195 [2018-02-02 08:50:39,013 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 08:50:39,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=805, Invalid=1357, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 08:50:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 08:50:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-02-02 08:50:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 08:50:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-02-02 08:50:39,016 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 182 [2018-02-02 08:50:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:39,016 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-02-02 08:50:39,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 08:50:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-02-02 08:50:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-02 08:50:39,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:39,016 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:39,016 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:50:39,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1121313643, now seen corresponding path program 14 times [2018-02-02 08:50:39,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:39,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:39,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:39,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:39,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:39,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-02 08:50:39,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:50:39,313 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:50:39,318 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:50:39,335 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:50:39,369 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:50:39,373 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:50:39,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-02 08:50:39,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:50:39,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-02 08:50:39,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 08:50:39,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 08:50:39,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=829, Invalid=1427, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 08:50:39,586 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 48 states. [2018-02-02 08:50:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:39,748 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2018-02-02 08:50:39,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 08:50:39,748 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 190 [2018-02-02 08:50:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:39,749 INFO L225 Difference]: With dead ends: 203 [2018-02-02 08:50:39,749 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 08:50:39,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=876, Invalid=1476, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 08:50:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 08:50:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-02-02 08:50:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 08:50:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-02-02 08:50:39,753 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 190 [2018-02-02 08:50:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:39,753 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-02-02 08:50:39,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 08:50:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-02-02 08:50:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-02 08:50:39,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:39,755 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:39,755 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:50:39,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1456240267, now seen corresponding path program 15 times [2018-02-02 08:50:39,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:39,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:39,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:39,756 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:50:39,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:39,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-02 08:50:40,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:50:40,146 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:50:40,151 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:50:40,165 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,168 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,170 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,174 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,178 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,188 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,202 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,210 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,232 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,316 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,407 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,449 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,590 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,654 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,687 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,839 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:40,924 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:41,215 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:41,773 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:42,083 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:42,683 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:43,585 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:44,615 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:50:44,623 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:50:44,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-02 08:50:44,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:50:44,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 28 [2018-02-02 08:50:44,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 08:50:44,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 08:50:44,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2018-02-02 08:50:44,868 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 28 states. [2018-02-02 08:50:45,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:45,180 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2018-02-02 08:50:45,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 08:50:45,180 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 198 [2018-02-02 08:50:45,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:45,181 INFO L225 Difference]: With dead ends: 211 [2018-02-02 08:50:45,181 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 08:50:45,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=928, Invalid=1622, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 08:50:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 08:50:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-02-02 08:50:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 08:50:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-02-02 08:50:45,185 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 198 [2018-02-02 08:50:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:45,185 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-02-02 08:50:45,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 08:50:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-02-02 08:50:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-02 08:50:45,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:45,186 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:45,186 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 08:50:45,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1245978453, now seen corresponding path program 16 times [2018-02-02 08:50:45,187 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:45,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:45,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:45,188 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:50:45,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:45,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-02-02 08:50:45,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:50:45,565 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:50:45,570 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:50:45,615 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:50:45,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:45,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:50:45,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:45,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:45,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 Received shutdown request... [2018-02-02 08:50:46,909 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 08:50:46,909 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:50:46,912 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:50:46,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:50:46 BoogieIcfgContainer [2018-02-02 08:50:46,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:50:46,913 INFO L168 Benchmark]: Toolchain (without parser) took 67993.90 ms. Allocated memory was 406.3 MB in the beginning and 953.7 MB in the end (delta: 547.4 MB). Free memory was 363.2 MB in the beginning and 547.9 MB in the end (delta: -184.7 MB). Peak memory consumption was 362.7 MB. Max. memory is 5.3 GB. [2018-02-02 08:50:46,914 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 406.3 MB. Free memory is still 368.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:50:46,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.98 ms. Allocated memory is still 406.3 MB. Free memory was 363.2 MB in the beginning and 352.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:50:46,914 INFO L168 Benchmark]: Boogie Preprocessor took 21.93 ms. Allocated memory is still 406.3 MB. Free memory was 352.6 MB in the beginning and 349.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:50:46,915 INFO L168 Benchmark]: RCFGBuilder took 212.65 ms. Allocated memory is still 406.3 MB. Free memory was 349.9 MB in the beginning and 330.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:50:46,915 INFO L168 Benchmark]: TraceAbstraction took 67620.79 ms. Allocated memory was 406.3 MB in the beginning and 953.7 MB in the end (delta: 547.4 MB). Free memory was 330.6 MB in the beginning and 547.9 MB in the end (delta: -217.2 MB). Peak memory consumption was 330.1 MB. Max. memory is 5.3 GB. [2018-02-02 08:50:46,916 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 406.3 MB. Free memory is still 368.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 135.98 ms. Allocated memory is still 406.3 MB. Free memory was 363.2 MB in the beginning and 352.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.93 ms. Allocated memory is still 406.3 MB. Free memory was 352.6 MB in the beginning and 349.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 212.65 ms. Allocated memory is still 406.3 MB. Free memory was 349.9 MB in the beginning and 330.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67620.79 ms. Allocated memory was 406.3 MB in the beginning and 953.7 MB in the end (delta: 547.4 MB). Free memory was 330.6 MB in the beginning and 547.9 MB in the end (delta: -217.2 MB). Peak memory consumption was 330.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. TIMEOUT Result, 67.5s OverallTime, 26 OverallIterations, 24 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 580 SDtfs, 4582 SDslu, 4704 SDs, 0 SdLazy, 4809 SolverSat, 1134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2822 GetRequests, 2129 SyntacticMatches, 16 SemanticMatches, 677 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6941 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 136 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 53.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 4522 NumberOfCodeBlocks, 4478 NumberOfCodeBlocksAsserted, 157 NumberOfCheckSat, 4477 ConstructedInterpolants, 82 QuantifiedInterpolants, 1986867 SizeOfPredicates, 53 NumberOfNonLiveVariables, 6416 ConjunctsInSsa, 378 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 13670/27810 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-50-46-923.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-50-46-923.csv Completed graceful shutdown