java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:34:40,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:34:40,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:34:40,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:34:40,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:34:40,474 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:34:40,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:34:40,477 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:34:40,479 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:34:40,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:34:40,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:34:40,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:34:40,481 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:34:40,482 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:34:40,482 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:34:40,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:34:40,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:34:40,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:34:40,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:34:40,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:34:40,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:34:40,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:34:40,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:34:40,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:34:40,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:34:40,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:34:40,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:34:40,493 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:34:40,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:34:40,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:34:40,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:34:40,494 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:34:40,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:34:40,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:34:40,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:34:40,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:34:40,505 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:34:40,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:34:40,505 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:34:40,505 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:34:40,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:34:40,506 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:34:40,506 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:34:40,506 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:34:40,506 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:34:40,506 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:34:40,506 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:34:40,507 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:34:40,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:34:40,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:34:40,507 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:34:40,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:34:40,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:34:40,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:34:40,508 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:34:40,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:34:40,508 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:34:40,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:34:40,550 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:34:40,553 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:34:40,554 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:34:40,554 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:34:40,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-02-04 00:34:40,704 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:34:40,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:34:40,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:34:40,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:34:40,710 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:34:40,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:34:40" (1/1) ... [2018-02-04 00:34:40,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40, skipping insertion in model container [2018-02-04 00:34:40,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:34:40" (1/1) ... [2018-02-04 00:34:40,727 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:34:40,762 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:34:40,840 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:34:40,853 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:34:40,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40 WrapperNode [2018-02-04 00:34:40,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:34:40,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:34:40,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:34:40,858 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:34:40,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40" (1/1) ... [2018-02-04 00:34:40,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40" (1/1) ... [2018-02-04 00:34:40,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40" (1/1) ... [2018-02-04 00:34:40,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40" (1/1) ... [2018-02-04 00:34:40,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40" (1/1) ... [2018-02-04 00:34:40,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40" (1/1) ... [2018-02-04 00:34:40,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40" (1/1) ... [2018-02-04 00:34:40,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:34:40,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:34:40,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:34:40,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:34:40,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40" (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-04 00:34:40,921 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:34:40,921 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:34:40,921 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:34:40,922 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 00:34:40,922 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:34:40,922 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:34:40,922 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:34:40,922 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:34:40,922 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:34:40,922 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:34:40,922 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:34:40,922 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:34:40,922 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:34:40,922 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:34:40,922 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:34:40,923 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 00:34:40,923 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:34:40,923 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:34:40,923 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:34:40,923 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:34:41,076 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:34:41,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:34:41 BoogieIcfgContainer [2018-02-04 00:34:41,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:34:41,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:34:41,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:34:41,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:34:41,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:34:40" (1/3) ... [2018-02-04 00:34:41,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710e4625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:34:41, skipping insertion in model container [2018-02-04 00:34:41,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:40" (2/3) ... [2018-02-04 00:34:41,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710e4625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:34:41, skipping insertion in model container [2018-02-04 00:34:41,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:34:41" (3/3) ... [2018-02-04 00:34:41,083 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-02-04 00:34:41,088 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:34:41,094 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 00:34:41,122 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:34:41,123 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:34:41,123 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:34:41,123 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:34:41,123 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:34:41,123 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:34:41,123 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:34:41,123 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:34:41,124 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:34:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-02-04 00:34:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:34:41,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:41,144 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:41,144 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times [2018-02-04 00:34:41,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:41,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:41,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:41,196 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:41,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:41,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:41,294 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-04 00:34:41,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:34:41,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:34:41,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:34:41,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:34:41,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:34:41,311 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-02-04 00:34:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:41,461 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2018-02-04 00:34:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:34:41,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 00:34:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:41,472 INFO L225 Difference]: With dead ends: 102 [2018-02-04 00:34:41,472 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 00:34:41,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:34:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 00:34:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-02-04 00:34:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 00:34:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-02-04 00:34:41,508 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2018-02-04 00:34:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:41,508 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-02-04 00:34:41,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:34:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-02-04 00:34:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:34:41,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:41,510 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:41,510 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:41,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times [2018-02-04 00:34:41,510 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:41,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:41,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:41,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:41,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:41,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:41,579 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-04 00:34:41,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:34:41,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:34:41,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:34:41,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:34:41,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:34:41,581 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-02-04 00:34:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:41,607 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-04 00:34:41,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:34:41,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 00:34:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:41,609 INFO L225 Difference]: With dead ends: 65 [2018-02-04 00:34:41,609 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 00:34:41,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:34:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 00:34:41,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-02-04 00:34:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 00:34:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-04 00:34:41,615 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17 [2018-02-04 00:34:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:41,615 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-04 00:34:41,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:34:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-04 00:34:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:34:41,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:41,616 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:41,616 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:41,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times [2018-02-04 00:34:41,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:41,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:41,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:41,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:41,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:41,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:41,669 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-04 00:34:41,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:34:41,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:34:41,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:34:41,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:34:41,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:34:41,671 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2018-02-04 00:34:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:41,705 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-02-04 00:34:41,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:34:41,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 00:34:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:41,707 INFO L225 Difference]: With dead ends: 61 [2018-02-04 00:34:41,707 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 00:34:41,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:34:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 00:34:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 00:34:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 00:34:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-04 00:34:41,711 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-02-04 00:34:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:41,712 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-04 00:34:41,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:34:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-04 00:34:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:34:41,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:41,712 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:41,713 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:41,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times [2018-02-04 00:34:41,713 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:41,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:41,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:41,714 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:41,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:41,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:41,768 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-04 00:34:41,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:34:41,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:34:41,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:34:41,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:34:41,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:34:41,769 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-02-04 00:34:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:41,852 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-04 00:34:41,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:34:41,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 00:34:41,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:41,853 INFO L225 Difference]: With dead ends: 60 [2018-02-04 00:34:41,853 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 00:34:41,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:34:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 00:34:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 00:34:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 00:34:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 00:34:41,857 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2018-02-04 00:34:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:41,858 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 00:34:41,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:34:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 00:34:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:34:41,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:41,859 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:41,859 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times [2018-02-04 00:34:41,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:41,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:41,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:41,860 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:41,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:41,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:42,062 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-04 00:34:42,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:34:42,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:34:42,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:34:42,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:34:42,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:34:42,063 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-02-04 00:34:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:42,255 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 00:34:42,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:34:42,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 00:34:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:42,256 INFO L225 Difference]: With dead ends: 64 [2018-02-04 00:34:42,256 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 00:34:42,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:34:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 00:34:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-02-04 00:34:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 00:34:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 00:34:42,260 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19 [2018-02-04 00:34:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:42,261 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 00:34:42,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:34:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 00:34:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:34:42,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:42,262 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:42,262 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:42,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times [2018-02-04 00:34:42,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:42,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:42,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:42,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:42,264 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:42,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:42,455 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-04 00:34:42,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:34:42,455 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:34:42,464 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:42,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:34:42,529 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 20 treesize of output 19 [2018-02-04 00:34:42,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:42,556 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 17 treesize of output 16 [2018-02-04 00:34:42,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:42,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:34:42,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 00:34:42,799 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-04 00:34:42,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:34:42,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 00:34:42,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 00:34:42,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 00:34:42,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 00:34:42,816 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 18 states. [2018-02-04 00:34:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:43,048 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 00:34:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:34:43,049 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-02-04 00:34:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:43,049 INFO L225 Difference]: With dead ends: 68 [2018-02-04 00:34:43,049 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 00:34:43,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-02-04 00:34:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 00:34:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-02-04 00:34:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 00:34:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-04 00:34:43,054 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 23 [2018-02-04 00:34:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:43,054 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-04 00:34:43,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 00:34:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-04 00:34:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 00:34:43,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:43,055 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:43,055 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times [2018-02-04 00:34:43,055 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:43,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:43,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:43,056 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:43,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:43,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:34:43,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:34:43,236 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:34:43,243 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:34:43,261 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:34:43,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:34:43,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:34:43,281 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 20 treesize of output 19 [2018-02-04 00:34:43,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:43,293 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 17 treesize of output 16 [2018-02-04 00:34:43,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:43,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:34:43,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 00:34:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:34:43,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:34:43,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 00:34:43,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:34:43,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:34:43,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:34:43,517 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 23 states. [2018-02-04 00:34:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:43,732 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-02-04 00:34:43,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:34:43,733 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-04 00:34:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:43,733 INFO L225 Difference]: With dead ends: 67 [2018-02-04 00:34:43,733 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 00:34:43,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:34:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 00:34:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-02-04 00:34:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 00:34:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 00:34:43,736 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 27 [2018-02-04 00:34:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:43,737 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 00:34:43,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:34:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 00:34:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:34:43,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:43,738 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:43,738 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:43,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1629737492, now seen corresponding path program 1 times [2018-02-04 00:34:43,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:43,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:43,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:43,739 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:34:43,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:43,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:34:43,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:34:43,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:34:43,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:34:43,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:34:43,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:34:43,779 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 4 states. [2018-02-04 00:34:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:43,836 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-02-04 00:34:43,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:34:43,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 00:34:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:43,838 INFO L225 Difference]: With dead ends: 90 [2018-02-04 00:34:43,838 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 00:34:43,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:34:43,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 00:34:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2018-02-04 00:34:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 00:34:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2018-02-04 00:34:43,844 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 35 [2018-02-04 00:34:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:43,844 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-02-04 00:34:43,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:34:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2018-02-04 00:34:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:34:43,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:43,846 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:43,846 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1629737491, now seen corresponding path program 1 times [2018-02-04 00:34:43,846 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:43,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:43,847 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:43,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:43,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:43,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 00:34:43,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:34:43,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:34:43,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:34:43,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:34:43,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:34:43,897 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 6 states. [2018-02-04 00:34:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:43,917 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-02-04 00:34:43,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:34:43,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-04 00:34:43,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:43,918 INFO L225 Difference]: With dead ends: 80 [2018-02-04 00:34:43,918 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 00:34:43,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:34:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 00:34:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 00:34:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 00:34:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2018-02-04 00:34:43,923 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 35 [2018-02-04 00:34:43,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:43,923 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2018-02-04 00:34:43,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:34:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-02-04 00:34:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 00:34:43,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:43,924 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:43,924 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:43,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1277044790, now seen corresponding path program 1 times [2018-02-04 00:34:43,924 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:43,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:43,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:43,926 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:43,926 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:43,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 00:34:43,971 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:34:43,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:34:43,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:34:43,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:34:43,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:34:43,973 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 5 states. [2018-02-04 00:34:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:43,986 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-02-04 00:34:43,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:34:43,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 00:34:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:43,988 INFO L225 Difference]: With dead ends: 84 [2018-02-04 00:34:43,988 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 00:34:43,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:34:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 00:34:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-02-04 00:34:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 00:34:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-02-04 00:34:43,993 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 38 [2018-02-04 00:34:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:43,993 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-02-04 00:34:43,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:34:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-02-04 00:34:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 00:34:43,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:43,994 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:43,994 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:43,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1199349870, now seen corresponding path program 1 times [2018-02-04 00:34:43,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:43,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:43,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:43,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:43,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:44,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:34:44,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:34:44,035 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:34:44,043 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:44,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:34:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:34:44,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:34:44,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 00:34:44,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:34:44,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:34:44,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:34:44,104 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 9 states. [2018-02-04 00:34:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:44,130 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-02-04 00:34:44,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:34:44,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-02-04 00:34:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:44,131 INFO L225 Difference]: With dead ends: 86 [2018-02-04 00:34:44,131 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 00:34:44,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:34:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 00:34:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-02-04 00:34:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 00:34:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-02-04 00:34:44,134 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 38 [2018-02-04 00:34:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:44,134 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-02-04 00:34:44,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:34:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-02-04 00:34:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:34:44,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:44,134 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:44,134 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:44,135 INFO L82 PathProgramCache]: Analyzing trace with hash -176675913, now seen corresponding path program 2 times [2018-02-04 00:34:44,135 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:44,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:44,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:44,135 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:44,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:44,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:34:44,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:34:44,175 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:34:44,183 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:34:44,199 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 00:34:44,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:34:44,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:34:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 00:34:44,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:34:44,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 00:34:44,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:34:44,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:34:44,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:34:44,242 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 9 states. [2018-02-04 00:34:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:44,327 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2018-02-04 00:34:44,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:34:44,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-04 00:34:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:44,328 INFO L225 Difference]: With dead ends: 115 [2018-02-04 00:34:44,328 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 00:34:44,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:34:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 00:34:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 87. [2018-02-04 00:34:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 00:34:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-04 00:34:44,332 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 42 [2018-02-04 00:34:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:44,332 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-04 00:34:44,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:34:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-04 00:34:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:34:44,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:44,333 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:44,333 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1262891178, now seen corresponding path program 1 times [2018-02-04 00:34:44,333 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:44,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:44,334 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:44,334 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:34:44,334 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:44,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:34:44,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:34:44,424 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 00:34:44,435 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:44,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:34:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:34:44,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:34:44,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 00:34:44,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:34:44,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:34:44,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:34:44,540 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 13 states. [2018-02-04 00:34:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:44,600 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-04 00:34:44,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:34:44,600 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 00:34:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:44,601 INFO L225 Difference]: With dead ends: 93 [2018-02-04 00:34:44,601 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 00:34:44,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:34:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 00:34:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-02-04 00:34:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 00:34:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-02-04 00:34:44,603 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 48 [2018-02-04 00:34:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:44,603 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-02-04 00:34:44,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:34:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-02-04 00:34:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:34:44,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:44,604 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:44,604 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2016472243, now seen corresponding path program 2 times [2018-02-04 00:34:44,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:44,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:44,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:44,605 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:34:44,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:44,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:34:44,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:34:44,666 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:34:44,672 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:34:44,689 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:34:44,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:34:44,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:34:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:34:44,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:34:44,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 00:34:44,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:34:44,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:34:44,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:34:44,749 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 15 states. [2018-02-04 00:34:44,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:34:44,788 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-02-04 00:34:44,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:34:44,788 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 00:34:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:34:44,789 INFO L225 Difference]: With dead ends: 97 [2018-02-04 00:34:44,789 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 00:34:44,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 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-04 00:34:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 00:34:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-04 00:34:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 00:34:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-04 00:34:44,791 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 52 [2018-02-04 00:34:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:34:44,792 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-04 00:34:44,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:34:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-04 00:34:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 00:34:44,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:34:44,792 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:34:44,792 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:34:44,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2044492860, now seen corresponding path program 3 times [2018-02-04 00:34:44,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:34:44,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:34:44,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:44,793 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:34:44,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:34:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:34:44,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:34:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:34:44,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:34:44,891 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:34:44,904 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:34:44,925 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 00:34:44,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:34:44,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:34:44,960 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 23 treesize of output 22 [2018-02-04 00:34:44,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:44,979 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 26 treesize of output 25 [2018-02-04 00:34:44,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:44,981 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 22 treesize of output 21 [2018-02-04 00:34:44,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:44,999 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 25 treesize of output 24 [2018-02-04 00:34:44,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:45,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:34:45,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:34:45,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:34:45,175 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 35 treesize of output 38 [2018-02-04 00:34:45,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:45,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:34:45,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:34:45,196 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 34 treesize of output 28 [2018-02-04 00:34:45,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:45,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:34:45,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:34:45,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-02-04 00:34:45,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:45,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:34:45,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:34:45,232 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 36 treesize of output 30 [2018-02-04 00:34:45,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:34:45,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 00:34:45,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 00:34:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 00:34:45,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:34:45,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-04 00:34:45,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:34:45,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:34:45,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-02-04 00:34:45,342 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 21 states. [2018-02-04 00:35:07,720 WARN L143 SmtUtils]: Spent 14102ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 00:35:28,215 WARN L146 SmtUtils]: Spent 20443ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 00:35:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:35:28,472 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2018-02-04 00:35:28,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 00:35:28,472 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-04 00:35:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:35:28,473 INFO L225 Difference]: With dead ends: 161 [2018-02-04 00:35:28,474 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 00:35:28,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482 [2018-02-04 00:35:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 00:35:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 114. [2018-02-04 00:35:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 00:35:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-02-04 00:35:28,478 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 56 [2018-02-04 00:35:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:35:28,479 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-02-04 00:35:28,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:35:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-02-04 00:35:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 00:35:28,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:35:28,479 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:35:28,479 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:35:28,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1800200380, now seen corresponding path program 1 times [2018-02-04 00:35:28,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:35:28,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:35:28,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:28,480 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:35:28,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:28,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:35:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:35:28,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:35:28,550 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:35:28,558 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:35:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:28,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:35:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:35:28,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:35:28,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 00:35:28,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:35:28,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:35:28,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:35:28,676 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 19 states. [2018-02-04 00:35:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:35:28,714 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-02-04 00:35:28,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:35:28,714 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 00:35:28,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:35:28,715 INFO L225 Difference]: With dead ends: 120 [2018-02-04 00:35:28,715 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 00:35:28,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:35:28,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 00:35:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-04 00:35:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 00:35:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2018-02-04 00:35:28,719 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 60 [2018-02-04 00:35:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:35:28,720 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2018-02-04 00:35:28,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:35:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-02-04 00:35:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 00:35:28,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:35:28,720 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:35:28,720 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:35:28,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1308562893, now seen corresponding path program 2 times [2018-02-04 00:35:28,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:35:28,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:35:28,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:28,721 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:35:28,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:28,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:35:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:35:28,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:35:28,813 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:35:28,818 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:35:28,835 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:35:28,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:35:28,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:35:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:35:28,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:35:28,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 00:35:28,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:35:28,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:35:28,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:35:28,922 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 21 states. [2018-02-04 00:35:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:35:28,967 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2018-02-04 00:35:28,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:35:28,967 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 00:35:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:35:28,968 INFO L225 Difference]: With dead ends: 124 [2018-02-04 00:35:28,968 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 00:35:28,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:35:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 00:35:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-04 00:35:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 00:35:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-02-04 00:35:28,975 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 64 [2018-02-04 00:35:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:35:28,975 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-02-04 00:35:28,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:35:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-02-04 00:35:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 00:35:28,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:35:28,976 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:35:28,976 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:35:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash -68509738, now seen corresponding path program 3 times [2018-02-04 00:35:28,976 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:35:28,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:35:28,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:28,977 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:35:28,977 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:28,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:35:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:35:29,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:35:29,058 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:35:29,064 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:35:29,083 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 00:35:29,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:35:29,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:35:29,087 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-04 00:35:29,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:29,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:35:29,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:35:29,129 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 00:35:29,133 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 12 treesize of output 11 [2018-02-04 00:35:29,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:29,135 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-04 00:35:29,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 00:35:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 3 not checked. [2018-02-04 00:35:29,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:35:29,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2018-02-04 00:35:29,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:35:29,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:35:29,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=298, Unknown=1, NotChecked=36, Total=420 [2018-02-04 00:35:29,164 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 21 states. [2018-02-04 00:35:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:35:29,454 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-02-04 00:35:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 00:35:29,454 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-02-04 00:35:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:35:29,455 INFO L225 Difference]: With dead ends: 141 [2018-02-04 00:35:29,455 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 00:35:29,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=1138, Unknown=2, NotChecked=72, Total=1482 [2018-02-04 00:35:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 00:35:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2018-02-04 00:35:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 00:35:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-02-04 00:35:29,459 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 68 [2018-02-04 00:35:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:35:29,459 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-02-04 00:35:29,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:35:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-02-04 00:35:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 00:35:29,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:35:29,460 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:35:29,460 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:35:29,460 INFO L82 PathProgramCache]: Analyzing trace with hash 955550151, now seen corresponding path program 1 times [2018-02-04 00:35:29,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:35:29,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:35:29,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:29,461 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:35:29,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:29,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:35:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 00:35:29,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:35:29,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:35:29,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:35:29,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:35:29,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:35:29,502 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 4 states. [2018-02-04 00:35:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:35:29,524 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-04 00:35:29,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:35:29,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 00:35:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:35:29,525 INFO L225 Difference]: With dead ends: 120 [2018-02-04 00:35:29,525 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 00:35:29,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-04 00:35:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 00:35:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2018-02-04 00:35:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 00:35:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-02-04 00:35:29,528 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 73 [2018-02-04 00:35:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:35:29,528 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-02-04 00:35:29,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:35:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-02-04 00:35:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 00:35:29,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:35:29,529 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:35:29,529 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:35:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash 509492026, now seen corresponding path program 1 times [2018-02-04 00:35:29,530 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:35:29,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:35:29,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:29,531 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:35:29,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:29,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:35:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-04 00:35:29,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:35:29,702 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:35:29,706 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:35:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:29,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:35:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-04 00:35:29,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:35:29,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-02-04 00:35:29,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:35:29,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:35:29,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-02-04 00:35:29,825 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 13 states. [2018-02-04 00:35:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:35:30,001 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-04 00:35:30,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:35:30,002 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-02-04 00:35:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:35:30,002 INFO L225 Difference]: With dead ends: 125 [2018-02-04 00:35:30,002 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 00:35:30,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=247, Unknown=9, NotChecked=0, Total=306 [2018-02-04 00:35:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 00:35:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 00:35:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 00:35:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-02-04 00:35:30,004 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 80 [2018-02-04 00:35:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:35:30,005 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-02-04 00:35:30,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:35:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-02-04 00:35:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 00:35:30,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:35:30,005 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:35:30,005 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:35:30,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2010390940, now seen corresponding path program 1 times [2018-02-04 00:35:30,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:35:30,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:35:30,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:30,006 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:35:30,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:30,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:35:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 00:35:30,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:35:30,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:35:30,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:35:30,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:35:30,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:35:30,044 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 6 states. [2018-02-04 00:35:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:35:30,062 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-04 00:35:30,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:35:30,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-02-04 00:35:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:35:30,063 INFO L225 Difference]: With dead ends: 111 [2018-02-04 00:35:30,063 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 00:35:30,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:35:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 00:35:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-04 00:35:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 00:35:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-04 00:35:30,064 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 82 [2018-02-04 00:35:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:35:30,065 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-04 00:35:30,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:35:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-04 00:35:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 00:35:30,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:35:30,065 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:35:30,065 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:35:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash 732875601, now seen corresponding path program 1 times [2018-02-04 00:35:30,065 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:35:30,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:35:30,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:30,066 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:35:30,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:30,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:35:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 00:35:30,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:35:30,106 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 00:35:30,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:35:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:30,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:35:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 00:35:30,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:35:30,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 00:35:30,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:35:30,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:35:30,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:35:30,223 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 8 states. [2018-02-04 00:35:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:35:30,256 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-02-04 00:35:30,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:35:30,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-02-04 00:35:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:35:30,257 INFO L225 Difference]: With dead ends: 144 [2018-02-04 00:35:30,257 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 00:35:30,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:35:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 00:35:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-02-04 00:35:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 00:35:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-02-04 00:35:30,259 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 83 [2018-02-04 00:35:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:35:30,259 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-02-04 00:35:30,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:35:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-02-04 00:35:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 00:35:30,260 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:35:30,260 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:35:30,260 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:35:30,260 INFO L82 PathProgramCache]: Analyzing trace with hash -490917573, now seen corresponding path program 1 times [2018-02-04 00:35:30,260 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:35:30,260 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:35:30,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:30,261 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:35:30,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:35:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:30,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:35:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-04 00:35:30,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:35:30,577 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 00:35:30,582 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:35:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:35:30,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:35:30,620 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 20 treesize of output 19 [2018-02-04 00:35:30,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:30,622 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 23 treesize of output 22 [2018-02-04 00:35:30,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:30,632 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 19 treesize of output 18 [2018-02-04 00:35:30,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:30,641 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 22 treesize of output 21 [2018-02-04 00:35:30,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:30,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 00:35:30,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-02-04 00:35:31,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:31,545 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 55 treesize of output 58 [2018-02-04 00:35:31,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:31,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:31,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:31,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 70 [2018-02-04 00:35:31,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:31,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:31,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:31,608 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 54 treesize of output 48 [2018-02-04 00:35:31,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:31,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:31,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:31,635 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 56 treesize of output 50 [2018-02-04 00:35:31,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:31,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-02-04 00:35:31,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-02-04 00:35:32,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,094 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 71 treesize of output 65 [2018-02-04 00:35:32,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:32,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,187 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 69 treesize of output 63 [2018-02-04 00:35:32,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:32,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 100 [2018-02-04 00:35:32,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 00:35:32,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,436 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 64 treesize of output 58 [2018-02-04 00:35:32,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:32,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-02-04 00:35:32,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:32,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2018-02-04 00:35:32,566 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 00:35:32,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 92 [2018-02-04 00:35:32,705 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 00:35:32,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,877 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 62 treesize of output 56 [2018-02-04 00:35:32,878 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:32,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:32,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-02-04 00:35:32,882 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 00:35:33,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:33,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:33,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:35:33,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 90 [2018-02-04 00:35:33,031 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 00:35:33,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 40 dim-0 vars, and 8 xjuncts. [2018-02-04 00:35:33,222 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 32 variables, input treesize:285, output treesize:437 [2018-02-04 00:35:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 142 proven. 76 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:35:33,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:35:33,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 41 [2018-02-04 00:35:33,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 00:35:33,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 00:35:33,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1571, Unknown=4, NotChecked=0, Total=1722 [2018-02-04 00:35:33,623 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 42 states. [2018-02-04 00:35:37,825 WARN L146 SmtUtils]: Spent 3977ms on a formula simplification. DAG size of input: 70 DAG size of output 66 [2018-02-04 00:35:41,920 WARN L146 SmtUtils]: Spent 4039ms on a formula simplification. DAG size of input: 52 DAG size of output 49 [2018-02-04 00:35:43,955 WARN L146 SmtUtils]: Spent 1989ms on a formula simplification. DAG size of input: 52 DAG size of output 51 [2018-02-04 00:35:46,064 WARN L146 SmtUtils]: Spent 2050ms on a formula simplification. DAG size of input: 58 DAG size of output 53 [2018-02-04 00:36:19,911 WARN L146 SmtUtils]: Spent 30575ms on a formula simplification. DAG size of input: 82 DAG size of output 81 [2018-02-04 00:36:57,707 WARN L146 SmtUtils]: Spent 37742ms on a formula simplification. DAG size of input: 89 DAG size of output 85 [2018-02-04 00:37:30,264 WARN L146 SmtUtils]: Spent 32509ms on a formula simplification. DAG size of input: 91 DAG size of output 85 [2018-02-04 00:38:01,653 WARN L146 SmtUtils]: Spent 31199ms on a formula simplification. DAG size of input: 91 DAG size of output 85 [2018-02-04 00:38:02,201 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 74 DAG size of output 68 [2018-02-04 00:38:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:02,400 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2018-02-04 00:38:02,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 00:38:02,400 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 85 [2018-02-04 00:38:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:02,401 INFO L225 Difference]: With dead ends: 145 [2018-02-04 00:38:02,401 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 00:38:02,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 148.3s TimeCoverageRelationStatistics Valid=707, Invalid=5295, Unknown=4, NotChecked=0, Total=6006 [2018-02-04 00:38:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 00:38:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 111. [2018-02-04 00:38:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 00:38:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-02-04 00:38:02,406 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 85 [2018-02-04 00:38:02,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:02,406 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-02-04 00:38:02,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 00:38:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-02-04 00:38:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 00:38:02,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:02,407 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:38:02,407 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:38:02,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1398657356, now seen corresponding path program 1 times [2018-02-04 00:38:02,408 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:02,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:02,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:02,409 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:02,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:02,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 00:38:02,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:02,586 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 00:38:02,594 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:02,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-04 00:38:02,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:02,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-02-04 00:38:02,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:38:02,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:38:02,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:38:02,865 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 21 states. [2018-02-04 00:38:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:03,112 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-04 00:38:03,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 00:38:03,112 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-02-04 00:38:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:03,112 INFO L225 Difference]: With dead ends: 111 [2018-02-04 00:38:03,113 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 00:38:03,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2018-02-04 00:38:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 00:38:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-04 00:38:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 00:38:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-04 00:38:03,115 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 86 [2018-02-04 00:38:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:03,115 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-04 00:38:03,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:38:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-04 00:38:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 00:38:03,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:03,116 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:38:03,116 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:38:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash 408705067, now seen corresponding path program 1 times [2018-02-04 00:38:03,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:03,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:03,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:03,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:03,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:03,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-04 00:38:03,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:03,336 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 00:38:03,341 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:03,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:03,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 00:38:03,406 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 12 treesize of output 11 [2018-02-04 00:38:03,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:03,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:03,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:03,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 00:38:03,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 00:38:03,534 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:38:03,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 00:38:03,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:03,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:03,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:03,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-02-04 00:38:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 00:38:03,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:03,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2018-02-04 00:38:03,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:38:03,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:38:03,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:38:03,561 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 23 states. [2018-02-04 00:38:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:03,937 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-02-04 00:38:03,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 00:38:03,937 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2018-02-04 00:38:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:03,938 INFO L225 Difference]: With dead ends: 154 [2018-02-04 00:38:03,938 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 00:38:03,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1282, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 00:38:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 00:38:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-02-04 00:38:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 00:38:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2018-02-04 00:38:03,942 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 87 [2018-02-04 00:38:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:03,942 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2018-02-04 00:38:03,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:38:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2018-02-04 00:38:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 00:38:03,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:03,943 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:38:03,943 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:38:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash 408705068, now seen corresponding path program 1 times [2018-02-04 00:38:03,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:03,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:03,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:03,944 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:03,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:03,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 00:38:04,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:04,273 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 00:38:04,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:04,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:04,337 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-04 00:38:04,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:04,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:04,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:38:04,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 00:38:04,370 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 12 treesize of output 11 [2018-02-04 00:38:04,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:04,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:04,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:04,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 00:38:04,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-04 00:38:04,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:04,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:04,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-02-04 00:38:04,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-02-04 00:38:04,473 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:38:04,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 00:38:04,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:04,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:04,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:04,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-02-04 00:38:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 00:38:04,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:04,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 24 [2018-02-04 00:38:04,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 00:38:04,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 00:38:04,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-02-04 00:38:04,511 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 25 states. [2018-02-04 00:38:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:38:04,866 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-02-04 00:38:04,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:38:04,867 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2018-02-04 00:38:04,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:38:04,868 INFO L225 Difference]: With dead ends: 135 [2018-02-04 00:38:04,868 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 00:38:04,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 00:38:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 00:38:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-02-04 00:38:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 00:38:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2018-02-04 00:38:04,872 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 87 [2018-02-04 00:38:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:38:04,872 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2018-02-04 00:38:04,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 00:38:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2018-02-04 00:38:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 00:38:04,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:38:04,873 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:38:04,873 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:38:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1923546252, now seen corresponding path program 1 times [2018-02-04 00:38:04,873 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:38:04,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:38:04,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:04,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:04,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:38:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:04,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:38:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-04 00:38:05,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:38:05,226 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 00:38:05,231 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:38:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:38:05,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:38:05,254 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-04 00:38:05,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:05,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:05,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:38:05,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:05,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:05,318 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-04 00:38:05,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:05,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:05,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 00:38:05,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 00:38:05,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:38:05,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:05,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:05,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:05,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 00:38:05,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 00:38:05,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:05,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 00:38:05,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:19 [2018-02-04 00:38:09,440 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-04 00:38:10,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-02-04 00:38:10,076 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:38:10,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 00:38:10,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:10,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:10,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:38:10,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:10 [2018-02-04 00:38:10,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:38:10,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 00:38:10,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:38:10,100 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 2 xjuncts. [2018-02-04 00:38:10,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-02-04 00:38:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 00:38:10,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:38:10,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-02-04 00:38:10,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 00:38:10,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 00:38:10,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=959, Unknown=1, NotChecked=0, Total=1056 [2018-02-04 00:38:10,145 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 33 states. Received shutdown request... [2018-02-04 00:38:20,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:38:20,572 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 00:38:20,575 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 00:38:20,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:38:20 BoogieIcfgContainer [2018-02-04 00:38:20,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:38:20,576 INFO L168 Benchmark]: Toolchain (without parser) took 219871.59 ms. Allocated memory was 402.1 MB in the beginning and 781.2 MB in the end (delta: 379.1 MB). Free memory was 359.0 MB in the beginning and 479.1 MB in the end (delta: -120.1 MB). Peak memory consumption was 259.0 MB. Max. memory is 5.3 GB. [2018-02-04 00:38:20,577 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:38:20,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.11 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 345.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:38:20,577 INFO L168 Benchmark]: Boogie Preprocessor took 27.55 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 344.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:38:20,577 INFO L168 Benchmark]: RCFGBuilder took 191.39 ms. Allocated memory is still 402.1 MB. Free memory was 344.5 MB in the beginning and 322.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-04 00:38:20,577 INFO L168 Benchmark]: TraceAbstraction took 219497.55 ms. Allocated memory was 402.1 MB in the beginning and 781.2 MB in the end (delta: 379.1 MB). Free memory was 322.5 MB in the beginning and 479.1 MB in the end (delta: -156.6 MB). Peak memory consumption was 222.4 MB. Max. memory is 5.3 GB. [2018-02-04 00:38:20,578 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.13 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.11 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 345.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.55 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 344.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 191.39 ms. Allocated memory is still 402.1 MB. Free memory was 344.5 MB in the beginning and 322.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 219497.55 ms. Allocated memory was 402.1 MB in the beginning and 781.2 MB in the end (delta: 379.1 MB). Free memory was 322.5 MB in the beginning and 479.1 MB in the end (delta: -156.6 MB). Peak memory consumption was 222.4 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 free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1471]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1471). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (132states) and interpolant automaton (currently 9 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 13 error locations. TIMEOUT Result, 219.4s OverallTime, 27 OverallIterations, 11 TraceHistogramMax, 205.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1428 SDtfs, 1530 SDslu, 8957 SDs, 0 SdLazy, 5584 SolverSat, 339 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 21.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1469 GetRequests, 978 SyntacticMatches, 14 SemanticMatches, 477 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3206 ImplicationChecksByTransitivity, 192.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=26, 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.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 266 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 2504 NumberOfCodeBlocks, 2432 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2460 ConstructedInterpolants, 183 QuantifiedInterpolants, 1261550 SizeOfPredicates, 79 NumberOfNonLiveVariables, 3387 ConjunctsInSsa, 325 ConjunctsInUnsatCore, 44 InterpolantComputations, 11 PerfectInterpolantSequences, 3604/4696 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/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-38-20-582.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-38-20-582.csv Completed graceful shutdown