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_test10_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:31:00,757 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:31:00,758 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:31:00,771 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:31:00,771 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:31:00,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:31:00,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:31:00,774 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:31:00,775 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:31:00,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:31:00,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:31:00,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:31:00,777 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:31:00,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:31:00,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:31:00,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:31:00,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:31:00,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:31:00,784 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:31:00,785 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:31:00,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:31:00,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:31:00,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:31:00,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:31:00,788 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:31:00,789 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:31:00,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:31:00,790 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:31:00,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:31:00,790 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:31:00,790 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:31:00,790 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:31:00,799 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:31:00,799 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:31:00,800 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:31:00,800 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:31:00,800 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:31:00,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:31:00,801 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:31:00,801 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:31:00,801 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:31:00,801 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:31:00,801 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:31:00,801 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:31:00,801 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:31:00,801 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:31:00,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:31:00,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:31:00,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:31:00,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:31:00,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:31:00,802 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:31:00,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:31:00,802 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:31:00,802 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:31:00,802 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:31:00,802 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:31:00,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:31:00,836 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:31:00,839 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:31:00,840 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:31:00,841 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:31:00,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_false-valid-memtrack_true-termination.i [2018-02-04 00:31:00,972 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:31:00,973 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:31:00,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:31:00,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:31:00,978 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:31:00,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:31:00" (1/1) ... [2018-02-04 00:31:00,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1719b99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:00, skipping insertion in model container [2018-02-04 00:31:00,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:31:00" (1/1) ... [2018-02-04 00:31:00,990 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:31:01,026 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:31:01,106 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:31:01,118 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:31:01,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:01 WrapperNode [2018-02-04 00:31:01,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:31:01,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:31:01,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:31:01,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:31:01,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:01" (1/1) ... [2018-02-04 00:31:01,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:01" (1/1) ... [2018-02-04 00:31:01,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:01" (1/1) ... [2018-02-04 00:31:01,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:01" (1/1) ... [2018-02-04 00:31:01,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:01" (1/1) ... [2018-02-04 00:31:01,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:01" (1/1) ... [2018-02-04 00:31:01,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:01" (1/1) ... [2018-02-04 00:31:01,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:31:01,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:31:01,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:31:01,147 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:31:01,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:01" (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:31:01,180 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:31:01,180 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:31:01,180 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:31:01,180 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-02-04 00:31:01,180 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:31:01,180 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:31:01,180 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:31:01,180 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:31:01,180 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:31:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:31:01,367 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:31:01,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:31:01 BoogieIcfgContainer [2018-02-04 00:31:01,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:31:01,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:31:01,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:31:01,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:31:01,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:31:00" (1/3) ... [2018-02-04 00:31:01,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7812d875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:31:01, skipping insertion in model container [2018-02-04 00:31:01,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:31:01" (2/3) ... [2018-02-04 00:31:01,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7812d875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:31:01, skipping insertion in model container [2018-02-04 00:31:01,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:31:01" (3/3) ... [2018-02-04 00:31:01,372 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test10_false-valid-memtrack_true-termination.i [2018-02-04 00:31:01,377 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:31:01,383 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-02-04 00:31:01,413 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:31:01,413 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:31:01,413 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:31:01,413 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:31:01,414 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:31:01,414 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:31:01,414 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:31:01,414 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:31:01,414 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:31:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-02-04 00:31:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 00:31:01,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:01,435 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:31:01,435 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash 178224559, now seen corresponding path program 1 times [2018-02-04 00:31:01,441 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:01,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:01,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:01,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:01,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:01,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:01,593 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:31:01,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:31:01,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:31:01,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:31:01,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:31:01,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:31:01,609 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2018-02-04 00:31:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:01,823 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2018-02-04 00:31:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:31:01,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 00:31:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:01,835 INFO L225 Difference]: With dead ends: 137 [2018-02-04 00:31:01,835 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 00:31:01,837 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:31:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 00:31:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 82. [2018-02-04 00:31:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 00:31:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 00:31:01,867 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 16 [2018-02-04 00:31:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:01,867 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 00:31:01,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:31:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 00:31:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 00:31:01,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:01,869 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:31:01,869 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 892424113, now seen corresponding path program 1 times [2018-02-04 00:31:01,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:01,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:01,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:01,871 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:01,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:01,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:01,928 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:31:01,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:31:01,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:31:01,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:31:01,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:31:01,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:31:01,930 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 6 states. [2018-02-04 00:31:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:02,060 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2018-02-04 00:31:02,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:31:02,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 00:31:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:02,062 INFO L225 Difference]: With dead ends: 128 [2018-02-04 00:31:02,062 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 00:31:02,063 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:31:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 00:31:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 78. [2018-02-04 00:31:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 00:31:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-02-04 00:31:02,071 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 18 [2018-02-04 00:31:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:02,071 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-02-04 00:31:02,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:31:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-02-04 00:31:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:31:02,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:02,072 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:31:02,072 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2038882856, now seen corresponding path program 1 times [2018-02-04 00:31:02,073 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:02,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:02,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:02,074 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:02,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:02,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:31:02,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:02,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 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:31:02,185 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:02,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:02,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:31:02,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-02-04 00:31:02,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:31:02,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:31:02,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:31:02,257 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 5 states. [2018-02-04 00:31:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:02,283 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-02-04 00:31:02,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:31:02,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 00:31:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:02,284 INFO L225 Difference]: With dead ends: 82 [2018-02-04 00:31:02,284 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 00:31:02,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 3 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:31:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 00:31:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 00:31:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 00:31:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-04 00:31:02,288 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 19 [2018-02-04 00:31:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:02,288 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-04 00:31:02,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:31:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-04 00:31:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 00:31:02,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:02,288 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:31:02,288 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:02,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1489811686, now seen corresponding path program 1 times [2018-02-04 00:31:02,289 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:02,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:02,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:02,290 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:02,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:02,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:02,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:02,329 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:31:02,334 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:02,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:02,371 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:31:02,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:02,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:02,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:31:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:02,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:02,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 00:31:02,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:31:02,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:31:02,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:31:02,415 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2018-02-04 00:31:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:02,632 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-02-04 00:31:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:31:02,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 00:31:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:02,633 INFO L225 Difference]: With dead ends: 98 [2018-02-04 00:31:02,633 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 00:31:02,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:31:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 00:31:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2018-02-04 00:31:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 00:31:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-02-04 00:31:02,637 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 21 [2018-02-04 00:31:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:02,637 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-02-04 00:31:02,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:31:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-02-04 00:31:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 00:31:02,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:02,638 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:31:02,638 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1489811687, now seen corresponding path program 1 times [2018-02-04 00:31:02,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:02,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:02,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:02,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:02,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:02,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:02,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:02,836 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:31:02,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:02,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:02,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 00:31:02,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:02,903 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:31:02,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:02,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:31:02,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 00:31:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:03,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:03,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-02-04 00:31:03,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:31:03,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:31:03,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:31:03,064 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 13 states. [2018-02-04 00:31:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:03,552 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-02-04 00:31:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:31:03,553 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-02-04 00:31:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:03,554 INFO L225 Difference]: With dead ends: 126 [2018-02-04 00:31:03,554 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 00:31:03,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:31:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 00:31:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2018-02-04 00:31:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 00:31:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 143 transitions. [2018-02-04 00:31:03,558 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 143 transitions. Word has length 21 [2018-02-04 00:31:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:03,558 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 143 transitions. [2018-02-04 00:31:03,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:31:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2018-02-04 00:31:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:31:03,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:03,559 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:31:03,559 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1393839336, now seen corresponding path program 1 times [2018-02-04 00:31:03,559 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:03,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:03,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:03,560 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:03,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:03,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:03,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:03,632 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:31:03,637 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:03,649 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:03,654 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:31:03,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:03,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:03,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:31:03,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:03,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:03,683 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 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 00:31:03,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:03,690 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:31:03,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 00:31:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:03,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:03,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-04 00:31:03,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:31:03,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:31:03,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2018-02-04 00:31:03,721 INFO L87 Difference]: Start difference. First operand 110 states and 143 transitions. Second operand 11 states. [2018-02-04 00:31:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:04,095 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2018-02-04 00:31:04,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:31:04,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 00:31:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:04,096 INFO L225 Difference]: With dead ends: 125 [2018-02-04 00:31:04,096 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 00:31:04,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=162, Unknown=1, NotChecked=0, Total=210 [2018-02-04 00:31:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 00:31:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 103. [2018-02-04 00:31:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 00:31:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2018-02-04 00:31:04,102 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 23 [2018-02-04 00:31:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:04,102 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2018-02-04 00:31:04,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:31:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2018-02-04 00:31:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:31:04,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:04,102 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:31:04,103 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:04,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1393839337, now seen corresponding path program 1 times [2018-02-04 00:31:04,103 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:04,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:04,104 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:04,104 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:04,104 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:04,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:04,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:04,269 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:31:04,274 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:04,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:04,303 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:31:04,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:04,315 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:31:04,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:04,326 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:31:04,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:04,328 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:31:04,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:04,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:31:04,338 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:31:04,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:04,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:04,445 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:31:04,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:04,450 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 12 treesize of output 15 [2018-02-04 00:31:04,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:04,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:04,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 00:31:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:04,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:04,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-04 00:31:04,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:31:04,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:31:04,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=291, Unknown=1, NotChecked=0, Total=342 [2018-02-04 00:31:04,488 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand 19 states. [2018-02-04 00:31:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:05,288 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-02-04 00:31:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:31:05,288 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-04 00:31:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:05,289 INFO L225 Difference]: With dead ends: 140 [2018-02-04 00:31:05,289 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 00:31:05,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=545, Unknown=5, NotChecked=0, Total=650 [2018-02-04 00:31:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 00:31:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 70. [2018-02-04 00:31:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 00:31:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 00:31:05,294 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 23 [2018-02-04 00:31:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:05,295 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 00:31:05,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:31:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 00:31:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:31:05,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:05,296 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, 1, 1, 1, 1, 1] [2018-02-04 00:31:05,296 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:05,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2074519941, now seen corresponding path program 1 times [2018-02-04 00:31:05,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:05,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:05,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:05,297 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:05,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:05,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:31:05,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:05,392 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:31:05,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:05,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:31:05,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:05,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-02-04 00:31:05,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:31:05,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:31:05,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=143, Unknown=10, NotChecked=0, Total=182 [2018-02-04 00:31:05,572 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 14 states. [2018-02-04 00:31:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:05,915 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-04 00:31:05,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:31:05,915 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-02-04 00:31:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:05,916 INFO L225 Difference]: With dead ends: 107 [2018-02-04 00:31:05,916 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 00:31:05,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=309, Unknown=10, NotChecked=0, Total=380 [2018-02-04 00:31:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 00:31:05,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2018-02-04 00:31:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 00:31:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 00:31:05,921 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 28 [2018-02-04 00:31:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:05,921 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 00:31:05,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:31:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 00:31:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 00:31:05,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:05,922 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:31:05,922 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1176134599, now seen corresponding path program 1 times [2018-02-04 00:31:05,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:05,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:05,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:05,924 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:05,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:05,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:31:05,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:31:05,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:31:05,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:31:05,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:31:05,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:31:05,962 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-02-04 00:31:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:06,007 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-02-04 00:31:06,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:31:06,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 00:31:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:06,007 INFO L225 Difference]: With dead ends: 78 [2018-02-04 00:31:06,007 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 00:31:06,008 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:31:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 00:31:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2018-02-04 00:31:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 00:31:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 00:31:06,012 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 30 [2018-02-04 00:31:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:06,012 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 00:31:06,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:31:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 00:31:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:31:06,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:06,013 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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:31:06,013 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:06,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1793953534, now seen corresponding path program 1 times [2018-02-04 00:31:06,014 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:06,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:06,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:06,015 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:06,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:06,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 00:31:06,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:06,066 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:31:06,075 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:06,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:06,110 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 11 treesize of output 8 [2018-02-04 00:31:06,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:31:06,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,121 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 11 treesize of output 8 [2018-02-04 00:31:06,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:31:06,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-02-04 00:31:06,136 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 15 treesize of output 11 [2018-02-04 00:31:06,137 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 11 treesize of output 3 [2018-02-04 00:31:06,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,144 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 15 treesize of output 11 [2018-02-04 00:31:06,146 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 11 treesize of output 3 [2018-02-04 00:31:06,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-02-04 00:31:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:31:06,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:31:06,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-02-04 00:31:06,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:31:06,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:31:06,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:31:06,187 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-04 00:31:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:06,229 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-02-04 00:31:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:31:06,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 00:31:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:06,230 INFO L225 Difference]: With dead ends: 73 [2018-02-04 00:31:06,230 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 00:31:06,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 5 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:31:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 00:31:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 00:31:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 00:31:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-04 00:31:06,233 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 31 [2018-02-04 00:31:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:06,233 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-04 00:31:06,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:31:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-04 00:31:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 00:31:06,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:06,234 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 00:31:06,234 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:06,238 INFO L82 PathProgramCache]: Analyzing trace with hash -644511616, now seen corresponding path program 2 times [2018-02-04 00:31:06,238 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:06,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:06,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:06,239 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:06,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:06,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:31:06,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:06,294 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:31:06,305 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:31:06,321 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:31:06,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:31:06,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:06,327 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:31:06,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:31:06,333 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 11 treesize of output 8 [2018-02-04 00:31:06,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:31:06,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,340 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:31:06,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 00:31:06,342 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 17 treesize of output 13 [2018-02-04 00:31:06,344 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 5 [2018-02-04 00:31:06,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-04 00:31:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:31:06,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:06,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-02-04 00:31:06,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:31:06,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:31:06,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:31:06,367 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 8 states. [2018-02-04 00:31:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:06,494 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 00:31:06,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:31:06,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 00:31:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:06,495 INFO L225 Difference]: With dead ends: 77 [2018-02-04 00:31:06,495 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 00:31:06,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:31:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 00:31:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2018-02-04 00:31:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 00:31:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 00:31:06,498 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 33 [2018-02-04 00:31:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:06,498 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 00:31:06,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:31:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 00:31:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 00:31:06,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:06,499 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 00:31:06,499 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash -644511615, now seen corresponding path program 1 times [2018-02-04 00:31:06,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:06,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:06,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:06,501 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:31:06,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:06,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 00:31:06,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:06,648 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:31:06,656 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:06,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:06,690 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:31:06,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,703 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:31:06,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,718 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:31:06,718 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,721 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:31:06,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:31:06,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-02-04 00:31:06,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:06,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:06,867 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:31:06,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,871 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 12 treesize of output 15 [2018-02-04 00:31:06,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 00:31:06,894 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 11 treesize of output 8 [2018-02-04 00:31:06,895 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 8 treesize of output 7 [2018-02-04 00:31:06,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,905 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 11 treesize of output 8 [2018-02-04 00:31:06,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:31:06,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2018-02-04 00:31:06,936 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 19 [2018-02-04 00:31:06,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 10 [2018-02-04 00:31:06,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:31:06,954 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 11 treesize of output 3 [2018-02-04 00:31:06,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:06,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:06,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:23 [2018-02-04 00:31:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:07,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:07,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-02-04 00:31:07,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:31:07,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:31:07,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:31:07,011 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 21 states. [2018-02-04 00:31:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:07,450 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-04 00:31:07,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 00:31:07,451 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-02-04 00:31:07,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:07,451 INFO L225 Difference]: With dead ends: 93 [2018-02-04 00:31:07,451 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 00:31:07,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-04 00:31:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 00:31:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 69. [2018-02-04 00:31:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 00:31:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-04 00:31:07,453 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 33 [2018-02-04 00:31:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:07,454 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-04 00:31:07,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:31:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-04 00:31:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:31:07,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:07,454 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:31:07,454 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash -991528574, now seen corresponding path program 1 times [2018-02-04 00:31:07,454 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:07,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:07,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:07,455 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:07,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:07,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:31:07,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:07,548 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:31:07,554 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:07,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:07,574 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:31:07,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:07,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:07,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:31:07,593 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 11 treesize of output 8 [2018-02-04 00:31:07,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:31:07,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:07,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:07,600 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:31:07,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 00:31:07,608 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 17 treesize of output 13 [2018-02-04 00:31:07,610 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 5 [2018-02-04 00:31:07,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:07,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:07,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:07,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-04 00:31:07,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:07,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:07,637 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 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 00:31:07,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:07,641 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:31:07,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 00:31:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:31:07,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:07,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 00:31:07,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:31:07,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:31:07,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2018-02-04 00:31:07,683 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 12 states. [2018-02-04 00:31:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:07,885 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-02-04 00:31:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:31:07,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-04 00:31:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:07,886 INFO L225 Difference]: With dead ends: 75 [2018-02-04 00:31:07,886 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 00:31:07,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=218, Unknown=1, NotChecked=0, Total=272 [2018-02-04 00:31:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 00:31:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-02-04 00:31:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 00:31:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-04 00:31:07,889 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 35 [2018-02-04 00:31:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:07,889 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-04 00:31:07,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:31:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-04 00:31:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 00:31:07,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:07,890 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 00:31:07,890 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:07,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2141714276, now seen corresponding path program 1 times [2018-02-04 00:31:07,890 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:07,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:07,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:07,891 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:07,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:07,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:31:08,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:08,021 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:31:08,029 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:08,053 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:08,071 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:31:08,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:08,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:08,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:31:08,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:08,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:08,117 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 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 00:31:08,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:08,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:08,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 00:31:08,139 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 11 treesize of output 8 [2018-02-04 00:31:08,140 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 8 treesize of output 7 [2018-02-04 00:31:08,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:08,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:08,146 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:31:08,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-02-04 00:31:08,170 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 15 treesize of output 8 [2018-02-04 00:31:08,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:08,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:08,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:12 [2018-02-04 00:31:12,185 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 12 [2018-02-04 00:31:12,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-04 00:31:12,223 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:31:12,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:12,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:12,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:12,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2018-02-04 00:31:12,230 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 19 [2018-02-04 00:31:12,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 10 [2018-02-04 00:31:12,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:12,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:12,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:12,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2018-02-04 00:31:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:12,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:12,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-02-04 00:31:12,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:31:12,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:31:12,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=360, Unknown=1, NotChecked=0, Total=420 [2018-02-04 00:31:12,277 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 21 states. [2018-02-04 00:31:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:36,569 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-02-04 00:31:36,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:31:36,569 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-02-04 00:31:36,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:36,569 INFO L225 Difference]: With dead ends: 81 [2018-02-04 00:31:36,569 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 00:31:36,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=83, Invalid=468, Unknown=1, NotChecked=0, Total=552 [2018-02-04 00:31:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 00:31:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2018-02-04 00:31:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 00:31:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-02-04 00:31:36,572 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 36 [2018-02-04 00:31:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:36,572 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-02-04 00:31:36,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:31:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-02-04 00:31:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 00:31:36,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:36,573 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 00:31:36,573 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2141714275, now seen corresponding path program 1 times [2018-02-04 00:31:36,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:36,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:36,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:36,574 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:36,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:36,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:31:36,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:36,693 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:31:36,698 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:36,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:36,715 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:31:36,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:31:36,725 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:31:36,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,736 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:31:36,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 00:31:36,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:46 [2018-02-04 00:31:36,812 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:36,812 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:36,813 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 28 treesize of output 22 [2018-02-04 00:31:36,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:36,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:36,828 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 26 treesize of output 20 [2018-02-04 00:31:36,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 00:31:36,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:43 [2018-02-04 00:31:36,896 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 39 treesize of output 36 [2018-02-04 00:31:36,899 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 8 treesize of output 7 [2018-02-04 00:31:36,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,941 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 35 treesize of output 32 [2018-02-04 00:31:36,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:31:36,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,969 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 41 treesize of output 38 [2018-02-04 00:31:36,971 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 8 treesize of output 7 [2018-02-04 00:31:36,971 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,978 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:36,994 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 37 treesize of output 34 [2018-02-04 00:31:36,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:31:36,996 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,002 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 00:31:37,014 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:81, output treesize:67 [2018-02-04 00:31:37,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 [2018-02-04 00:31:37,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 24 [2018-02-04 00:31:37,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 00:31:37,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:73, output treesize:39 [2018-02-04 00:31:37,219 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 00:31:37,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 00:31:37,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 12 treesize of output 11 [2018-02-04 00:31:37,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-02-04 00:31:37,302 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:31:37,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,308 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:37,316 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:171, output treesize:41 [2018-02-04 00:31:37,350 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 36 treesize of output 28 [2018-02-04 00:31:37,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 treesize of output 17 [2018-02-04 00:31:37,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:31:37,365 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 11 treesize of output 3 [2018-02-04 00:31:37,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:37,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:37,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:21 [2018-02-04 00:31:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:37,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:37,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2018-02-04 00:31:37,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:31:37,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:31:37,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 00:31:37,435 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 22 states. [2018-02-04 00:31:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:38,063 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-02-04 00:31:38,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:31:38,063 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-02-04 00:31:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:38,064 INFO L225 Difference]: With dead ends: 98 [2018-02-04 00:31:38,064 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 00:31:38,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 00:31:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 00:31:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 67. [2018-02-04 00:31:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 00:31:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-04 00:31:38,066 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 36 [2018-02-04 00:31:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:38,066 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-04 00:31:38,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:31:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-04 00:31:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 00:31:38,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:38,067 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 00:31:38,067 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2070779991, now seen corresponding path program 1 times [2018-02-04 00:31:38,068 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:38,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:38,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:38,068 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:38,069 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:38,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:31:38,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:38,167 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:31:38,171 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:38,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:38,192 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:31:38,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:31:38,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:38,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:38,213 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:31:38,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 00:31:38,225 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 11 treesize of output 8 [2018-02-04 00:31:38,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:31:38,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,241 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 11 treesize of output 8 [2018-02-04 00:31:38,243 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 8 treesize of output 7 [2018-02-04 00:31:38,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-04 00:31:38,258 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 16 treesize of output 12 [2018-02-04 00:31:38,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-02-04 00:31:38,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-02-04 00:31:38,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 00:31:38,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:31:38,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,303 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:31:38,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2018-02-04 00:31:38,305 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 15 treesize of output 11 [2018-02-04 00:31:38,307 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 11 treesize of output 3 [2018-02-04 00:31:38,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:38,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 00:31:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:31:38,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:38,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 14 [2018-02-04 00:31:38,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:31:38,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:31:38,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:31:38,342 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 15 states. [2018-02-04 00:31:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:38,660 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-02-04 00:31:38,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:31:38,660 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-02-04 00:31:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:38,661 INFO L225 Difference]: With dead ends: 90 [2018-02-04 00:31:38,661 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 00:31:38,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2018-02-04 00:31:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 00:31:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-02-04 00:31:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 00:31:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-02-04 00:31:38,663 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 39 [2018-02-04 00:31:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:38,663 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-02-04 00:31:38,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:31:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-02-04 00:31:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 00:31:38,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:38,664 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 00:31:38,664 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:38,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2070779990, now seen corresponding path program 1 times [2018-02-04 00:31:38,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:38,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:38,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:38,665 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:38,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:38,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 00:31:38,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:31:38,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:31:38,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:31:38,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:31:38,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:31:38,701 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2018-02-04 00:31:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:38,765 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-02-04 00:31:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:31:38,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 00:31:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:38,766 INFO L225 Difference]: With dead ends: 70 [2018-02-04 00:31:38,766 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 00:31:38,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:31:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 00:31:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 00:31:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 00:31:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-02-04 00:31:38,768 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 39 [2018-02-04 00:31:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:38,768 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-02-04 00:31:38,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:31:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-02-04 00:31:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 00:31:38,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:38,768 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 00:31:38,768 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash 230411716, now seen corresponding path program 1 times [2018-02-04 00:31:38,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:38,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:38,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:38,769 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:38,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:38,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:31:38,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:31:38,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:31:38,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:31:38,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:31:38,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:31:38,813 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2018-02-04 00:31:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:38,880 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-02-04 00:31:38,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:31:38,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-02-04 00:31:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:38,881 INFO L225 Difference]: With dead ends: 81 [2018-02-04 00:31:38,881 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 00:31:38,881 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:31:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 00:31:38,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2018-02-04 00:31:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 00:31:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-02-04 00:31:38,883 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 40 [2018-02-04 00:31:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:38,883 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-02-04 00:31:38,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:31:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-02-04 00:31:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 00:31:38,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:38,883 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 00:31:38,884 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash 230411717, now seen corresponding path program 1 times [2018-02-04 00:31:38,884 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:38,884 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:38,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:38,884 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:38,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:38,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 00:31:38,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:38,931 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:31:38,936 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:38,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:31:38,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:31:38,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-02-04 00:31:38,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:31:38,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:31:38,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:31:38,997 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 13 states. [2018-02-04 00:31:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:39,130 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-02-04 00:31:39,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:31:39,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-02-04 00:31:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:39,131 INFO L225 Difference]: With dead ends: 80 [2018-02-04 00:31:39,131 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 00:31:39,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:31:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 00:31:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2018-02-04 00:31:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 00:31:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-02-04 00:31:39,133 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 40 [2018-02-04 00:31:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:39,134 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-02-04 00:31:39,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:31:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-02-04 00:31:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:31:39,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:39,134 INFO L351 BasicCegarLoop]: trace histogram [3, 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:31:39,134 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:39,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1447171422, now seen corresponding path program 1 times [2018-02-04 00:31:39,135 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:39,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:39,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:39,136 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:39,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:39,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 00:31:39,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:31:39,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:31:39,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:31:39,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:31:39,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:31:39,180 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 7 states. [2018-02-04 00:31:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:39,272 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-02-04 00:31:39,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:31:39,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-04 00:31:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:39,273 INFO L225 Difference]: With dead ends: 67 [2018-02-04 00:31:39,273 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 00:31:39,273 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:31:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 00:31:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 00:31:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 00:31:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-02-04 00:31:39,275 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 41 [2018-02-04 00:31:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:39,275 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-02-04 00:31:39,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:31:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-02-04 00:31:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:31:39,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:39,276 INFO L351 BasicCegarLoop]: trace histogram [3, 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:31:39,276 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:39,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1447171421, now seen corresponding path program 1 times [2018-02-04 00:31:39,276 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:39,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:39,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:39,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:39,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:39,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 00:31:39,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:31:39,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:31:39,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:31:39,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:31:39,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:31:39,365 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 7 states. [2018-02-04 00:31:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:39,488 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-02-04 00:31:39,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:31:39,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-04 00:31:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:39,489 INFO L225 Difference]: With dead ends: 71 [2018-02-04 00:31:39,489 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 00:31:39,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:31:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 00:31:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2018-02-04 00:31:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 00:31:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-02-04 00:31:39,491 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 41 [2018-02-04 00:31:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:39,491 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-02-04 00:31:39,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:31:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-02-04 00:31:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:31:39,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:39,492 INFO L351 BasicCegarLoop]: trace histogram [3, 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:31:39,492 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1449711540, now seen corresponding path program 1 times [2018-02-04 00:31:39,492 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:39,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:39,493 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:39,493 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:39,493 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:39,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:31:39,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:39,647 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:31:39,655 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:39,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:39,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-02-04 00:31:39,740 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 19 treesize of output 10 [2018-02-04 00:31:39,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:39,750 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 10 treesize of output 4 [2018-02-04 00:31:39,750 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:39,760 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 00:31:39,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 00:31:39,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:31:39,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-02-04 00:31:39,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-02-04 00:31:39,774 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:39,775 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:39,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-02-04 00:31:39,780 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:31:39,780 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:39,781 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:39,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:31:39,787 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2018-02-04 00:31:39,812 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:39,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-02-04 00:31:39,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:39,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:39,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:10 [2018-02-04 00:31:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:31:39,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:39,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-02-04 00:31:39,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 00:31:39,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 00:31:39,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:31:39,865 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 16 states. [2018-02-04 00:31:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:40,079 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-02-04 00:31:40,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:31:40,079 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-04 00:31:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:40,080 INFO L225 Difference]: With dead ends: 80 [2018-02-04 00:31:40,080 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 00:31:40,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:31:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 00:31:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2018-02-04 00:31:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 00:31:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-02-04 00:31:40,082 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 41 [2018-02-04 00:31:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:40,082 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-02-04 00:31:40,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 00:31:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-02-04 00:31:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 00:31:40,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:40,082 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2018-02-04 00:31:40,082 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1834670273, now seen corresponding path program 1 times [2018-02-04 00:31:40,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:40,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:40,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:40,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:40,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:40,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 00:31:40,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:40,418 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:31:40,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:40,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:40,440 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:31:40,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:31:40,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:40,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:40,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:46 [2018-02-04 00:31:40,532 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 11 treesize of output 8 [2018-02-04 00:31:40,534 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 8 treesize of output 7 [2018-02-04 00:31:40,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:40,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:61 [2018-02-04 00:31:40,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:40,622 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2018-02-04 00:31:40,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:40,625 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:31:40,625 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 0 case distinctions, treesize of input 29 treesize of output 39 [2018-02-04 00:31:40,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,638 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:31:40,639 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 15 treesize of output 12 [2018-02-04 00:31:40,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:40,645 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:64, output treesize:27 [2018-02-04 00:31:40,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:40,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-02-04 00:31:40,700 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:31:40,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:40,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:61 [2018-02-04 00:31:40,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-02-04 00:31:40,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 18 [2018-02-04 00:31:40,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:40,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:49 [2018-02-04 00:31:40,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:40,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-02-04 00:31:40,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:40,842 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:31:40,842 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 0 case distinctions, treesize of input 19 treesize of output 23 [2018-02-04 00:31:40,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:40,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:31 [2018-02-04 00:31:40,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 00:31:40,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:40,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:31:40,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-04 00:31:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:31:40,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:31:40,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 22 [2018-02-04 00:31:40,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:31:40,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:31:40,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:31:40,957 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 23 states. [2018-02-04 00:31:53,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:31:53,689 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-04 00:31:53,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 00:31:53,689 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-02-04 00:31:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:31:53,690 INFO L225 Difference]: With dead ends: 101 [2018-02-04 00:31:53,690 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 00:31:53,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=148, Invalid=1182, Unknown=2, NotChecked=0, Total=1332 [2018-02-04 00:31:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 00:31:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-02-04 00:31:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 00:31:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-02-04 00:31:53,693 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 44 [2018-02-04 00:31:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:31:53,693 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-02-04 00:31:53,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:31:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-02-04 00:31:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 00:31:53,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:31:53,694 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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:31:53,694 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:31:53,694 INFO L82 PathProgramCache]: Analyzing trace with hash -81360860, now seen corresponding path program 1 times [2018-02-04 00:31:53,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:31:53,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:31:53,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:53,695 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:53,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:31:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:53,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:31:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:31:53,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:31:53,886 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:31:53,892 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:31:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:31:53,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:31:53,926 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:31:53,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:53,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:53,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:31:53,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:53,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:31:53,940 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:31:53,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:53,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:53,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 00:31:53,949 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 11 treesize of output 8 [2018-02-04 00:31:53,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:31:53,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:53,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:53,956 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 11 treesize of output 8 [2018-02-04 00:31:53,966 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 8 treesize of output 7 [2018-02-04 00:31:53,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:31:53,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:53,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:31:53,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:8 [2018-02-04 00:31:55,990 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~a10~0.base_BEFORE_CALL_20 Int) (v_entry_point_~a10~0.offset_BEFORE_CALL_12 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~a10~0.base_BEFORE_CALL_20) v_entry_point_~a10~0.offset_BEFORE_CALL_12) v_entry_point_~a10~0.base_BEFORE_CALL_20))) is different from true [2018-02-04 00:32:00,007 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 14 [2018-02-04 00:32:00,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-02-04 00:32:00,027 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 16 treesize of output 15 [2018-02-04 00:32:00,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:00,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:00,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-02-04 00:32:00,038 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 16 treesize of output 15 [2018-02-04 00:32:00,039 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:00,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:00,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:00,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:39 [2018-02-04 00:32:00,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-02-04 00:32:00,087 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 19 treesize of output 3 [2018-02-04 00:32:00,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:00,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 00:32:00,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:32:00,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:32:00,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 00:32:00,106 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:32:00,107 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:32:00,110 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 11 treesize of output 3 [2018-02-04 00:32:00,110 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:00,111 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:00,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:00,113 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2018-02-04 00:32:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 00:32:00,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:32:00,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 21 [2018-02-04 00:32:00,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:32:00,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:32:00,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=335, Unknown=3, NotChecked=36, Total=420 [2018-02-04 00:32:00,142 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 21 states. [2018-02-04 00:32:04,285 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 12 [2018-02-04 00:32:06,296 WARN L143 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 17 [2018-02-04 00:32:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:32:16,541 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-02-04 00:32:16,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:32:16,541 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-02-04 00:32:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:32:16,541 INFO L225 Difference]: With dead ends: 88 [2018-02-04 00:32:16,541 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 00:32:16,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=136, Invalid=917, Unknown=7, NotChecked=62, Total=1122 [2018-02-04 00:32:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 00:32:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-02-04 00:32:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 00:32:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-02-04 00:32:16,544 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 47 [2018-02-04 00:32:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:32:16,544 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-02-04 00:32:16,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:32:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-02-04 00:32:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 00:32:16,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:32:16,545 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2018-02-04 00:32:16,545 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:32:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1675849089, now seen corresponding path program 1 times [2018-02-04 00:32:16,545 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:32:16,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:32:16,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:32:16,546 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:32:16,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:32:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:32:16,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:32:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:32:16,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:32:16,741 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:32:16,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:32:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:32:16,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:32:16,764 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:32:16,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:32:16,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:32:16,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:32:16,782 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:32:16,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 00:32:16,793 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 11 treesize of output 8 [2018-02-04 00:32:16,794 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 8 treesize of output 7 [2018-02-04 00:32:16,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,800 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 11 treesize of output 8 [2018-02-04 00:32:16,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:32:16,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-04 00:32:16,815 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 15 treesize of output 11 [2018-02-04 00:32:16,816 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 11 treesize of output 3 [2018-02-04 00:32:16,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:16,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-02-04 00:32:18,832 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~a10~0.base_BEFORE_CALL_23 Int) (v_entry_point_~a10~0.offset_BEFORE_CALL_13 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~a10~0.base_BEFORE_CALL_23) v_entry_point_~a10~0.offset_BEFORE_CALL_13) v_entry_point_~a10~0.base_BEFORE_CALL_23))) is different from true [2018-02-04 00:32:22,851 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 13 [2018-02-04 00:32:26,872 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 13 [2018-02-04 00:32:26,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-02-04 00:32:26,890 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:32:26,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:26,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:26,895 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:32:26,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-02-04 00:32:26,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-02-04 00:32:26,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-02-04 00:32:26,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:26,936 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-02-04 00:32:26,936 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 00:32:26,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:32:26,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:32:26,941 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:36, output treesize:13 [2018-02-04 00:32:26,951 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 16 treesize of output 12 [2018-02-04 00:32:26,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-02-04 00:32:26,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:26,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:26,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:26,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-02-04 00:32:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 00:32:26,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:32:26,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 25 [2018-02-04 00:32:26,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 00:32:26,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 00:32:26,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=497, Unknown=3, NotChecked=44, Total=600 [2018-02-04 00:32:26,976 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 25 states. [2018-02-04 00:32:47,128 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 12 [2018-02-04 00:32:53,147 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 22 [2018-02-04 00:32:57,166 WARN L143 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-04 00:32:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:32:57,613 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-02-04 00:32:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:32:57,613 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-02-04 00:32:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:32:57,613 INFO L225 Difference]: With dead ends: 79 [2018-02-04 00:32:57,613 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 00:32:57,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=164, Invalid=1312, Unknown=10, NotChecked=74, Total=1560 [2018-02-04 00:32:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 00:32:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-02-04 00:32:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 00:32:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-02-04 00:32:57,615 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 46 [2018-02-04 00:32:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:32:57,616 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-02-04 00:32:57,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 00:32:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-02-04 00:32:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 00:32:57,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:32:57,616 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1] [2018-02-04 00:32:57,616 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:32:57,617 INFO L82 PathProgramCache]: Analyzing trace with hash 489983398, now seen corresponding path program 2 times [2018-02-04 00:32:57,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:32:57,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:32:57,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:32:57,617 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:32:57,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:32:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:32:57,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:32:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 00:32:57,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:32:57,795 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:32:57,800 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:32:57,832 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:32:57,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:32:57,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:32:57,836 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:32:57,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:57,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:57,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:32:57,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:32:57,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:32:57,847 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:32:57,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:57,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:57,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 00:32:57,855 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 11 treesize of output 8 [2018-02-04 00:32:57,856 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 8 treesize of output 7 [2018-02-04 00:32:57,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:57,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:57,863 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 11 treesize of output 8 [2018-02-04 00:32:57,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:32:57,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:57,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:57,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:32:57,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:8 [2018-02-04 00:32:59,883 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~a10~0.offset_BEFORE_CALL_14 Int) (v_entry_point_~a10~0.base_BEFORE_CALL_25 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~a10~0.base_BEFORE_CALL_25) v_entry_point_~a10~0.offset_BEFORE_CALL_14) v_entry_point_~a10~0.base_BEFORE_CALL_25))) is different from true [2018-02-04 00:32:59,886 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:32:59,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:32:59,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:32:59,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:14 [2018-02-04 00:33:03,904 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 14 [2018-02-04 00:33:07,921 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 14 [2018-02-04 00:33:07,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-02-04 00:33:07,940 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 16 treesize of output 15 [2018-02-04 00:33:07,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:07,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:07,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-02-04 00:33:07,963 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 16 treesize of output 15 [2018-02-04 00:33:07,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:07,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:07,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:07,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:26 [2018-02-04 00:33:08,047 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:33:08,057 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 21 treesize of output 13 [2018-02-04 00:33:08,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:08,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:08,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:33:08,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-02-04 00:33:08,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-02-04 00:33:08,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-02-04 00:33:08,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:08,127 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 5 [2018-02-04 00:33:08,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:08,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:08,130 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:33:08,130 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2018-02-04 00:33:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2018-02-04 00:33:08,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:33:08,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 24 [2018-02-04 00:33:08,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 00:33:08,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 00:33:08,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=496, Unknown=3, NotChecked=44, Total=600 [2018-02-04 00:33:08,168 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 25 states. [2018-02-04 00:33:28,310 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 12 [2018-02-04 00:33:34,327 WARN L143 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 18 [2018-02-04 00:33:38,349 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 23 [2018-02-04 00:33:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:33:40,585 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-02-04 00:33:40,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 00:33:40,585 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-02-04 00:33:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:33:40,586 INFO L225 Difference]: With dead ends: 78 [2018-02-04 00:33:40,586 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 00:33:40,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=164, Invalid=1311, Unknown=11, NotChecked=74, Total=1560 [2018-02-04 00:33:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 00:33:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2018-02-04 00:33:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 00:33:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-02-04 00:33:40,588 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 49 [2018-02-04 00:33:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:33:40,588 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-02-04 00:33:40,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 00:33:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-02-04 00:33:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 00:33:40,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:33:40,589 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1] [2018-02-04 00:33:40,589 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:33:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash 489983399, now seen corresponding path program 1 times [2018-02-04 00:33:40,589 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:33:40,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:33:40,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:33:40,590 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:33:40,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:33:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:33:40,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:33:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 00:33:41,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:33:41,027 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:33:41,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:33:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:33:41,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:33:41,080 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:33:41,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,093 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:33:41,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,095 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:33:41,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,108 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:33:41,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:33:41,120 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-02-04 00:33:41,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:33:41,315 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 12 treesize of output 15 [2018-02-04 00:33:41,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:33:41,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:33:41,321 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:33:41,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-04 00:33:41,345 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 18 treesize of output 8 [2018-02-04 00:33:41,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,352 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 11 treesize of output 8 [2018-02-04 00:33:41,354 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 8 treesize of output 7 [2018-02-04 00:33:41,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,364 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 11 treesize of output 8 [2018-02-04 00:33:41,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:33:41,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,366 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:41,372 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:47, output treesize:15 [2018-02-04 00:33:43,424 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~a10~0.base_BEFORE_CALL_28 Int) (v_entry_point_~a10~0.offset_BEFORE_CALL_16 Int)) (and (<= 0 v_entry_point_~a10~0.offset_BEFORE_CALL_16) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~a10~0.base_BEFORE_CALL_28) v_entry_point_~a10~0.offset_BEFORE_CALL_16) v_entry_point_~a10~0.base_BEFORE_CALL_28)) (<= v_entry_point_~a10~0.offset_BEFORE_CALL_16 0))) is different from true [2018-02-04 00:33:49,452 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 16 [2018-02-04 00:33:49,455 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 34 treesize of output 33 [2018-02-04 00:33:49,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:49,471 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 31 treesize of output 30 [2018-02-04 00:33:49,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:49,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 00:33:49,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:64 [2018-02-04 00:33:53,541 WARN L143 SmtUtils]: Spent 4014ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-04 00:33:57,599 WARN L143 SmtUtils]: Spent 4013ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-04 00:33:57,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-02-04 00:33:57,657 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 16 treesize of output 15 [2018-02-04 00:33:57,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:57,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:57,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-02-04 00:33:57,674 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 16 treesize of output 15 [2018-02-04 00:33:57,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:57,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:57,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:57,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:47 [2018-02-04 00:33:57,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-02-04 00:33:57,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 00:33:57,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:33:57,865 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 21 treesize of output 5 [2018-02-04 00:33:57,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:57,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:33:57,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 00:33:57,877 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:33:57,878 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:33:57,881 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 11 treesize of output 3 [2018-02-04 00:33:57,881 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:33:57,882 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:57,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:33:57,886 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:77, output treesize:9 [2018-02-04 00:33:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 00:33:57,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:33:57,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 44 [2018-02-04 00:33:57,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 00:33:57,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 00:33:57,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1764, Unknown=3, NotChecked=84, Total=1980 [2018-02-04 00:33:57,936 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 45 states. [2018-02-04 00:34:30,315 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-04 00:34:32,335 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 22 Received shutdown request... [2018-02-04 00:34:38,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:34:38,382 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 00:34:38,386 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 00:34:38,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:34:38 BoogieIcfgContainer [2018-02-04 00:34:38,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:34:38,387 INFO L168 Benchmark]: Toolchain (without parser) took 217413.70 ms. Allocated memory was 399.0 MB in the beginning and 739.8 MB in the end (delta: 340.8 MB). Free memory was 355.4 MB in the beginning and 645.4 MB in the end (delta: -290.0 MB). Peak memory consumption was 50.8 MB. Max. memory is 5.3 GB. [2018-02-04 00:34:38,387 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 399.0 MB. Free memory is still 362.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:34:38,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.15 ms. Allocated memory is still 399.0 MB. Free memory was 355.4 MB in the beginning and 342.2 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:34:38,388 INFO L168 Benchmark]: Boogie Preprocessor took 23.33 ms. Allocated memory is still 399.0 MB. Free memory was 342.2 MB in the beginning and 340.9 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:34:38,388 INFO L168 Benchmark]: RCFGBuilder took 221.43 ms. Allocated memory is still 399.0 MB. Free memory was 340.9 MB in the beginning and 315.7 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:34:38,388 INFO L168 Benchmark]: TraceAbstraction took 217017.49 ms. Allocated memory was 399.0 MB in the beginning and 739.8 MB in the end (delta: 340.8 MB). Free memory was 315.7 MB in the beginning and 645.4 MB in the end (delta: -329.8 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-02-04 00:34:38,389 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.09 ms. Allocated memory is still 399.0 MB. Free memory is still 362.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.15 ms. Allocated memory is still 399.0 MB. Free memory was 355.4 MB in the beginning and 342.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.33 ms. Allocated memory is still 399.0 MB. Free memory was 342.2 MB in the beginning and 340.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 221.43 ms. Allocated memory is still 399.0 MB. Free memory was 340.9 MB in the beginning and 315.7 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 217017.49 ms. Allocated memory was 399.0 MB in the beginning and 739.8 MB in the end (delta: 340.8 MB). Free memory was 315.7 MB in the beginning and 645.4 MB in the end (delta: -329.8 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1472]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1459). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1457). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1457). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1469). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1459). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1459). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1469). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1459). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and interpolant automaton (currently 15 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 81 locations, 31 error locations. TIMEOUT Result, 216.9s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 162.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1373 SDtfs, 1624 SDslu, 7303 SDs, 0 SdLazy, 10045 SolverSat, 548 SolverUnsat, 72 SolverUnknown, 0 SolverNotchecked, 78.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1130 GetRequests, 565 SyntacticMatches, 84 SemanticMatches, 480 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 126.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 429 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 53.3s InterpolantComputationTime, 1613 NumberOfCodeBlocks, 1613 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1566 ConstructedInterpolants, 90 QuantifiedInterpolants, 502941 SizeOfPredicates, 182 NumberOfNonLiveVariables, 3078 ConjunctsInSsa, 615 ConjunctsInUnsatCore, 47 InterpolantComputations, 10 PerfectInterpolantSequences, 362/610 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_test10_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-34-38-394.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-34-38-394.csv Completed graceful shutdown