java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:51:21,095 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:51:21,097 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:51:21,112 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:51:21,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:51:21,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:51:21,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:51:21,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:51:21,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:51:21,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:51:21,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:51:21,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:51:21,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:51:21,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:51:21,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:51:21,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:51:21,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:51:21,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:51:21,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:51:21,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:51:21,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:51:21,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:51:21,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:51:21,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:51:21,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:51:21,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:51:21,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:51:21,142 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:51:21,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:51:21,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:51:21,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:51:21,143 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:51:21,153 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:51:21,154 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:51:21,154 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:51:21,155 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:51:21,155 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:51:21,155 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:51:21,155 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:51:21,156 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:51:21,156 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:51:21,156 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:51:21,157 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:51:21,157 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:51:21,157 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:51:21,157 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:51:21,157 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:51:21,158 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:51:21,158 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:51:21,158 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:51:21,158 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:51:21,159 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:51:21,159 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:51:21,159 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:51:21,159 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:51:21,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:51:21,160 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:51:21,160 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:51:21,160 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:51:21,160 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:51:21,161 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:51:21,161 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:51:21,161 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:51:21,161 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:51:21,162 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:51:21,162 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:51:21,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:51:21,207 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:51:21,211 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:51:21,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:51:21,212 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:51:21,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-31 08:51:21,468 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:51:21,478 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:51:21,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:51:21,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:51:21,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:51:21,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:51:21" (1/1) ... [2018-01-31 08:51:21,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43917c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21, skipping insertion in model container [2018-01-31 08:51:21,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:51:21" (1/1) ... [2018-01-31 08:51:21,514 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:51:21,593 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:51:21,772 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:51:21,794 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:51:21,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21 WrapperNode [2018-01-31 08:51:21,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:51:21,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:51:21,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:51:21,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:51:21,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21" (1/1) ... [2018-01-31 08:51:21,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21" (1/1) ... [2018-01-31 08:51:21,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21" (1/1) ... [2018-01-31 08:51:21,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21" (1/1) ... [2018-01-31 08:51:21,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21" (1/1) ... [2018-01-31 08:51:21,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21" (1/1) ... [2018-01-31 08:51:21,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21" (1/1) ... [2018-01-31 08:51:21,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:51:21,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:51:21,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:51:21,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:51:21,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:51:21,907 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:51:21,907 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:51:21,907 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:51:21,907 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:51:21,908 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:51:21,908 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:51:21,908 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:51:21,908 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:51:21,908 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:51:21,908 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:51:21,909 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:51:21,909 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:51:21,909 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:51:21,909 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:51:21,909 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:51:21,909 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:51:21,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:51:21,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:51:22,356 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:51:22,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:51:22 BoogieIcfgContainer [2018-01-31 08:51:22,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:51:22,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:51:22,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:51:22,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:51:22,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:51:21" (1/3) ... [2018-01-31 08:51:22,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280c9df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:51:22, skipping insertion in model container [2018-01-31 08:51:22,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:21" (2/3) ... [2018-01-31 08:51:22,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280c9df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:51:22, skipping insertion in model container [2018-01-31 08:51:22,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:51:22" (3/3) ... [2018-01-31 08:51:22,368 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-31 08:51:22,374 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:51:22,383 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-31 08:51:22,430 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:51:22,430 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:51:22,430 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:51:22,430 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:51:22,430 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:51:22,430 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:51:22,430 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:51:22,430 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:51:22,431 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:51:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-31 08:51:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:51:22,461 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:22,462 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:22,462 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:51:22,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2118854820, now seen corresponding path program 1 times [2018-01-31 08:51:22,467 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:22,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:22,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:22,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:22,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:22,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:22,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:22,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:51:22,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:51:22,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:51:22,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:51:22,804 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-01-31 08:51:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:23,115 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2018-01-31 08:51:23,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:51:23,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-31 08:51:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:23,139 INFO L225 Difference]: With dead ends: 118 [2018-01-31 08:51:23,140 INFO L226 Difference]: Without dead ends: 89 [2018-01-31 08:51:23,145 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-01-31 08:51:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-31 08:51:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2018-01-31 08:51:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-31 08:51:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-31 08:51:23,198 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 22 [2018-01-31 08:51:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:23,199 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-31 08:51:23,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:51:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-31 08:51:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:51:23,200 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:23,200 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:23,201 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:51:23,201 INFO L82 PathProgramCache]: Analyzing trace with hash -356759092, now seen corresponding path program 1 times [2018-01-31 08:51:23,201 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:23,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:23,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:23,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:23,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:23,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:23,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:23,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:51:23,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:51:23,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:51:23,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:23,374 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2018-01-31 08:51:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:23,477 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2018-01-31 08:51:23,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:51:23,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 08:51:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:23,480 INFO L225 Difference]: With dead ends: 98 [2018-01-31 08:51:23,480 INFO L226 Difference]: Without dead ends: 94 [2018-01-31 08:51:23,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-31 08:51:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 57. [2018-01-31 08:51:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 08:51:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-31 08:51:23,492 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 23 [2018-01-31 08:51:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:23,492 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-31 08:51:23,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:51:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-31 08:51:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 08:51:23,494 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:23,494 INFO L351 BasicCegarLoop]: trace histogram [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-01-31 08:51:23,495 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:51:23,495 INFO L82 PathProgramCache]: Analyzing trace with hash 15601453, now seen corresponding path program 1 times [2018-01-31 08:51:23,495 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:23,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:23,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:23,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:23,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:23,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:23,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:23,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:51:23,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:51:23,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:51:23,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:51:23,638 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2018-01-31 08:51:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:23,793 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-01-31 08:51:23,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:51:23,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-31 08:51:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:23,795 INFO L225 Difference]: With dead ends: 107 [2018-01-31 08:51:23,795 INFO L226 Difference]: Without dead ends: 59 [2018-01-31 08:51:23,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-31 08:51:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-31 08:51:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-31 08:51:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-31 08:51:23,803 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 28 [2018-01-31 08:51:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:23,803 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-31 08:51:23,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:51:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-31 08:51:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:51:23,804 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:23,804 INFO L351 BasicCegarLoop]: trace histogram [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-01-31 08:51:23,805 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:51:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash -204345955, now seen corresponding path program 1 times [2018-01-31 08:51:23,805 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:23,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:23,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:23,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:23,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:23,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:23,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:23,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:51:23,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:51:23,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:51:23,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:23,905 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-01-31 08:51:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:23,963 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-31 08:51:23,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:51:23,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-31 08:51:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:23,965 INFO L225 Difference]: With dead ends: 59 [2018-01-31 08:51:23,965 INFO L226 Difference]: Without dead ends: 58 [2018-01-31 08:51:23,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-31 08:51:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-31 08:51:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-31 08:51:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-31 08:51:23,973 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 29 [2018-01-31 08:51:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:23,973 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-31 08:51:23,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:51:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-31 08:51:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:51:23,974 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:23,974 INFO L351 BasicCegarLoop]: trace histogram [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-01-31 08:51:23,974 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:51:23,974 INFO L82 PathProgramCache]: Analyzing trace with hash -204345954, now seen corresponding path program 1 times [2018-01-31 08:51:23,975 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:23,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:23,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:23,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:23,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:23,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:24,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:24,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:51:24,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:51:24,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:51:24,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:24,119 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2018-01-31 08:51:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:24,610 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-31 08:51:24,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:51:24,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-31 08:51:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:24,622 INFO L225 Difference]: With dead ends: 66 [2018-01-31 08:51:24,622 INFO L226 Difference]: Without dead ends: 64 [2018-01-31 08:51:24,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-31 08:51:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-01-31 08:51:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-31 08:51:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-31 08:51:24,631 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 29 [2018-01-31 08:51:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:24,631 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-31 08:51:24,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:51:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-31 08:51:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:51:24,633 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:24,633 INFO L351 BasicCegarLoop]: trace histogram [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-01-31 08:51:24,633 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:51:24,633 INFO L82 PathProgramCache]: Analyzing trace with hash -204345906, now seen corresponding path program 1 times [2018-01-31 08:51:24,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:24,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:24,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:24,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:24,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:24,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:24,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:24,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:51:24,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:51:24,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:51:24,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:51:24,716 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 4 states. [2018-01-31 08:51:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:24,773 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-01-31 08:51:24,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:51:24,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-31 08:51:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:24,775 INFO L225 Difference]: With dead ends: 114 [2018-01-31 08:51:24,775 INFO L226 Difference]: Without dead ends: 91 [2018-01-31 08:51:24,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:51:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-31 08:51:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2018-01-31 08:51:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 08:51:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-01-31 08:51:24,786 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 29 [2018-01-31 08:51:24,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:24,786 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-01-31 08:51:24,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:51:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-01-31 08:51:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:51:24,787 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:24,788 INFO L351 BasicCegarLoop]: trace histogram [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-01-31 08:51:24,788 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:51:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1456085898, now seen corresponding path program 1 times [2018-01-31 08:51:24,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:24,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:24,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:24,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:24,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:24,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:51:24,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:24,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:51:24,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:51:24,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:51:24,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:51:24,918 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 5 states. [2018-01-31 08:51:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:25,015 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-01-31 08:51:25,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:51:25,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-31 08:51:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:25,017 INFO L225 Difference]: With dead ends: 132 [2018-01-31 08:51:25,017 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 08:51:25,018 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:25,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 08:51:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2018-01-31 08:51:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 08:51:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-01-31 08:51:25,040 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 37 [2018-01-31 08:51:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:25,040 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-01-31 08:51:25,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:51:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-01-31 08:51:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:51:25,042 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:25,042 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:25,042 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:51:25,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1626330386, now seen corresponding path program 1 times [2018-01-31 08:51:25,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:25,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:25,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:25,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:25,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:25,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:25,661 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:51:25,661 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:51:25,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:25,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:51:25,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:51:25,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:25,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:25,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:51:25,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:25,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:25,871 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-01-31 08:51:25,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:25,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:51:25,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-31 08:51:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:26,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:51:26,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-31 08:51:26,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:51:26,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:51:26,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:51:26,073 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 11 states. [2018-01-31 08:51:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:26,943 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2018-01-31 08:51:26,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:51:26,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-31 08:51:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:26,945 INFO L225 Difference]: With dead ends: 91 [2018-01-31 08:51:26,945 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 08:51:26,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:51:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 08:51:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2018-01-31 08:51:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 08:51:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-31 08:51:26,957 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 38 [2018-01-31 08:51:26,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:26,957 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-31 08:51:26,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:51:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-31 08:51:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:51:26,958 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:26,959 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:26,959 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:51:26,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1626330387, now seen corresponding path program 1 times [2018-01-31 08:51:26,959 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:26,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:26,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:26,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:26,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:26,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:27,395 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-31 08:51:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:27,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:51:27,872 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:51:27,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:27,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:51:28,072 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-01-31 08:51:28,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:28,088 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-01-31 08:51:28,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:28,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 25 treesize of output 24 [2018-01-31 08:51:28,108 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:28,127 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-01-31 08:51:28,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:28,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:51:28,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:51:28,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:28,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:28,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-31 08:51:28,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:28,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:28,519 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 45 treesize of output 48 [2018-01-31 08:51:28,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:28,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:28,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:28,568 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 44 treesize of output 38 [2018-01-31 08:51:28,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:28,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:28,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-31 08:51:28,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:28,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-31 08:51:28,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-31 08:51:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:28,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:51:28,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-31 08:51:28,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:51:28,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:51:28,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-01-31 08:51:28,810 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 21 states. [2018-01-31 08:51:29,187 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-31 08:51:29,526 WARN L143 SmtUtils]: Spent 207ms on a formula simplification that was a NOOP. DAG size: 49 [2018-01-31 08:52:12,781 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 58 DAG size of output 48 [2018-01-31 08:52:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:13,124 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-01-31 08:52:13,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:52:13,124 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-01-31 08:52:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:13,126 INFO L225 Difference]: With dead ends: 141 [2018-01-31 08:52:13,127 INFO L226 Difference]: Without dead ends: 140 [2018-01-31 08:52:13,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=163, Invalid=955, Unknown=4, NotChecked=0, Total=1122 [2018-01-31 08:52:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-31 08:52:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 71. [2018-01-31 08:52:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 08:52:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-01-31 08:52:13,150 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 38 [2018-01-31 08:52:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:13,150 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-01-31 08:52:13,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:52:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-01-31 08:52:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:52:13,160 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:13,160 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-01-31 08:52:13,160 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:13,160 INFO L82 PathProgramCache]: Analyzing trace with hash -916219476, now seen corresponding path program 1 times [2018-01-31 08:52:13,161 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:13,161 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:13,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:13,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:13,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:13,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:52:13,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:52:13,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:52:13,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:52:13,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:52:13,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:52:13,209 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 4 states. [2018-01-31 08:52:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:13,259 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-31 08:52:13,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:52:13,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-31 08:52:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:13,260 INFO L225 Difference]: With dead ends: 101 [2018-01-31 08:52:13,260 INFO L226 Difference]: Without dead ends: 82 [2018-01-31 08:52:13,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:52:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-31 08:52:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-01-31 08:52:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 08:52:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-01-31 08:52:13,280 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 40 [2018-01-31 08:52:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:13,281 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-01-31 08:52:13,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:52:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-01-31 08:52:13,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:52:13,285 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:13,286 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-01-31 08:52:13,286 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:13,286 INFO L82 PathProgramCache]: Analyzing trace with hash -578645626, now seen corresponding path program 1 times [2018-01-31 08:52:13,286 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:13,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:13,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:13,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:13,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:13,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:52:13,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:13,996 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:14,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:14,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:52:14,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:52:14,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-31 08:52:14,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:52:14,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:52:14,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-31 08:52:14,253 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 13 states. [2018-01-31 08:52:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:14,738 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-01-31 08:52:14,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:52:14,739 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-01-31 08:52:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:14,740 INFO L225 Difference]: With dead ends: 85 [2018-01-31 08:52:14,740 INFO L226 Difference]: Without dead ends: 74 [2018-01-31 08:52:14,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=274, Unknown=9, NotChecked=0, Total=342 [2018-01-31 08:52:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-31 08:52:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-31 08:52:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 08:52:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-01-31 08:52:14,757 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 43 [2018-01-31 08:52:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:14,757 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-01-31 08:52:14,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:52:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-01-31 08:52:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 08:52:14,759 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:14,759 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:14,759 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:14,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1929970958, now seen corresponding path program 1 times [2018-01-31 08:52:14,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:14,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:14,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:14,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:14,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:14,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:52:15,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:52:15,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:52:15,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:52:15,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:52:15,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:52:15,015 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 6 states. [2018-01-31 08:52:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:15,084 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-01-31 08:52:15,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:52:15,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-31 08:52:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:15,086 INFO L225 Difference]: With dead ends: 118 [2018-01-31 08:52:15,087 INFO L226 Difference]: Without dead ends: 92 [2018-01-31 08:52:15,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:52:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-31 08:52:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2018-01-31 08:52:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 08:52:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-31 08:52:15,104 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 44 [2018-01-31 08:52:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:15,104 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-31 08:52:15,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:52:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-31 08:52:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:52:15,107 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:15,107 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:15,107 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:15,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1808851570, now seen corresponding path program 1 times [2018-01-31 08:52:15,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:15,108 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:15,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:15,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:15,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:15,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:52:15,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:15,484 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:15,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:15,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:52:15,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:52:15,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-31 08:52:15,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:52:15,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:52:15,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:52:15,671 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-01-31 08:52:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:16,054 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-01-31 08:52:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:52:16,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-01-31 08:52:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:16,055 INFO L225 Difference]: With dead ends: 131 [2018-01-31 08:52:16,056 INFO L226 Difference]: Without dead ends: 108 [2018-01-31 08:52:16,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:52:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-31 08:52:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 76. [2018-01-31 08:52:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 08:52:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-31 08:52:16,070 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 47 [2018-01-31 08:52:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:16,070 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-31 08:52:16,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:52:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-31 08:52:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:52:16,071 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:16,072 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:16,072 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:16,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1945346733, now seen corresponding path program 1 times [2018-01-31 08:52:16,072 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:16,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:16,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:16,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:16,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:16,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:16,554 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-31 08:52:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:52:16,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:16,847 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:16,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:16,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:16,928 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-01-31 08:52:16,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:16,949 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-01-31 08:52:16,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:16,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, 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-01-31 08:52:16,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:16,967 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-01-31 08:52:16,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:16,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:52:16,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:52:17,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:17,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:17,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 25 [2018-01-31 08:52:17,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:17,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:17,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:17,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:52:17,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:17,865 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 1 xjuncts. [2018-01-31 08:52:17,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-01-31 08:52:18,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:18,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:18,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:52:18,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:18,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:18,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:18,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 34 [2018-01-31 08:52:18,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:18,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:18,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-01-31 08:52:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:52:18,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:52:18,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-01-31 08:52:18,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:52:18,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:52:18,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=719, Unknown=1, NotChecked=0, Total=812 [2018-01-31 08:52:18,270 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 29 states. [2018-01-31 08:52:18,636 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 64 DAG size of output 59 [2018-01-31 08:52:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:19,669 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2018-01-31 08:52:19,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:52:19,669 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-01-31 08:52:19,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:19,670 INFO L225 Difference]: With dead ends: 125 [2018-01-31 08:52:19,670 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:52:19,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=220, Invalid=1581, Unknown=5, NotChecked=0, Total=1806 [2018-01-31 08:52:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:52:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2018-01-31 08:52:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 08:52:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-01-31 08:52:19,682 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 56 [2018-01-31 08:52:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:19,682 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-01-31 08:52:19,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:52:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-01-31 08:52:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-31 08:52:19,683 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:19,683 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:19,683 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1619062292, now seen corresponding path program 1 times [2018-01-31 08:52:19,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:19,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:19,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:19,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:19,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:19,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:52:19,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:19,821 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:19,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:19,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:52:20,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:52:20,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-01-31 08:52:20,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:52:20,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:52:20,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:52:20,040 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 15 states. [2018-01-31 08:52:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:20,987 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-01-31 08:52:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:52:20,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-01-31 08:52:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:20,989 INFO L225 Difference]: With dead ends: 114 [2018-01-31 08:52:20,989 INFO L226 Difference]: Without dead ends: 113 [2018-01-31 08:52:20,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:52:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-31 08:52:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 88. [2018-01-31 08:52:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:52:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-01-31 08:52:21,007 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 58 [2018-01-31 08:52:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:21,007 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-01-31 08:52:21,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:52:21,007 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-01-31 08:52:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 08:52:21,008 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:21,008 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:21,008 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1348676510, now seen corresponding path program 1 times [2018-01-31 08:52:21,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:21,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:21,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:21,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:21,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:21,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 08:52:21,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:21,564 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:21,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:21,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:22,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:52:22,034 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-01-31 08:52:22,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:22,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:22,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:22,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-31 08:52:22,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-31 08:52:22,430 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:52:22,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:52:22,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:22,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:22,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:22,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-01-31 08:52:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:52:22,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:52:22,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-01-31 08:52:22,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:52:22,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:52:22,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:52:22,483 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 23 states. [2018-01-31 08:52:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:23,215 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-01-31 08:52:23,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:52:23,215 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-01-31 08:52:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:23,216 INFO L225 Difference]: With dead ends: 125 [2018-01-31 08:52:23,216 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:52:23,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:52:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:52:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 101. [2018-01-31 08:52:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-31 08:52:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-01-31 08:52:23,232 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 59 [2018-01-31 08:52:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:23,232 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-01-31 08:52:23,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:52:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-01-31 08:52:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 08:52:23,233 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:23,234 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:23,234 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1348676511, now seen corresponding path program 1 times [2018-01-31 08:52:23,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:23,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:23,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:23,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:23,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:23,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:52:23,942 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:23,942 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:23,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:23,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:23,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 6 treesize of output 5 [2018-01-31 08:52:23,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:52:24,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:52:24,041 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-01-31 08:52:24,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:24,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:24,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:24,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-01-31 08:52:24,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-31 08:52:24,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:24,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:24,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-01-31 08:52:24,227 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-01-31 08:52:24,229 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:52:24,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-31 08:52:24,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:24,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:24,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:24,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-01-31 08:52:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:52:24,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:52:24,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2018-01-31 08:52:24,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 08:52:24,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 08:52:24,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:52:24,262 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 25 states. [2018-01-31 08:52:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:24,828 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-31 08:52:24,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:52:24,828 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-01-31 08:52:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:24,828 INFO L225 Difference]: With dead ends: 103 [2018-01-31 08:52:24,829 INFO L226 Difference]: Without dead ends: 102 [2018-01-31 08:52:24,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2018-01-31 08:52:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-31 08:52:24,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-01-31 08:52:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-31 08:52:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-01-31 08:52:24,848 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 59 [2018-01-31 08:52:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:24,848 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-01-31 08:52:24,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 08:52:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-01-31 08:52:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:52:24,849 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:24,849 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:24,849 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:24,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1003409082, now seen corresponding path program 1 times [2018-01-31 08:52:24,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:24,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:24,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:24,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:24,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:24,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 08:52:24,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:24,928 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:24,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:24,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 08:52:25,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:52:25,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-01-31 08:52:25,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:52:25,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:52:25,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:52:25,139 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 8 states. [2018-01-31 08:52:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:25,262 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-01-31 08:52:25,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:52:25,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-31 08:52:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:25,263 INFO L225 Difference]: With dead ends: 105 [2018-01-31 08:52:25,263 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 08:52:25,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:52:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 08:52:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-31 08:52:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-31 08:52:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-31 08:52:25,280 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 61 [2018-01-31 08:52:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:25,280 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-31 08:52:25,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:52:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-31 08:52:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 08:52:25,281 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:25,281 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:25,281 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1057480014, now seen corresponding path program 2 times [2018-01-31 08:52:25,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:25,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:25,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:25,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:25,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:25,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-31 08:52:25,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:25,514 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:25,520 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:52:25,538 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:52:25,551 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:52:25,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-31 08:52:25,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:52:25,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-01-31 08:52:25,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:52:25,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:52:25,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:52:25,619 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 12 states. [2018-01-31 08:52:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:26,066 INFO L93 Difference]: Finished difference Result 194 states and 209 transitions. [2018-01-31 08:52:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:52:26,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-01-31 08:52:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:26,067 INFO L225 Difference]: With dead ends: 194 [2018-01-31 08:52:26,067 INFO L226 Difference]: Without dead ends: 172 [2018-01-31 08:52:26,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2018-01-31 08:52:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-31 08:52:26,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 109. [2018-01-31 08:52:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-31 08:52:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-01-31 08:52:26,088 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 65 [2018-01-31 08:52:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:26,089 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-01-31 08:52:26,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:52:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-01-31 08:52:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 08:52:26,090 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:26,090 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:26,090 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:52:26,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1652416881, now seen corresponding path program 1 times [2018-01-31 08:52:26,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:26,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:26,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:26,091 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:52:26,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:26,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:52:26,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:26,848 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:26,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:26,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:26,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 6 treesize of output 5 [2018-01-31 08:52:26,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:26,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:26,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:52:26,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:26,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:26,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:52:26,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:26,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:26,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 08:52:27,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:52:27,039 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-01-31 08:52:27,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:27,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:27,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:27,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-31 08:52:27,163 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-01-31 08:52:27,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:27,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:27,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:19 [2018-01-31 08:52:31,190 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 19 [2018-01-31 08:52:32,001 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 23 [2018-01-31 08:52:32,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-31 08:52:32,012 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:52:32,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-31 08:52:32,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:32,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:32,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:32,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:10 [2018-01-31 08:52:32,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:32,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-31 08:52:32,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:32,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-31 08:52:32,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-01-31 08:52:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:52:32,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:52:32,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 30 [2018-01-31 08:52:32,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:52:32,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:52:32,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=836, Unknown=1, NotChecked=0, Total=930 [2018-01-31 08:52:32,451 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 31 states. [2018-01-31 08:53:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:53:03,829 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-01-31 08:53:03,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 08:53:03,829 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-01-31 08:53:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:53:03,830 INFO L225 Difference]: With dead ends: 124 [2018-01-31 08:53:03,830 INFO L226 Difference]: Without dead ends: 122 [2018-01-31 08:53:03,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=262, Invalid=1993, Unknown=1, NotChecked=0, Total=2256 [2018-01-31 08:53:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-31 08:53:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2018-01-31 08:53:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:53:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-31 08:53:03,856 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 66 [2018-01-31 08:53:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:53:03,856 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-31 08:53:03,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:53:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-31 08:53:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 08:53:03,857 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:03,857 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:53:03,857 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:53:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1652416929, now seen corresponding path program 1 times [2018-01-31 08:53:03,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:03,858 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:03,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:03,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:03,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:03,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:53:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 08:53:03,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:53:03,996 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:53:04,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:04,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:53:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 08:53:04,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:53:04,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-31 08:53:04,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:53:04,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:53:04,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:53:04,060 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 10 states. [2018-01-31 08:53:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:53:04,345 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-01-31 08:53:04,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:53:04,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-01-31 08:53:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:53:04,347 INFO L225 Difference]: With dead ends: 137 [2018-01-31 08:53:04,347 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:53:04,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:53:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:53:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-01-31 08:53:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:53:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-01-31 08:53:04,378 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 66 [2018-01-31 08:53:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:53:04,380 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-01-31 08:53:04,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:53:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-01-31 08:53:04,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:53:04,382 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:04,382 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:53:04,382 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:53:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1763817103, now seen corresponding path program 1 times [2018-01-31 08:53:04,382 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:04,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:04,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:04,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:04,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:04,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:53:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-31 08:53:05,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:53:05,658 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:53:05,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:05,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:53:06,000 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 49 treesize of output 46 [2018-01-31 08:53:06,002 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-01-31 08:53:06,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:06,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:06,015 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 49 treesize of output 46 [2018-01-31 08:53:06,017 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-01-31 08:53:06,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:06,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:06,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:53:06,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-01-31 08:53:06,319 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 53 treesize of output 35 [2018-01-31 08:53:06,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:06,341 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 53 treesize of output 35 [2018-01-31 08:53:06,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:06,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-31 08:53:06,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-01-31 08:53:08,060 WARN L146 SmtUtils]: Spent 1662ms on a formula simplification. DAG size of input: 41 DAG size of output 23 [2018-01-31 08:53:16,765 WARN L146 SmtUtils]: Spent 4046ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-01-31 08:53:18,892 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 66 [2018-01-31 08:53:21,026 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 67 [2018-01-31 08:53:21,141 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 106 treesize of output 102 [2018-01-31 08:53:21,145 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:53:21,146 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:53:21,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 104 [2018-01-31 08:53:21,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:21,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 79 treesize of output 67 [2018-01-31 08:53:21,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:21,249 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:53:21,251 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:53:21,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 104 [2018-01-31 08:53:21,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-31 08:53:21,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:21,327 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 75 treesize of output 67 [2018-01-31 08:53:21,329 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:53:21,329 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 49 treesize of output 33 [2018-01-31 08:53:21,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:21,341 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:21,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:53:21,370 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:182, output treesize:63 [2018-01-31 08:53:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:53:24,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:53:24,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2018-01-31 08:53:24,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-31 08:53:24,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-31 08:53:24,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1337, Unknown=39, NotChecked=0, Total=1482 [2018-01-31 08:53:24,014 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 39 states. [2018-01-31 08:53:37,948 WARN L146 SmtUtils]: Spent 4044ms on a formula simplification. DAG size of input: 81 DAG size of output 56 [2018-01-31 08:53:38,409 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 111 DAG size of output 44 [2018-01-31 08:53:40,631 WARN L146 SmtUtils]: Spent 2123ms on a formula simplification. DAG size of input: 112 DAG size of output 40 [2018-01-31 08:53:41,611 WARN L146 SmtUtils]: Spent 773ms on a formula simplification. DAG size of input: 131 DAG size of output 45 [2018-01-31 08:53:47,587 WARN L146 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 84 DAG size of output 55 [2018-01-31 08:53:53,790 WARN L146 SmtUtils]: Spent 4035ms on a formula simplification. DAG size of input: 40 DAG size of output 39 [2018-01-31 08:53:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:53:53,999 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-31 08:53:54,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:53:54,002 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 69 [2018-01-31 08:53:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:53:54,003 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:53:54,003 INFO L226 Difference]: Without dead ends: 97 [2018-01-31 08:53:54,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=263, Invalid=2853, Unknown=76, NotChecked=0, Total=3192 [2018-01-31 08:53:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-31 08:53:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-31 08:53:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 08:53:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-31 08:53:54,021 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 69 [2018-01-31 08:53:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:53:54,021 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-31 08:53:54,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-31 08:53:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-31 08:53:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-31 08:53:54,022 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:54,022 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:53:54,023 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:53:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1766894189, now seen corresponding path program 2 times [2018-01-31 08:53:54,023 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:54,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:54,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:54,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:54,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:54,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:53:54,749 WARN L146 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-31 08:53:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-31 08:53:55,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:53:55,106 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:53:55,114 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:53:55,125 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:53:55,136 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:53:55,141 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:53:55,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:53:55,163 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-01-31 08:53:55,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:55,191 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-01-31 08:53:55,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:55,207 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-01-31 08:53:55,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:55,209 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-01-31 08:53:55,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:55,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:53:55,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:53:55,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:55,542 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 52 treesize of output 55 [2018-01-31 08:53:55,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:55,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:55,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:55,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-01-31 08:53:55,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:55,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:55,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:55,682 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 44 treesize of output 38 [2018-01-31 08:53:55,682 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:55,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:55,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:55,728 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 46 treesize of output 40 [2018-01-31 08:53:55,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:55,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-31 08:53:55,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 Received shutdown request... [2018-01-31 08:53:57,915 WARN L143 SmtUtils]: Spent 2053ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-31 08:53:57,916 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 08:53:57,917 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:53:57,920 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:53:57,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:53:57 BoogieIcfgContainer [2018-01-31 08:53:57,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:53:57,921 INFO L168 Benchmark]: Toolchain (without parser) took 156453.38 ms. Allocated memory was 308.3 MB in the beginning and 594.5 MB in the end (delta: 286.3 MB). Free memory was 267.0 MB in the beginning and 409.0 MB in the end (delta: -142.0 MB). Peak memory consumption was 144.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:53:57,922 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:53:57,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.63 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 253.1 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:53:57,923 INFO L168 Benchmark]: Boogie Preprocessor took 35.24 ms. Allocated memory is still 308.3 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:53:57,923 INFO L168 Benchmark]: RCFGBuilder took 517.96 ms. Allocated memory is still 308.3 MB. Free memory was 251.1 MB in the beginning and 232.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:53:57,923 INFO L168 Benchmark]: TraceAbstraction took 155560.46 ms. Allocated memory was 308.3 MB in the beginning and 594.5 MB in the end (delta: 286.3 MB). Free memory was 232.1 MB in the beginning and 409.0 MB in the end (delta: -176.9 MB). Peak memory consumption was 109.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:53:57,925 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.19 ms. Allocated memory is still 308.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 323.63 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 253.1 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.24 ms. Allocated memory is still 308.3 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 517.96 ms. Allocated memory is still 308.3 MB. Free memory was 251.1 MB in the beginning and 232.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 155560.46 ms. Allocated memory was 308.3 MB in the beginning and 594.5 MB in the end (delta: 286.3 MB). Free memory was 232.1 MB in the beginning and 409.0 MB in the end (delta: -176.9 MB). Peak memory consumption was 109.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 9 error locations. TIMEOUT Result, 155.4s OverallTime, 23 OverallIterations, 4 TraceHistogramMax, 113.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1241 SDtfs, 1756 SDslu, 7940 SDs, 0 SdLazy, 5360 SolverSat, 264 SolverUnsat, 106 SolverUnknown, 0 SolverNotchecked, 76.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1089 GetRequests, 668 SyntacticMatches, 24 SemanticMatches, 397 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 68.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=20, 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.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 419 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 36.2s InterpolantComputationTime, 1731 NumberOfCodeBlocks, 1696 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1696 ConstructedInterpolants, 153 QuantifiedInterpolants, 887473 SizeOfPredicates, 91 NumberOfNonLiveVariables, 1975 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 35 InterpolantComputations, 11 PerfectInterpolantSequences, 367/568 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-53-57-935.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-53-57-935.csv Completed graceful shutdown