java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:30:03,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:30:03,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:30:03,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:30:03,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:30:03,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:30:03,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:30:03,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:30:03,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:30:03,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:30:03,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:30:03,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:30:03,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:30:03,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:30:03,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:30:03,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:30:03,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:30:03,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:30:03,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:30:03,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:30:03,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:30:03,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:30:03,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:30:03,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:30:03,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:30:03,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:30:03,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:30:03,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:30:03,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:30:03,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:30:03,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:30:03,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:30:03,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:30:03,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:30:03,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:30:03,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:30:03,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:30:03,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:30:03,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:30:03,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:30:03,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:30:03,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 10:30:03,525 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:30:03,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:30:03,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:30:03,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:30:03,527 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:30:03,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:30:03,527 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:30:03,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:30:03,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:30:03,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:30:03,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:30:03,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:30:03,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:30:03,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:30:03,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:30:03,529 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:30:03,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:30:03,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:30:03,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:30:03,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:30:03,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:30:03,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:30:03,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:30:03,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:30:03,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:30:03,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:30:03,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:30:03,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:30:03,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:30:03,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:30:03,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:30:03,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:30:03,583 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:30:03,584 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:30:03,584 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original-2.i [2019-09-07 10:30:03,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc847ceb/e751f4c122194853a853bb94f8f05bcc/FLAG64b80314b [2019-09-07 10:30:04,086 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:30:04,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_original-2.i [2019-09-07 10:30:04,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc847ceb/e751f4c122194853a853bb94f8f05bcc/FLAG64b80314b [2019-09-07 10:30:04,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc847ceb/e751f4c122194853a853bb94f8f05bcc [2019-09-07 10:30:04,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:30:04,475 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:30:04,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:30:04,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:30:04,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:30:04,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:30:04" (1/1) ... [2019-09-07 10:30:04,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d85583e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04, skipping insertion in model container [2019-09-07 10:30:04,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:30:04" (1/1) ... [2019-09-07 10:30:04,499 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:30:04,518 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:30:04,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:30:04,707 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:30:04,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:30:04,754 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:30:04,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04 WrapperNode [2019-09-07 10:30:04,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:30:04,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:30:04,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:30:04,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:30:04,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04" (1/1) ... [2019-09-07 10:30:04,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04" (1/1) ... [2019-09-07 10:30:04,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04" (1/1) ... [2019-09-07 10:30:04,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04" (1/1) ... [2019-09-07 10:30:04,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04" (1/1) ... [2019-09-07 10:30:04,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04" (1/1) ... [2019-09-07 10:30:04,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04" (1/1) ... [2019-09-07 10:30:04,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:30:04,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:30:04,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:30:04,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:30:04,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-07 10:30:04,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:30:04,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:30:04,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:30:04,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:30:04,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:30:04,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:30:04,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:30:04,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:30:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:30:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:30:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:30:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:30:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:30:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:30:05,224 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:30:05,224 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:30:05,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:30:05 BoogieIcfgContainer [2019-09-07 10:30:05,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:30:05,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:30:05,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:30:05,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:30:05,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:30:04" (1/3) ... [2019-09-07 10:30:05,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8a467c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:30:05, skipping insertion in model container [2019-09-07 10:30:05,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:30:04" (2/3) ... [2019-09-07 10:30:05,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8a467c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:30:05, skipping insertion in model container [2019-09-07 10:30:05,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:30:05" (3/3) ... [2019-09-07 10:30:05,235 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original-2.i [2019-09-07 10:30:05,246 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:30:05,265 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:30:05,290 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:30:05,322 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:30:05,323 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:30:05,323 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:30:05,323 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:30:05,323 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:30:05,324 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:30:05,324 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:30:05,324 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:30:05,324 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:30:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-07 10:30:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 10:30:05,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:05,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:05,355 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1229081071, now seen corresponding path program 1 times [2019-09-07 10:30:05,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:05,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:05,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:05,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:30:05,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:30:05,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:30:05,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:30:05,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:30:05,526 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-07 10:30:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:05,547 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-09-07 10:30:05,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:30:05,548 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-09-07 10:30:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:05,557 INFO L225 Difference]: With dead ends: 47 [2019-09-07 10:30:05,557 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 10:30:05,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:30:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 10:30:05,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-07 10:30:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 10:30:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-07 10:30:05,604 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2019-09-07 10:30:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:05,605 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-07 10:30:05,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:30:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-07 10:30:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 10:30:05,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:05,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:05,607 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash -959296020, now seen corresponding path program 1 times [2019-09-07 10:30:05,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:05,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:05,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:05,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:05,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:05,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:30:05,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:30:05,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:30:05,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:30:05,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:30:05,683 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2019-09-07 10:30:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:05,706 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2019-09-07 10:30:05,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:30:05,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 10:30:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:05,709 INFO L225 Difference]: With dead ends: 38 [2019-09-07 10:30:05,709 INFO L226 Difference]: Without dead ends: 23 [2019-09-07 10:30:05,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:30:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-07 10:30:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-07 10:30:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 10:30:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-07 10:30:05,726 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2019-09-07 10:30:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:05,726 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-07 10:30:05,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:30:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-07 10:30:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:30:05,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:05,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:05,729 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:05,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:05,730 INFO L82 PathProgramCache]: Analyzing trace with hash 71345632, now seen corresponding path program 1 times [2019-09-07 10:30:05,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:05,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:05,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:05,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:05,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:05,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:05,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:05,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:05,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:30:05,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:30:05,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:05,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:30:05,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:30:05,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:30:05,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:30:05,927 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2019-09-07 10:30:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:05,953 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-09-07 10:30:05,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:30:05,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-07 10:30:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:05,955 INFO L225 Difference]: With dead ends: 39 [2019-09-07 10:30:05,955 INFO L226 Difference]: Without dead ends: 24 [2019-09-07 10:30:05,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:30:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-07 10:30:05,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-07 10:30:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 10:30:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-07 10:30:05,962 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2019-09-07 10:30:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:05,962 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-07 10:30:05,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:30:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-07 10:30:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 10:30:05,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:05,963 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:05,963 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:05,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1956465772, now seen corresponding path program 2 times [2019-09-07 10:30:05,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:05,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:05,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:05,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:06,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:06,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:06,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:30:06,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-07 10:30:06,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:06,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:30:06,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:06,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:30:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:30:06,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 10:30:06,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-07 10:30:06,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:30:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:30:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:30:06,244 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 10 states. [2019-09-07 10:30:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:06,490 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-09-07 10:30:06,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:30:06,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-09-07 10:30:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:06,493 INFO L225 Difference]: With dead ends: 56 [2019-09-07 10:30:06,493 INFO L226 Difference]: Without dead ends: 35 [2019-09-07 10:30:06,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:30:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-07 10:30:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-09-07 10:30:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:30:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-07 10:30:06,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-09-07 10:30:06,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:06,505 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-07 10:30:06,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:30:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-07 10:30:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 10:30:06,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:06,507 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:06,507 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:06,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash -127379042, now seen corresponding path program 1 times [2019-09-07 10:30:06,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:06,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:06,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:30:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:30:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 10:30:06,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 10:30:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 10:30:06,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 10:30:06,601 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-09-07 10:30:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:06,646 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-09-07 10:30:06,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:30:06,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-07 10:30:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:06,647 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:30:06,647 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 10:30:06,648 INFO L628 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 [2019-09-07 10:30:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 10:30:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-09-07 10:30:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:30:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-07 10:30:06,654 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 21 [2019-09-07 10:30:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:06,655 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-07 10:30:06,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 10:30:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-07 10:30:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 10:30:06,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:06,656 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:06,656 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:06,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:06,657 INFO L82 PathProgramCache]: Analyzing trace with hash -81574727, now seen corresponding path program 1 times [2019-09-07 10:30:06,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:06,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:06,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:06,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:06,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:30:06,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:06,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:06,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:06,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:30:06,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:30:06,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:06,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:30:06,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:30:06,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:30:06,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:30:06,792 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 7 states. [2019-09-07 10:30:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:06,814 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-09-07 10:30:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:30:06,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-09-07 10:30:06,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:06,819 INFO L225 Difference]: With dead ends: 47 [2019-09-07 10:30:06,819 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 10:30:06,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:30:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 10:30:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-07 10:30:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 10:30:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-07 10:30:06,825 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2019-09-07 10:30:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:06,825 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-07 10:30:06,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:30:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-07 10:30:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 10:30:06,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:06,826 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:06,827 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:06,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:06,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1750805075, now seen corresponding path program 2 times [2019-09-07 10:30:06,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:06,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:06,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:06,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:30:06,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:06,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:30:06,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:06,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:30:06,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:06,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:30:06,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:30:06,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:06,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:30:06,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:30:06,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:30:06,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:30:06,976 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-09-07 10:30:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:06,998 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-09-07 10:30:06,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:30:06,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-09-07 10:30:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:06,999 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:30:06,999 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 10:30:07,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:30:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 10:30:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-07 10:30:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 10:30:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-07 10:30:07,005 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2019-09-07 10:30:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:07,006 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-07 10:30:07,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:30:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-07 10:30:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 10:30:07,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:07,007 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:07,007 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:07,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1957338311, now seen corresponding path program 3 times [2019-09-07 10:30:07,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:07,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:07,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:30:07,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:07,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:30:07,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:07,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-07 10:30:07,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:07,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:30:07,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:07,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:30:07,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:07,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:07,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:30:07,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-09-07 10:30:07,253 INFO L375 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 15 [2019-09-07 10:30:07,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:07,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:07,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:30:07,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-07 10:30:07,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 10:30:07,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:07,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:07,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:30:07,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:30:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:30:07,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:07,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-07 10:30:07,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:30:07,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:30:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:30:07,390 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 14 states. [2019-09-07 10:30:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:07,725 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2019-09-07 10:30:07,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:30:07,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-09-07 10:30:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:07,727 INFO L225 Difference]: With dead ends: 58 [2019-09-07 10:30:07,727 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 10:30:07,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:30:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 10:30:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-07 10:30:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 10:30:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-09-07 10:30:07,740 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 26 [2019-09-07 10:30:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:07,740 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-09-07 10:30:07,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:30:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-09-07 10:30:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 10:30:07,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:07,745 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:07,745 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:07,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash 222681613, now seen corresponding path program 1 times [2019-09-07 10:30:07,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:07,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:07,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:07,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:07,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 10:30:07,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:07,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:30:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:07,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:30:07,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:30:07,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:07,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:30:07,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:30:07,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:30:07,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:30:07,910 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2019-09-07 10:30:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:07,945 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-09-07 10:30:07,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:30:07,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-09-07 10:30:07,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:07,948 INFO L225 Difference]: With dead ends: 66 [2019-09-07 10:30:07,948 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 10:30:07,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:30:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 10:30:07,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-07 10:30:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:30:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-09-07 10:30:07,955 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2019-09-07 10:30:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:07,956 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-09-07 10:30:07,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:30:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-09-07 10:30:07,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 10:30:07,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:07,957 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:07,957 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:07,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:07,958 INFO L82 PathProgramCache]: Analyzing trace with hash -120480511, now seen corresponding path program 2 times [2019-09-07 10:30:07,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:07,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:07,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:07,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:07,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 10:30:08,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:08,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:30:08,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:08,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:30:08,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:08,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:30:08,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:30:08,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:08,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:30:08,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:30:08,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:30:08,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:30:08,163 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 11 states. [2019-09-07 10:30:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:08,193 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-09-07 10:30:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:30:08,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-09-07 10:30:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:08,194 INFO L225 Difference]: With dead ends: 67 [2019-09-07 10:30:08,194 INFO L226 Difference]: Without dead ends: 41 [2019-09-07 10:30:08,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:30:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-07 10:30:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-07 10:30:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 10:30:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-09-07 10:30:08,201 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2019-09-07 10:30:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:08,202 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-09-07 10:30:08,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:30:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-09-07 10:30:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 10:30:08,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:08,204 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:08,204 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:08,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2126395533, now seen corresponding path program 3 times [2019-09-07 10:30:08,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:08,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:08,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 10:30:08,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:08,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:08,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:30:08,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-07 10:30:08,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:08,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:30:08,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:08,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:30:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:30:08,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:08,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-07 10:30:08,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:30:08,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:30:08,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:30:08,604 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 19 states. [2019-09-07 10:30:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:09,067 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-09-07 10:30:09,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:30:09,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-09-07 10:30:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:09,068 INFO L225 Difference]: With dead ends: 96 [2019-09-07 10:30:09,069 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 10:30:09,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:30:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 10:30:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2019-09-07 10:30:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-07 10:30:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-07 10:30:09,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 38 [2019-09-07 10:30:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:09,077 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-07 10:30:09,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:30:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-07 10:30:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:30:09,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:09,078 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:09,079 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:09,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1371132419, now seen corresponding path program 1 times [2019-09-07 10:30:09,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:09,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:09,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 10:30:09,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:09,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:09,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:09,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:30:09,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:30:09,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:09,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12] total 15 [2019-09-07 10:30:09,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:30:09,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:30:09,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:30:09,335 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 15 states. [2019-09-07 10:30:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:09,542 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2019-09-07 10:30:09,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:30:09,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-09-07 10:30:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:09,543 INFO L225 Difference]: With dead ends: 81 [2019-09-07 10:30:09,543 INFO L226 Difference]: Without dead ends: 52 [2019-09-07 10:30:09,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=479, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:30:09,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-07 10:30:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-09-07 10:30:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 10:30:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-09-07 10:30:09,551 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 39 [2019-09-07 10:30:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:09,551 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-09-07 10:30:09,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:30:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-09-07 10:30:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 10:30:09,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:09,552 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:09,552 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:09,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:09,553 INFO L82 PathProgramCache]: Analyzing trace with hash -860741298, now seen corresponding path program 4 times [2019-09-07 10:30:09,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:09,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:09,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:09,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:09,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 10:30:09,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:09,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:30:09,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:09,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:30:09,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:09,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:30:09,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:30:09,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:09,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:30:09,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:30:09,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:30:09,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:30:09,789 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 14 states. [2019-09-07 10:30:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:09,821 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-09-07 10:30:09,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:30:09,824 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-09-07 10:30:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:09,825 INFO L225 Difference]: With dead ends: 76 [2019-09-07 10:30:09,825 INFO L226 Difference]: Without dead ends: 47 [2019-09-07 10:30:09,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:30:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-07 10:30:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-07 10:30:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 10:30:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-09-07 10:30:09,837 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 43 [2019-09-07 10:30:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:09,841 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-09-07 10:30:09,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:30:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-09-07 10:30:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 10:30:09,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:09,843 INFO L399 BasicCegarLoop]: trace histogram [11, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:09,843 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:09,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:09,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2056854566, now seen corresponding path program 5 times [2019-09-07 10:30:09,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:09,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:09,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 10:30:10,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:10,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:10,041 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:30:10,174 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-07 10:30:10,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:10,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:30:10,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:30:10,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:10,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:30:10,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:30:10,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:30:10,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:30:10,201 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 15 states. [2019-09-07 10:30:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:10,233 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-09-07 10:30:10,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:30:10,233 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2019-09-07 10:30:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:10,234 INFO L225 Difference]: With dead ends: 77 [2019-09-07 10:30:10,234 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 10:30:10,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:30:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 10:30:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-07 10:30:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 10:30:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-09-07 10:30:10,241 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 44 [2019-09-07 10:30:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:10,241 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-09-07 10:30:10,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:30:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-09-07 10:30:10,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 10:30:10,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:10,243 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:10,243 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:10,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:10,243 INFO L82 PathProgramCache]: Analyzing trace with hash -481660210, now seen corresponding path program 6 times [2019-09-07 10:30:10,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:10,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:10,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:10,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 10:30:10,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:10,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:10,399 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:30:10,454 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 10:30:10,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:10,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:30:10,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:10,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:30:10,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:10,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:10,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:30:10,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-09-07 10:30:10,544 INFO L375 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 19 treesize of output 19 [2019-09-07 10:30:10,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:10,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:10,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:30:10,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-09-07 10:30:12,641 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|)))) is different from true [2019-09-07 10:30:14,669 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 10:30:16,699 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-07 10:30:16,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 10:30:16,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:16,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:16,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:30:16,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:30:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 78 trivial. 1 not checked. [2019-09-07 10:30:18,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:18,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-09-07 10:30:18,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:30:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:30:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=471, Unknown=2, NotChecked=46, Total=650 [2019-09-07 10:30:18,839 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 26 states. [2019-09-07 10:30:21,480 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-07 10:30:27,663 WARN L188 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-09-07 10:30:31,713 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-09-07 10:30:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:33,795 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-09-07 10:30:33,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:30:33,796 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2019-09-07 10:30:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:33,797 INFO L225 Difference]: With dead ends: 88 [2019-09-07 10:30:33,797 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 10:30:33,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=367, Invalid=1440, Unknown=3, NotChecked=82, Total=1892 [2019-09-07 10:30:33,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 10:30:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-07 10:30:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-07 10:30:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-09-07 10:30:33,805 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2019-09-07 10:30:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:33,805 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-09-07 10:30:33,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:30:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-09-07 10:30:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 10:30:33,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:33,807 INFO L399 BasicCegarLoop]: trace histogram [13, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:33,807 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:33,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:33,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1029628288, now seen corresponding path program 7 times [2019-09-07 10:30:33,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:33,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:33,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:33,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:33,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 4 proven. 91 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 10:30:33,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:33,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:33,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:34,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:30:34,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 10:30:34,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:34,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:30:34,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:30:34,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:30:34,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:30:34,043 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 17 states. [2019-09-07 10:30:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:34,079 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-09-07 10:30:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:30:34,081 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-09-07 10:30:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:34,082 INFO L225 Difference]: With dead ends: 97 [2019-09-07 10:30:34,083 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 10:30:34,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:30:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 10:30:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-07 10:30:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-07 10:30:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-09-07 10:30:34,089 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 55 [2019-09-07 10:30:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:34,090 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-09-07 10:30:34,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:30:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-09-07 10:30:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 10:30:34,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:34,091 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:34,091 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:34,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1118319116, now seen corresponding path program 8 times [2019-09-07 10:30:34,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:34,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:34,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 4 proven. 105 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 10:30:34,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:34,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:34,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:30:34,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:30:34,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:34,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:30:34,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 10:30:34,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:34,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:30:34,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:30:34,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:30:34,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:30:34,347 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 18 states. [2019-09-07 10:30:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:34,383 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-09-07 10:30:34,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:30:34,383 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-09-07 10:30:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:34,384 INFO L225 Difference]: With dead ends: 98 [2019-09-07 10:30:34,384 INFO L226 Difference]: Without dead ends: 60 [2019-09-07 10:30:34,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:30:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-07 10:30:34,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-07 10:30:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-07 10:30:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-09-07 10:30:34,390 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 56 [2019-09-07 10:30:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:34,390 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-09-07 10:30:34,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:30:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-09-07 10:30:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 10:30:34,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:34,391 INFO L399 BasicCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:34,392 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:34,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash -427232512, now seen corresponding path program 9 times [2019-09-07 10:30:34,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:34,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:34,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 120 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 10:30:34,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:34,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:34,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:30:34,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:30:34,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:34,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:30:34,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:34,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:30:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-07 10:30:34,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:34,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2019-09-07 10:30:34,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:30:34,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:30:34,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:30:34,975 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 28 states. [2019-09-07 10:30:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:35,901 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2019-09-07 10:30:35,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:30:35,902 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 57 [2019-09-07 10:30:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:35,903 INFO L225 Difference]: With dead ends: 141 [2019-09-07 10:30:35,904 INFO L226 Difference]: Without dead ends: 81 [2019-09-07 10:30:35,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=498, Invalid=1572, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:30:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-07 10:30:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2019-09-07 10:30:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:30:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-07 10:30:35,912 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 57 [2019-09-07 10:30:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:35,913 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-07 10:30:35,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:30:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-07 10:30:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 10:30:35,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:35,914 INFO L399 BasicCegarLoop]: trace histogram [16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:35,914 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1604165814, now seen corresponding path program 2 times [2019-09-07 10:30:35,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:35,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:35,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:30:35,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:35,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:30:35,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:36,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:30:36,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:36,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:30:36,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 10:30:36,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:36,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 23 [2019-09-07 10:30:36,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:30:36,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:30:36,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:30:36,262 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 23 states. [2019-09-07 10:30:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:36,671 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-09-07 10:30:36,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:30:36,673 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 58 [2019-09-07 10:30:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:36,674 INFO L225 Difference]: With dead ends: 112 [2019-09-07 10:30:36,675 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 10:30:36,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=574, Invalid=1232, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:30:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 10:30:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-09-07 10:30:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-07 10:30:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-09-07 10:30:36,688 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 58 [2019-09-07 10:30:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:36,689 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-09-07 10:30:36,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:30:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-09-07 10:30:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 10:30:36,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:36,690 INFO L399 BasicCegarLoop]: trace histogram [17, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:36,690 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash -470896167, now seen corresponding path program 10 times [2019-09-07 10:30:36,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:36,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:36,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 4 proven. 153 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 10:30:36,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:36,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:36,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:30:36,984 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:30:36,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:36,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:30:36,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-07 10:30:37,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:37,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:30:37,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:30:37,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:30:37,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:30:37,006 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 21 states. [2019-09-07 10:30:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:37,052 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-09-07 10:30:37,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:30:37,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2019-09-07 10:30:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:37,053 INFO L225 Difference]: With dead ends: 107 [2019-09-07 10:30:37,053 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 10:30:37,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:30:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 10:30:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-07 10:30:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 10:30:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-09-07 10:30:37,060 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 62 [2019-09-07 10:30:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:37,060 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-09-07 10:30:37,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:30:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-09-07 10:30:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 10:30:37,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:37,061 INFO L399 BasicCegarLoop]: trace histogram [18, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:37,061 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash 934276045, now seen corresponding path program 11 times [2019-09-07 10:30:37,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:37,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:37,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 4 proven. 171 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 10:30:37,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:37,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:30:37,347 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:37,843 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-07 10:30:37,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:37,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:30:37,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-07 10:30:37,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:37,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:30:37,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:30:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:30:37,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:30:37,871 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 22 states. [2019-09-07 10:30:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:37,917 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-09-07 10:30:37,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:30:37,918 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2019-09-07 10:30:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:37,918 INFO L225 Difference]: With dead ends: 108 [2019-09-07 10:30:37,919 INFO L226 Difference]: Without dead ends: 67 [2019-09-07 10:30:37,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:30:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-07 10:30:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-07 10:30:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 10:30:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-09-07 10:30:37,924 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 63 [2019-09-07 10:30:37,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:37,924 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-09-07 10:30:37,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:30:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-09-07 10:30:37,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 10:30:37,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:37,925 INFO L399 BasicCegarLoop]: trace histogram [19, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:37,926 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:37,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:37,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1544941657, now seen corresponding path program 12 times [2019-09-07 10:30:37,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:37,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:37,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:37,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:37,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 4 proven. 190 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 10:30:38,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:38,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:38,152 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:30:38,334 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:30:38,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:38,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:30:38,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:38,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:30:38,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:38,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:38,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:30:38,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-09-07 10:30:38,406 INFO L375 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 19 treesize of output 19 [2019-09-07 10:30:38,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:38,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:38,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:30:38,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-09-07 10:30:40,466 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#src~0.offset_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) (+ |v_main_~#src~0.offset_BEFORE_CALL_5| 8)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_2| 8))))) is different from true [2019-09-07 10:30:42,531 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#src~0.offset_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_3| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_3| 8)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) (+ |v_main_~#src~0.offset_BEFORE_CALL_6| 8))))) is different from true [2019-09-07 10:30:44,569 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-07 10:30:46,608 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-07 10:30:46,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-09-07 10:30:46,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:46,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:46,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:30:46,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2019-09-07 10:30:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 190 trivial. 7 not checked. [2019-09-07 10:30:48,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:48,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 36 [2019-09-07 10:30:48,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:30:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:30:48,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=862, Unknown=3, NotChecked=130, Total=1260 [2019-09-07 10:30:48,751 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 36 states. [2019-09-07 10:30:51,773 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-07 10:30:57,991 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-09-07 10:31:02,047 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-09-07 10:31:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:04,140 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2019-09-07 10:31:04,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:31:04,143 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 64 [2019-09-07 10:31:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:04,144 INFO L225 Difference]: With dead ends: 119 [2019-09-07 10:31:04,144 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 10:31:04,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=753, Invalid=2673, Unknown=4, NotChecked=230, Total=3660 [2019-09-07 10:31:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 10:31:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-07 10:31:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 10:31:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-09-07 10:31:04,151 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 64 [2019-09-07 10:31:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:04,151 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-09-07 10:31:04,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:31:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-09-07 10:31:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 10:31:04,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:04,153 INFO L399 BasicCegarLoop]: trace histogram [20, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:04,153 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:04,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:04,153 INFO L82 PathProgramCache]: Analyzing trace with hash -225523731, now seen corresponding path program 13 times [2019-09-07 10:31:04,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:04,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:04,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:04,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:04,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-07 10:31:04,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:04,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:04,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:31:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:04,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:31:04,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-07 10:31:04,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:04,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:31:04,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:31:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:31:04,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:31:04,541 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 24 states. [2019-09-07 10:31:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:04,578 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2019-09-07 10:31:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:31:04,579 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2019-09-07 10:31:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:04,580 INFO L225 Difference]: With dead ends: 128 [2019-09-07 10:31:04,581 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 10:31:04,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:31:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 10:31:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-07 10:31:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-07 10:31:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-09-07 10:31:04,593 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 74 [2019-09-07 10:31:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:04,593 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-09-07 10:31:04,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:31:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-09-07 10:31:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:31:04,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:04,594 INFO L399 BasicCegarLoop]: trace histogram [21, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:04,594 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:04,594 INFO L82 PathProgramCache]: Analyzing trace with hash 774157281, now seen corresponding path program 14 times [2019-09-07 10:31:04,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:04,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:04,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:31:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 231 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-07 10:31:04,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:04,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:04,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:31:04,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:31:04,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:04,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:31:04,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-07 10:31:04,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:04,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:31:04,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:31:04,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:31:04,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:31:04,992 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 25 states. [2019-09-07 10:31:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:05,031 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-09-07 10:31:05,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:31:05,032 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2019-09-07 10:31:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:05,033 INFO L225 Difference]: With dead ends: 129 [2019-09-07 10:31:05,033 INFO L226 Difference]: Without dead ends: 79 [2019-09-07 10:31:05,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:31:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-07 10:31:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-09-07 10:31:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 10:31:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-09-07 10:31:05,039 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 75 [2019-09-07 10:31:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:05,039 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-09-07 10:31:05,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:31:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-09-07 10:31:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 10:31:05,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:05,040 INFO L399 BasicCegarLoop]: trace histogram [22, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:05,041 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:05,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:05,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1699497581, now seen corresponding path program 15 times [2019-09-07 10:31:05,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:05,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:05,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 6 proven. 253 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-07 10:31:05,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:05,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:05,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:31:05,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 10:31:05,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:05,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:31:05,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:05,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:31:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-07 10:31:05,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:05,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 37 [2019-09-07 10:31:05,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:31:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:31:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:31:05,874 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 37 states. [2019-09-07 10:31:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:07,128 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2019-09-07 10:31:07,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:31:07,129 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-09-07 10:31:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:07,130 INFO L225 Difference]: With dead ends: 186 [2019-09-07 10:31:07,131 INFO L226 Difference]: Without dead ends: 105 [2019-09-07 10:31:07,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=2836, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 10:31:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-07 10:31:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2019-09-07 10:31:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 10:31:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-09-07 10:31:07,145 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 76 [2019-09-07 10:31:07,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:07,146 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-09-07 10:31:07,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:31:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-09-07 10:31:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 10:31:07,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:07,147 INFO L399 BasicCegarLoop]: trace histogram [23, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:07,147 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:07,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:07,147 INFO L82 PathProgramCache]: Analyzing trace with hash 979807331, now seen corresponding path program 3 times [2019-09-07 10:31:07,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:07,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:07,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:07,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 10:31:07,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:07,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:07,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:31:07,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 10:31:07,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:07,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:31:07,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:07,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:31:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-09-07 10:31:07,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:07,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:31:07,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:31:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:31:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:31:07,328 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 8 states. [2019-09-07 10:31:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:07,436 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2019-09-07 10:31:07,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:31:07,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-09-07 10:31:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:07,437 INFO L225 Difference]: With dead ends: 130 [2019-09-07 10:31:07,438 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 10:31:07,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:31:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 10:31:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-09-07 10:31:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 10:31:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-09-07 10:31:07,445 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 77 [2019-09-07 10:31:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:07,445 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-09-07 10:31:07,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:31:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-09-07 10:31:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 10:31:07,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:07,446 INFO L399 BasicCegarLoop]: trace histogram [23, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:07,446 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1967152186, now seen corresponding path program 16 times [2019-09-07 10:31:07,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:07,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:07,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:07,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:07,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 6 proven. 276 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 10:31:07,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:07,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:07,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:31:07,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:31:07,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:07,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:31:07,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 10:31:07,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:07,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:31:07,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:31:07,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:31:07,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:31:07,823 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 27 states. [2019-09-07 10:31:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:07,877 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-09-07 10:31:07,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:31:07,877 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2019-09-07 10:31:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:07,878 INFO L225 Difference]: With dead ends: 137 [2019-09-07 10:31:07,878 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 10:31:07,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:31:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 10:31:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-09-07 10:31:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 10:31:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-09-07 10:31:07,885 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 80 [2019-09-07 10:31:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:07,886 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-09-07 10:31:07,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:31:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-09-07 10:31:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-07 10:31:07,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:07,887 INFO L399 BasicCegarLoop]: trace histogram [24, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:07,887 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:07,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1326808786, now seen corresponding path program 17 times [2019-09-07 10:31:07,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:07,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:07,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:07,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:07,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 6 proven. 300 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 10:31:08,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:08,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:08,239 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:31:09,509 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-07 10:31:09,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:09,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:31:09,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 10:31:09,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:09,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 10:31:09,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:31:09,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:31:09,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:31:09,538 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 28 states. [2019-09-07 10:31:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:09,598 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2019-09-07 10:31:09,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:31:09,598 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2019-09-07 10:31:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:09,599 INFO L225 Difference]: With dead ends: 138 [2019-09-07 10:31:09,599 INFO L226 Difference]: Without dead ends: 85 [2019-09-07 10:31:09,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:31:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-07 10:31:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-09-07 10:31:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-07 10:31:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2019-09-07 10:31:09,606 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 81 [2019-09-07 10:31:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:09,606 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2019-09-07 10:31:09,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:31:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2019-09-07 10:31:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 10:31:09,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:09,607 INFO L399 BasicCegarLoop]: trace histogram [25, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:09,608 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:09,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:09,608 INFO L82 PathProgramCache]: Analyzing trace with hash -360383814, now seen corresponding path program 18 times [2019-09-07 10:31:09,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:09,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:09,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 6 proven. 325 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 10:31:10,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:10,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:10,036 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:31:10,378 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-07 10:31:10,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:10,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 10:31:10,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:10,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:31:10,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:31:10,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:31:10,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:31:10,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:31:10,490 INFO L375 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 19 treesize of output 19 [2019-09-07 10:31:10,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:31:10,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:31:10,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:31:10,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-09-07 10:31:12,560 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_4| Int) (|v_main_~#src~0.base_BEFORE_CALL_10| Int) (|v_main_~#dst~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_10| |v_main_~#dst~0.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_10|) 12) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_4|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_4| 12))))) is different from true [2019-09-07 10:31:14,667 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_5| Int) (|v_main_~#src~0.base_BEFORE_CALL_11| Int) (|v_main_~#dst~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_11|) 12) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_5|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_5| 12))) (not (= |v_main_~#src~0.base_BEFORE_CALL_11| |v_main_~#dst~0.base_BEFORE_CALL_5|)))) is different from true [2019-09-07 10:31:16,743 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_6| Int) (|v_main_~#src~0.base_BEFORE_CALL_12| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_12| |v_main_~#dst~0.base_BEFORE_CALL_6|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_6|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_6| 12)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_12|) 12)))) is different from true [2019-09-07 10:31:18,777 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 19 [2019-09-07 10:31:20,815 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-07 10:31:20,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-09-07 10:31:20,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:31:20,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:31:20,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:31:20,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-09-07 10:31:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 325 trivial. 17 not checked. [2019-09-07 10:31:22,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:22,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 45 [2019-09-07 10:31:22,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 10:31:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 10:31:22,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1310, Unknown=4, NotChecked=246, Total=1980 [2019-09-07 10:31:22,997 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 45 states. [2019-09-07 10:31:26,694 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-07 10:31:32,937 WARN L188 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-09-07 10:31:37,006 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-09-07 10:31:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:39,113 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2019-09-07 10:31:39,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 10:31:39,114 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 82 [2019-09-07 10:31:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:39,115 INFO L225 Difference]: With dead ends: 149 [2019-09-07 10:31:39,115 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 10:31:39,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=1202, Invalid=4061, Unknown=5, NotChecked=432, Total=5700 [2019-09-07 10:31:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 10:31:39,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-07 10:31:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-07 10:31:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2019-09-07 10:31:39,127 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 82 [2019-09-07 10:31:39,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:39,127 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2019-09-07 10:31:39,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 10:31:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2019-09-07 10:31:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-07 10:31:39,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:39,129 INFO L399 BasicCegarLoop]: trace histogram [26, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:39,129 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1227165612, now seen corresponding path program 19 times [2019-09-07 10:31:39,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:39,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:39,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 8 proven. 351 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 10:31:39,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:39,631 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:39,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:31:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:39,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:31:39,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 10:31:39,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:39,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 10:31:39,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:31:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:31:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:31:39,742 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 30 states. [2019-09-07 10:31:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:39,794 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2019-09-07 10:31:39,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 10:31:39,795 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2019-09-07 10:31:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:39,796 INFO L225 Difference]: With dead ends: 158 [2019-09-07 10:31:39,796 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 10:31:39,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:31:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 10:31:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-07 10:31:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 10:31:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2019-09-07 10:31:39,803 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 92 [2019-09-07 10:31:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:39,803 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2019-09-07 10:31:39,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:31:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2019-09-07 10:31:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 10:31:39,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:39,804 INFO L399 BasicCegarLoop]: trace histogram [27, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:39,804 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:39,805 INFO L82 PathProgramCache]: Analyzing trace with hash 396060320, now seen corresponding path program 20 times [2019-09-07 10:31:39,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:39,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:39,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:31:39,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 8 proven. 378 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 10:31:40,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:40,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:31:40,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:40,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:31:40,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:40,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:31:40,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 10:31:40,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:40,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:31:40,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:31:40,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:31:40,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:31:40,439 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 31 states. [2019-09-07 10:31:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:40,487 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2019-09-07 10:31:40,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:31:40,487 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2019-09-07 10:31:40,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:40,488 INFO L225 Difference]: With dead ends: 159 [2019-09-07 10:31:40,488 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 10:31:40,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:31:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 10:31:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-09-07 10:31:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-07 10:31:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2019-09-07 10:31:40,496 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 93 [2019-09-07 10:31:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:40,497 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2019-09-07 10:31:40,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:31:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2019-09-07 10:31:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-07 10:31:40,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:40,498 INFO L399 BasicCegarLoop]: trace histogram [28, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:40,498 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash 401600044, now seen corresponding path program 21 times [2019-09-07 10:31:40,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:40,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:40,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 8 proven. 406 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 10:31:40,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:40,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:40,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:31:41,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 10:31:41,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:41,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:31:41,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:41,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:31:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2019-09-07 10:31:41,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:41,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17] total 46 [2019-09-07 10:31:41,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 10:31:41,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 10:31:41,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=1529, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:31:41,602 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 46 states. [2019-09-07 10:31:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:43,600 INFO L93 Difference]: Finished difference Result 230 states and 244 transitions. [2019-09-07 10:31:43,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:31:43,605 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 94 [2019-09-07 10:31:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:43,609 INFO L225 Difference]: With dead ends: 230 [2019-09-07 10:31:43,609 INFO L226 Difference]: Without dead ends: 128 [2019-09-07 10:31:43,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1448, Invalid=4252, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 10:31:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-07 10:31:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2019-09-07 10:31:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 10:31:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-09-07 10:31:43,622 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 94 [2019-09-07 10:31:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:43,622 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-09-07 10:31:43,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 10:31:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-09-07 10:31:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 10:31:43,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:43,623 INFO L399 BasicCegarLoop]: trace histogram [29, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:43,623 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:43,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1793363106, now seen corresponding path program 4 times [2019-09-07 10:31:43,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:43,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:43,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:43,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-09-07 10:31:43,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:43,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:43,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:31:43,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:31:43,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:43,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:31:43,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:43,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:31:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-07 10:31:43,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:43,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:31:43,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:31:43,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:31:43,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:31:43,803 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 9 states. [2019-09-07 10:31:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:43,932 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2019-09-07 10:31:43,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:31:43,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-07 10:31:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:43,939 INFO L225 Difference]: With dead ends: 157 [2019-09-07 10:31:43,939 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 10:31:43,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:31:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 10:31:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2019-09-07 10:31:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 10:31:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2019-09-07 10:31:43,945 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 95 [2019-09-07 10:31:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:43,946 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2019-09-07 10:31:43,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:31:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2019-09-07 10:31:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 10:31:43,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:43,952 INFO L399 BasicCegarLoop]: trace histogram [29, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:43,952 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:43,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:43,953 INFO L82 PathProgramCache]: Analyzing trace with hash -533792647, now seen corresponding path program 22 times [2019-09-07 10:31:43,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:43,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:43,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:43,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:43,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 8 proven. 435 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-07 10:31:44,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:44,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:44,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:31:44,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:31:44,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:44,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:31:44,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-07 10:31:44,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:44,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 10:31:44,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:31:44,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:31:44,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:31:44,542 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 33 states. [2019-09-07 10:31:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:44,605 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2019-09-07 10:31:44,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:31:44,605 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 98 [2019-09-07 10:31:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:44,606 INFO L225 Difference]: With dead ends: 167 [2019-09-07 10:31:44,606 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 10:31:44,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:31:44,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 10:31:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-07 10:31:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-07 10:31:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-09-07 10:31:44,614 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 98 [2019-09-07 10:31:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:44,615 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-09-07 10:31:44,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:31:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-09-07 10:31:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:31:44,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:44,616 INFO L399 BasicCegarLoop]: trace histogram [30, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:44,616 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1098729581, now seen corresponding path program 23 times [2019-09-07 10:31:44,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:44,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:44,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:44,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:44,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 8 proven. 465 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-07 10:31:45,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:45,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:45,270 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:31:49,593 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-07 10:31:49,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:49,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:31:49,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-07 10:31:49,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:49,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 10:31:49,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:31:49,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:31:49,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:31:49,629 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 34 states. [2019-09-07 10:31:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:49,699 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2019-09-07 10:31:49,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:31:49,700 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 99 [2019-09-07 10:31:49,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:49,701 INFO L225 Difference]: With dead ends: 168 [2019-09-07 10:31:49,701 INFO L226 Difference]: Without dead ends: 103 [2019-09-07 10:31:49,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:31:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-07 10:31:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-09-07 10:31:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-07 10:31:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2019-09-07 10:31:49,708 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 99 [2019-09-07 10:31:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:49,708 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2019-09-07 10:31:49,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:31:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2019-09-07 10:31:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 10:31:49,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:49,709 INFO L399 BasicCegarLoop]: trace histogram [31, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:49,710 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash 167311097, now seen corresponding path program 24 times [2019-09-07 10:31:49,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:49,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:49,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 8 proven. 496 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-07 10:31:50,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:50,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:50,195 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:31:52,688 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 10:31:52,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:52,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:31:52,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:52,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:31:52,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:31:52,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:31:52,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:31:52,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-09-07 10:31:52,838 INFO L375 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 19 treesize of output 19 [2019-09-07 10:31:52,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:31:52,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:31:52,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:31:52,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-09-07 10:31:54,905 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_7| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_7| Int) (|v_main_~#src~0.base_BEFORE_CALL_17| Int) (|v_main_~#src~0.offset_BEFORE_CALL_17| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_7|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_7| 16)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_17|) (+ |v_main_~#src~0.offset_BEFORE_CALL_17| 16))) (not (= |v_main_~#src~0.base_BEFORE_CALL_17| |v_main_~#dst~0.base_BEFORE_CALL_7|)))) is different from true [2019-09-07 10:31:57,046 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_18| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_8| Int) (|v_main_~#dst~0.base_BEFORE_CALL_8| Int) (|v_main_~#src~0.offset_BEFORE_CALL_18| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_18| |v_main_~#dst~0.base_BEFORE_CALL_8|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_8|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_8| 16)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_18|) (+ |v_main_~#src~0.offset_BEFORE_CALL_18| 16))))) is different from true [2019-09-07 10:31:59,148 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_9| Int) (|v_main_~#src~0.base_BEFORE_CALL_19| Int) (|v_main_~#dst~0.base_BEFORE_CALL_9| Int) (|v_main_~#src~0.offset_BEFORE_CALL_19| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_19|) (+ |v_main_~#src~0.offset_BEFORE_CALL_19| 16)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_9|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_9| 16))) (not (= |v_main_~#src~0.base_BEFORE_CALL_19| |v_main_~#dst~0.base_BEFORE_CALL_9|)))) is different from true [2019-09-07 10:32:01,224 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_10| Int) (|v_main_~#src~0.offset_BEFORE_CALL_20| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_10| Int) (|v_main_~#src~0.base_BEFORE_CALL_20| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_10|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_10| 16)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_20|) (+ |v_main_~#src~0.offset_BEFORE_CALL_20| 16))) (not (= |v_main_~#src~0.base_BEFORE_CALL_20| |v_main_~#dst~0.base_BEFORE_CALL_10|)))) is different from true [2019-09-07 10:32:01,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-09-07 10:32:01,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:32:01,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:32:01,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:32:01,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2019-09-07 10:32:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 496 trivial. 32 not checked. [2019-09-07 10:32:01,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:01,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 20] total 52 [2019-09-07 10:32:01,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 10:32:01,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 10:32:01,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=1661, Unknown=4, NotChecked=380, Total=2652 [2019-09-07 10:32:01,456 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand 52 states. [2019-09-07 10:32:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:03,654 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2019-09-07 10:32:03,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:32:03,654 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-09-07 10:32:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:03,655 INFO L225 Difference]: With dead ends: 179 [2019-09-07 10:32:03,656 INFO L226 Difference]: Without dead ends: 114 [2019-09-07 10:32:03,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1737, Invalid=4917, Unknown=4, NotChecked=652, Total=7310 [2019-09-07 10:32:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-07 10:32:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-07 10:32:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-07 10:32:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2019-09-07 10:32:03,665 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 100 [2019-09-07 10:32:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:03,666 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2019-09-07 10:32:03,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 10:32:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2019-09-07 10:32:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 10:32:03,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:03,667 INFO L399 BasicCegarLoop]: trace histogram [32, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:03,667 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash -954048691, now seen corresponding path program 25 times [2019-09-07 10:32:03,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:03,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:03,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 10 proven. 528 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-07 10:32:04,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:04,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:04,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:04,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:32:04,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-07 10:32:04,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:04,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 10:32:04,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:32:04,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:32:04,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:32:04,256 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 36 states. [2019-09-07 10:32:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:04,332 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2019-09-07 10:32:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:32:04,332 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 110 [2019-09-07 10:32:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:04,333 INFO L225 Difference]: With dead ends: 188 [2019-09-07 10:32:04,333 INFO L226 Difference]: Without dead ends: 114 [2019-09-07 10:32:04,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:32:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-07 10:32:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-09-07 10:32:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-07 10:32:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2019-09-07 10:32:04,356 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 110 [2019-09-07 10:32:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:04,356 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2019-09-07 10:32:04,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:32:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2019-09-07 10:32:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 10:32:04,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:04,357 INFO L399 BasicCegarLoop]: trace histogram [33, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:04,357 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1733583169, now seen corresponding path program 26 times [2019-09-07 10:32:04,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:04,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:04,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 10 proven. 561 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-07 10:32:04,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:04,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:04,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:32:04,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:32:04,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:04,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:32:04,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-07 10:32:04,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:04,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-07 10:32:04,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:32:04,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:32:04,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:32:04,998 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 37 states. [2019-09-07 10:32:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:05,052 INFO L93 Difference]: Finished difference Result 189 states and 195 transitions. [2019-09-07 10:32:05,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:32:05,053 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 111 [2019-09-07 10:32:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:05,054 INFO L225 Difference]: With dead ends: 189 [2019-09-07 10:32:05,054 INFO L226 Difference]: Without dead ends: 115 [2019-09-07 10:32:05,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:32:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-07 10:32:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-09-07 10:32:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-07 10:32:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2019-09-07 10:32:05,062 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 111 [2019-09-07 10:32:05,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:05,062 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2019-09-07 10:32:05,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:32:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2019-09-07 10:32:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 10:32:05,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:05,063 INFO L399 BasicCegarLoop]: trace histogram [34, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:05,063 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:05,064 INFO L82 PathProgramCache]: Analyzing trace with hash -849175091, now seen corresponding path program 27 times [2019-09-07 10:32:05,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:05,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:05,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:05,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:05,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 10 proven. 595 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-07 10:32:06,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:06,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:06,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:32:06,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 10:32:06,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:06,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:32:06,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:07,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:32:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 110 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2019-09-07 10:32:07,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:07,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 18] total 53 [2019-09-07 10:32:07,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 10:32:07,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 10:32:07,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=2039, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:32:07,614 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 53 states. [2019-09-07 10:32:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:10,500 INFO L93 Difference]: Finished difference Result 274 states and 289 transitions. [2019-09-07 10:32:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:32:10,501 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 112 [2019-09-07 10:32:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:10,506 INFO L225 Difference]: With dead ends: 274 [2019-09-07 10:32:10,506 INFO L226 Difference]: Without dead ends: 151 [2019-09-07 10:32:10,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 88 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2058, Invalid=5952, Unknown=0, NotChecked=0, Total=8010 [2019-09-07 10:32:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-07 10:32:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 119. [2019-09-07 10:32:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-07 10:32:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-09-07 10:32:10,529 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 112 [2019-09-07 10:32:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:10,530 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-09-07 10:32:10,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 10:32:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-09-07 10:32:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 10:32:10,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:10,531 INFO L399 BasicCegarLoop]: trace histogram [35, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:10,531 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:10,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2076482883, now seen corresponding path program 5 times [2019-09-07 10:32:10,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:10,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:10,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:10,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:10,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2019-09-07 10:32:10,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:10,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:32:10,703 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:23,265 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 10:32:23,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:23,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:32:23,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-07 10:32:23,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:23,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 38] total 45 [2019-09-07 10:32:23,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 10:32:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 10:32:23,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=1248, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:32:23,950 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 45 states. [2019-09-07 10:32:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:25,108 INFO L93 Difference]: Finished difference Result 203 states and 212 transitions. [2019-09-07 10:32:25,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 10:32:25,108 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 113 [2019-09-07 10:32:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:25,110 INFO L225 Difference]: With dead ends: 203 [2019-09-07 10:32:25,110 INFO L226 Difference]: Without dead ends: 126 [2019-09-07 10:32:25,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2370, Invalid=5112, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 10:32:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-07 10:32:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2019-09-07 10:32:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-07 10:32:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2019-09-07 10:32:25,118 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 113 [2019-09-07 10:32:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:25,118 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2019-09-07 10:32:25,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 10:32:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2019-09-07 10:32:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 10:32:25,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:25,119 INFO L399 BasicCegarLoop]: trace histogram [36, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:25,120 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1710200718, now seen corresponding path program 28 times [2019-09-07 10:32:25,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:25,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:25,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:25,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:25,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 10 proven. 666 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-07 10:32:25,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:25,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:25,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:32:25,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:32:25,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:25,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 10:32:25,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-07 10:32:25,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:25,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-07 10:32:25,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 10:32:25,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 10:32:25,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:32:25,866 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand 40 states. [2019-09-07 10:32:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:25,928 INFO L93 Difference]: Finished difference Result 198 states and 204 transitions. [2019-09-07 10:32:25,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:32:25,929 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 117 [2019-09-07 10:32:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:25,930 INFO L225 Difference]: With dead ends: 198 [2019-09-07 10:32:25,930 INFO L226 Difference]: Without dead ends: 121 [2019-09-07 10:32:25,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:32:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-07 10:32:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-07 10:32:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-07 10:32:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2019-09-07 10:32:25,938 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 117 [2019-09-07 10:32:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:25,938 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2019-09-07 10:32:25,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 10:32:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2019-09-07 10:32:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-07 10:32:25,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:25,939 INFO L399 BasicCegarLoop]: trace histogram [37, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:25,940 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:25,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:25,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1833515802, now seen corresponding path program 29 times [2019-09-07 10:32:25,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:25,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:25,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:25,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:25,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 10 proven. 703 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-07 10:32:26,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:26,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:32:26,699 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:51,836 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-07 10:32:51,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:51,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:32:51,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-07 10:32:51,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:51,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 10:32:51,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:32:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:32:51,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:32:51,894 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand 41 states. [2019-09-07 10:32:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:51,964 INFO L93 Difference]: Finished difference Result 199 states and 205 transitions. [2019-09-07 10:32:51,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:32:51,964 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2019-09-07 10:32:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:51,965 INFO L225 Difference]: With dead ends: 199 [2019-09-07 10:32:51,965 INFO L226 Difference]: Without dead ends: 122 [2019-09-07 10:32:51,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:32:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-07 10:32:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-09-07 10:32:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-07 10:32:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2019-09-07 10:32:51,976 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 118 [2019-09-07 10:32:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:51,976 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2019-09-07 10:32:51,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:32:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2019-09-07 10:32:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 10:32:51,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:51,978 INFO L399 BasicCegarLoop]: trace histogram [38, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:51,978 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:51,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1361316110, now seen corresponding path program 30 times [2019-09-07 10:32:51,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:51,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:51,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:51,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:51,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 10 proven. 741 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-07 10:32:52,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:52,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:52,665 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:32:56,090 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:32:56,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:56,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 10:32:56,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:56,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:32:56,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:32:56,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:32:56,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:32:56,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-09-07 10:32:56,258 INFO L375 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 19 treesize of output 19 [2019-09-07 10:32:56,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:32:56,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:32:56,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:32:56,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-09-07 10:32:58,339 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.offset_BEFORE_CALL_26| Int) (|v_main_~#dst~0.base_BEFORE_CALL_11| Int) (|v_main_~#src~0.base_BEFORE_CALL_26| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_26|) (+ |v_main_~#src~0.offset_BEFORE_CALL_26| 20)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_11|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_11| 20))) (not (= |v_main_~#src~0.base_BEFORE_CALL_26| |v_main_~#dst~0.base_BEFORE_CALL_11|)))) is different from true [2019-09-07 10:33:00,477 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_12| Int) (|v_main_~#src~0.base_BEFORE_CALL_27| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_12| Int) (|v_main_~#src~0.offset_BEFORE_CALL_27| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_27|) (+ |v_main_~#src~0.offset_BEFORE_CALL_27| 20)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_12|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_12| 20))) (not (= |v_main_~#src~0.base_BEFORE_CALL_27| |v_main_~#dst~0.base_BEFORE_CALL_12|)))) is different from true [2019-09-07 10:33:02,567 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_28| Int) (|v_main_~#dst~0.base_BEFORE_CALL_13| Int) (|v_main_~#src~0.offset_BEFORE_CALL_28| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_13| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_13|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_13| 20)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_28|) (+ |v_main_~#src~0.offset_BEFORE_CALL_28| 20))) (not (= |v_main_~#src~0.base_BEFORE_CALL_28| |v_main_~#dst~0.base_BEFORE_CALL_13|)))) is different from true [2019-09-07 10:33:04,657 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_29| Int) (|v_main_~#src~0.offset_BEFORE_CALL_29| Int) (|v_main_~#dst~0.base_BEFORE_CALL_14| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_14| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_29|) (+ |v_main_~#src~0.offset_BEFORE_CALL_29| 20)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_14|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_14| 20))) (not (= |v_main_~#src~0.base_BEFORE_CALL_29| |v_main_~#dst~0.base_BEFORE_CALL_14|)))) is different from true [2019-09-07 10:33:06,750 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_15| Int) (|v_main_~#src~0.offset_BEFORE_CALL_30| Int) (|v_main_~#dst~0.base_BEFORE_CALL_15| Int) (|v_main_~#src~0.base_BEFORE_CALL_30| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_30| |v_main_~#dst~0.base_BEFORE_CALL_15|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_15|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_15| 20)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_30|) (+ |v_main_~#src~0.offset_BEFORE_CALL_30| 20))))) is different from true [2019-09-07 10:33:08,793 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-07 10:33:10,844 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-07 10:33:10,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-09-07 10:33:10,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:33:10,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:33:10,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:33:10,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2019-09-07 10:33:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 741 trivial. 49 not checked. [2019-09-07 10:33:13,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:13,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 25] total 64 [2019-09-07 10:33:13,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-07 10:33:13,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-07 10:33:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=2558, Unknown=6, NotChecked=590, Total=4032 [2019-09-07 10:33:13,097 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 64 states. [2019-09-07 10:33:17,998 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-07 10:33:24,295 WARN L188 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-09-07 10:33:28,381 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-09-07 10:33:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:30,500 INFO L93 Difference]: Finished difference Result 210 states and 217 transitions. [2019-09-07 10:33:30,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-07 10:33:30,502 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 119 [2019-09-07 10:33:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:30,503 INFO L225 Difference]: With dead ends: 210 [2019-09-07 10:33:30,503 INFO L226 Difference]: Without dead ends: 133 [2019-09-07 10:33:30,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=2544, Invalid=7975, Unknown=7, NotChecked=1030, Total=11556 [2019-09-07 10:33:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-07 10:33:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-09-07 10:33:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-07 10:33:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2019-09-07 10:33:30,514 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 119 [2019-09-07 10:33:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:30,514 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2019-09-07 10:33:30,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-07 10:33:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2019-09-07 10:33:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 10:33:30,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:30,516 INFO L399 BasicCegarLoop]: trace histogram [39, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:30,516 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1937691200, now seen corresponding path program 31 times [2019-09-07 10:33:30,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:30,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:30,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:30,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:30,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 12 proven. 780 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-07 10:33:31,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:31,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:31,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:33:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:31,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 10:33:31,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-07 10:33:31,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:31,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-07 10:33:31,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:33:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:33:31,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:33:31,352 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 43 states. [2019-09-07 10:33:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:31,418 INFO L93 Difference]: Finished difference Result 219 states and 225 transitions. [2019-09-07 10:33:31,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 10:33:31,418 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 129 [2019-09-07 10:33:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:31,419 INFO L225 Difference]: With dead ends: 219 [2019-09-07 10:33:31,422 INFO L226 Difference]: Without dead ends: 133 [2019-09-07 10:33:31,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:33:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-07 10:33:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-09-07 10:33:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-07 10:33:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2019-09-07 10:33:31,435 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 129 [2019-09-07 10:33:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:31,435 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2019-09-07 10:33:31,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:33:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2019-09-07 10:33:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 10:33:31,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:31,436 INFO L399 BasicCegarLoop]: trace histogram [40, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:31,437 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:31,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash 438535116, now seen corresponding path program 32 times [2019-09-07 10:33:31,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:31,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:31,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:31,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:33:31,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 12 proven. 820 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-07 10:33:32,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:32,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:32,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:33:32,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:33:32,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:32,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 10:33:32,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-07 10:33:32,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:32,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-07 10:33:32,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 10:33:32,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 10:33:32,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:33:32,331 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 44 states. [2019-09-07 10:33:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:32,413 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2019-09-07 10:33:32,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 10:33:32,414 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 130 [2019-09-07 10:33:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:32,415 INFO L225 Difference]: With dead ends: 220 [2019-09-07 10:33:32,415 INFO L226 Difference]: Without dead ends: 134 [2019-09-07 10:33:32,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:33:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-07 10:33:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-09-07 10:33:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-07 10:33:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2019-09-07 10:33:32,426 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 130 [2019-09-07 10:33:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:32,427 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2019-09-07 10:33:32,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 10:33:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2019-09-07 10:33:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 10:33:32,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:32,428 INFO L399 BasicCegarLoop]: trace histogram [41, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:32,428 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1209336768, now seen corresponding path program 33 times [2019-09-07 10:33:32,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:32,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:32,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:32,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:32,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 12 proven. 861 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-07 10:33:33,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:33,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:33,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:33:33,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 10:33:33,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:33,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:33:33,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:34,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:33:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 18 proven. 156 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2019-09-07 10:33:34,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:34,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 20] total 62 [2019-09-07 10:33:34,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 10:33:34,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 10:33:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1004, Invalid=2778, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 10:33:34,819 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 62 states. [2019-09-07 10:33:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:38,502 INFO L93 Difference]: Finished difference Result 319 states and 335 transitions. [2019-09-07 10:33:38,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 10:33:38,502 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 131 [2019-09-07 10:33:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:38,503 INFO L225 Difference]: With dead ends: 319 [2019-09-07 10:33:38,504 INFO L226 Difference]: Without dead ends: 175 [2019-09-07 10:33:38,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 103 SyntacticMatches, 11 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2552 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2905, Invalid=8225, Unknown=0, NotChecked=0, Total=11130 [2019-09-07 10:33:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-07 10:33:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 138. [2019-09-07 10:33:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-07 10:33:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2019-09-07 10:33:38,516 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 131 [2019-09-07 10:33:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:38,517 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2019-09-07 10:33:38,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 10:33:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2019-09-07 10:33:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-07 10:33:38,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:38,518 INFO L399 BasicCegarLoop]: trace histogram [42, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:38,518 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:38,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:38,518 INFO L82 PathProgramCache]: Analyzing trace with hash -720008694, now seen corresponding path program 6 times [2019-09-07 10:33:38,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:38,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:38,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:38,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 18 proven. 57 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2019-09-07 10:33:38,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:38,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:38,649 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:33:46,090 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:33:46,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:46,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:33:46,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:46,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:33:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2019-09-07 10:33:46,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:46,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:33:46,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:33:46,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:33:46,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:33:46,151 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand 11 states. [2019-09-07 10:33:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:46,333 INFO L93 Difference]: Finished difference Result 212 states and 219 transitions. [2019-09-07 10:33:46,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:33:46,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2019-09-07 10:33:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:46,335 INFO L225 Difference]: With dead ends: 212 [2019-09-07 10:33:46,336 INFO L226 Difference]: Without dead ends: 144 [2019-09-07 10:33:46,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:33:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-07 10:33:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2019-09-07 10:33:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-07 10:33:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2019-09-07 10:33:46,346 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 132 [2019-09-07 10:33:46,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:46,347 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2019-09-07 10:33:46,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:33:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2019-09-07 10:33:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 10:33:46,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:46,348 INFO L399 BasicCegarLoop]: trace histogram [42, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:46,348 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:46,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:46,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2089852173, now seen corresponding path program 34 times [2019-09-07 10:33:46,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:46,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:46,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:46,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:46,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 12 proven. 903 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-09-07 10:33:47,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:47,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:47,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:33:47,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:33:47,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:47,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:33:47,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-07 10:33:47,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:47,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-07 10:33:47,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 10:33:47,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 10:33:47,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:33:47,276 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 46 states. [2019-09-07 10:33:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:47,371 INFO L93 Difference]: Finished difference Result 228 states and 234 transitions. [2019-09-07 10:33:47,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 10:33:47,371 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 135 [2019-09-07 10:33:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:47,372 INFO L225 Difference]: With dead ends: 228 [2019-09-07 10:33:47,372 INFO L226 Difference]: Without dead ends: 139 [2019-09-07 10:33:47,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:33:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-07 10:33:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-09-07 10:33:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-07 10:33:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2019-09-07 10:33:47,381 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 135 [2019-09-07 10:33:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:47,382 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2019-09-07 10:33:47,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 10:33:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2019-09-07 10:33:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 10:33:47,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:47,383 INFO L399 BasicCegarLoop]: trace histogram [43, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:47,383 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:47,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:47,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1256917607, now seen corresponding path program 35 times [2019-09-07 10:33:47,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:47,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:47,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:47,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:47,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 12 proven. 946 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-09-07 10:33:48,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:48,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:48,203 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:34:41,547 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-07 10:34:41,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:41,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:34:41,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-07 10:34:41,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:41,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-07 10:34:41,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:34:41,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:34:41,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:34:41,618 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 47 states. [2019-09-07 10:34:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:41,712 INFO L93 Difference]: Finished difference Result 229 states and 235 transitions. [2019-09-07 10:34:41,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 10:34:41,712 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2019-09-07 10:34:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:41,713 INFO L225 Difference]: With dead ends: 229 [2019-09-07 10:34:41,713 INFO L226 Difference]: Without dead ends: 140 [2019-09-07 10:34:41,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:34:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-07 10:34:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-09-07 10:34:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-07 10:34:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2019-09-07 10:34:41,728 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 136 [2019-09-07 10:34:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:41,728 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2019-09-07 10:34:41,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:34:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2019-09-07 10:34:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-07 10:34:41,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:41,730 INFO L399 BasicCegarLoop]: trace histogram [44, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:41,730 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1927565683, now seen corresponding path program 36 times [2019-09-07 10:34:41,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:41,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:41,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:41,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:41,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 12 proven. 990 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-09-07 10:34:42,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:42,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:42,603 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:35:06,600 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-07 10:35:06,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:06,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:35:06,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:06,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:35:06,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:06,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:06,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:06,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-09-07 10:35:06,868 INFO L375 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 19 treesize of output 19 [2019-09-07 10:35:06,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:06,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:06,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:06,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-09-07 10:35:08,966 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_37| Int) (|v_main_~#dst~0.base_BEFORE_CALL_16| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_37|) 24) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_16|) 24)) (not (= |v_main_~#src~0.base_BEFORE_CALL_37| |v_main_~#dst~0.base_BEFORE_CALL_16|)))) is different from true [2019-09-07 10:35:11,073 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_38| Int) (|v_main_~#dst~0.base_BEFORE_CALL_17| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_38| |v_main_~#dst~0.base_BEFORE_CALL_17|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_17|) 24) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_38|) 24)))) is different from true [2019-09-07 10:35:13,179 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_39| Int) (|v_main_~#dst~0.base_BEFORE_CALL_18| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_39| |v_main_~#dst~0.base_BEFORE_CALL_18|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_18|) 24) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_39|) 24)))) is different from true [2019-09-07 10:35:15,285 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_19| Int) (|v_main_~#src~0.base_BEFORE_CALL_40| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_40|) 24) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_19|) 24)) (not (= |v_main_~#src~0.base_BEFORE_CALL_40| |v_main_~#dst~0.base_BEFORE_CALL_19|)))) is different from true [2019-09-07 10:35:17,405 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_20| Int) (|v_main_~#src~0.base_BEFORE_CALL_41| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_41|) 24) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_20|) 24)) (not (= |v_main_~#src~0.base_BEFORE_CALL_41| |v_main_~#dst~0.base_BEFORE_CALL_20|)))) is different from true [2019-09-07 10:35:19,536 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_21| Int) (|v_main_~#src~0.base_BEFORE_CALL_42| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_21|) 24) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_42|) 24)) (not (= |v_main_~#src~0.base_BEFORE_CALL_42| |v_main_~#dst~0.base_BEFORE_CALL_21|)))) is different from true [2019-09-07 10:35:21,586 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 10:35:23,669 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-07 10:35:23,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 10:35:23,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:23,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:23,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:23,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:35:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 990 trivial. 71 not checked. [2019-09-07 10:35:25,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:25,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 28] total 73 [2019-09-07 10:35:25,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-07 10:35:25,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-07 10:35:25,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1147, Invalid=3292, Unknown=7, NotChecked=810, Total=5256 [2019-09-07 10:35:25,977 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 73 states. [2019-09-07 10:35:31,255 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-07 10:35:37,525 WARN L188 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-09-07 10:35:41,603 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-09-07 10:35:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:43,708 INFO L93 Difference]: Finished difference Result 240 states and 247 transitions. [2019-09-07 10:35:43,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-07 10:35:43,708 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 137 [2019-09-07 10:35:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:43,710 INFO L225 Difference]: With dead ends: 240 [2019-09-07 10:35:43,710 INFO L226 Difference]: Without dead ends: 151 [2019-09-07 10:35:43,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 121 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2784 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=3335, Invalid=10253, Unknown=8, NotChecked=1410, Total=15006 [2019-09-07 10:35:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-07 10:35:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-09-07 10:35:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-07 10:35:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2019-09-07 10:35:43,720 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 137 [2019-09-07 10:35:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:43,721 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2019-09-07 10:35:43,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-07 10:35:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2019-09-07 10:35:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 10:35:43,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:43,722 INFO L399 BasicCegarLoop]: trace histogram [45, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:43,722 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:43,723 INFO L82 PathProgramCache]: Analyzing trace with hash 776083105, now seen corresponding path program 37 times [2019-09-07 10:35:43,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:43,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:43,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:43,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:43,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 14 proven. 1035 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-07 10:35:44,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:44,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:44,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:35:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:44,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:35:44,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 10:35:44,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:44,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-07 10:35:44,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:35:44,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:35:44,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:35:44,763 INFO L87 Difference]: Start difference. First operand 150 states and 153 transitions. Second operand 49 states. [2019-09-07 10:35:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:44,836 INFO L93 Difference]: Finished difference Result 249 states and 255 transitions. [2019-09-07 10:35:44,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 10:35:44,836 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 147 [2019-09-07 10:35:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:44,837 INFO L225 Difference]: With dead ends: 249 [2019-09-07 10:35:44,837 INFO L226 Difference]: Without dead ends: 151 [2019-09-07 10:35:44,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:35:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-07 10:35:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-09-07 10:35:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-07 10:35:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 154 transitions. [2019-09-07 10:35:44,856 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 154 transitions. Word has length 147 [2019-09-07 10:35:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:44,857 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 154 transitions. [2019-09-07 10:35:44,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:35:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2019-09-07 10:35:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 10:35:44,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:44,858 INFO L399 BasicCegarLoop]: trace histogram [46, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:44,858 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash 984218925, now seen corresponding path program 38 times [2019-09-07 10:35:44,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:44,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:44,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:44,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:35:44,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 14 proven. 1081 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-07 10:35:45,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:45,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:45,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:35:45,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:35:45,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:45,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 10:35:45,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 10:35:45,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:45,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-07 10:35:45,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 10:35:45,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 10:35:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:35:45,980 INFO L87 Difference]: Start difference. First operand 151 states and 154 transitions. Second operand 50 states. [2019-09-07 10:35:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:46,106 INFO L93 Difference]: Finished difference Result 250 states and 256 transitions. [2019-09-07 10:35:46,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:35:46,106 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 148 [2019-09-07 10:35:46,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:46,107 INFO L225 Difference]: With dead ends: 250 [2019-09-07 10:35:46,108 INFO L226 Difference]: Without dead ends: 152 [2019-09-07 10:35:46,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:35:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-07 10:35:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-07 10:35:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 10:35:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2019-09-07 10:35:46,118 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 148 [2019-09-07 10:35:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:46,119 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2019-09-07 10:35:46,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 10:35:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2019-09-07 10:35:46,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 10:35:46,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:46,120 INFO L399 BasicCegarLoop]: trace histogram [47, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:46,120 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:46,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1153505247, now seen corresponding path program 39 times [2019-09-07 10:35:46,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:46,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:46,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:46,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:46,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 14 proven. 1128 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-07 10:35:47,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:47,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:47,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:35:48,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 10:35:48,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:48,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:35:48,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:49,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:35:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 21 proven. 210 refuted. 0 times theorem prover too weak. 1212 trivial. 0 not checked. [2019-09-07 10:35:49,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:49,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 22] total 70 [2019-09-07 10:35:49,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-07 10:35:49,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-07 10:35:49,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=3540, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 10:35:49,457 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 70 states. [2019-09-07 10:35:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:54,196 INFO L93 Difference]: Finished difference Result 363 states and 380 transitions. [2019-09-07 10:35:54,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 10:35:54,196 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 149 [2019-09-07 10:35:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:54,197 INFO L225 Difference]: With dead ends: 363 [2019-09-07 10:35:54,197 INFO L226 Difference]: Without dead ends: 198 [2019-09-07 10:35:54,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3317 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3749, Invalid=10531, Unknown=0, NotChecked=0, Total=14280 [2019-09-07 10:35:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-07 10:35:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 156. [2019-09-07 10:35:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-07 10:35:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2019-09-07 10:35:54,210 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 149 [2019-09-07 10:35:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:54,210 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2019-09-07 10:35:54,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-07 10:35:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2019-09-07 10:35:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-07 10:35:54,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:54,212 INFO L399 BasicCegarLoop]: trace histogram [48, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:54,212 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash -614520401, now seen corresponding path program 7 times [2019-09-07 10:35:54,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:54,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:54,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 21 proven. 77 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2019-09-07 10:35:54,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:54,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:54,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:35:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:54,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:35:54,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 10:35:55,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:55,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 51] total 60 [2019-09-07 10:35:55,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-07 10:35:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-07 10:35:55,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1321, Invalid=2219, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:35:55,561 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 60 states. [2019-09-07 10:35:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:57,349 INFO L93 Difference]: Finished difference Result 264 states and 273 transitions. [2019-09-07 10:35:57,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 10:35:57,349 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 150 [2019-09-07 10:35:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:57,351 INFO L225 Difference]: With dead ends: 264 [2019-09-07 10:35:57,351 INFO L226 Difference]: Without dead ends: 163 [2019-09-07 10:35:57,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4300, Invalid=9272, Unknown=0, NotChecked=0, Total=13572 [2019-09-07 10:35:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-07 10:35:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2019-09-07 10:35:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-07 10:35:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2019-09-07 10:35:57,363 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 150 [2019-09-07 10:35:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:57,363 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2019-09-07 10:35:57,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-07 10:35:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2019-09-07 10:35:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 10:35:57,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:57,364 INFO L399 BasicCegarLoop]: trace histogram [49, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:57,365 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2046002042, now seen corresponding path program 40 times [2019-09-07 10:35:57,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:57,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:57,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:57,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:35:57,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 14 proven. 1225 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-07 10:35:58,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:58,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:35:58,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:35:58,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:58,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 10:35:58,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-09-07 10:35:58,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:58,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-07 10:35:58,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 10:35:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 10:35:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:35:58,910 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 53 states. [2019-09-07 10:35:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:59,027 INFO L93 Difference]: Finished difference Result 259 states and 265 transitions. [2019-09-07 10:35:59,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:35:59,028 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 154 [2019-09-07 10:35:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:59,031 INFO L225 Difference]: With dead ends: 259 [2019-09-07 10:35:59,031 INFO L226 Difference]: Without dead ends: 158 [2019-09-07 10:35:59,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:35:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-07 10:35:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-09-07 10:35:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-07 10:35:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2019-09-07 10:35:59,045 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 154 [2019-09-07 10:35:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:59,045 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2019-09-07 10:35:59,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 10:35:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2019-09-07 10:35:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 10:35:59,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:59,047 INFO L399 BasicCegarLoop]: trace histogram [50, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:59,047 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:59,047 INFO L82 PathProgramCache]: Analyzing trace with hash 421619566, now seen corresponding path program 41 times [2019-09-07 10:35:59,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:59,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:59,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:59,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:59,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 14 proven. 1275 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-07 10:36:00,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:00,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:36:00,146 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:37:05,884 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-07 10:37:05,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:37:05,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 10:37:05,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:37:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-09-07 10:37:05,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:37:05,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-07 10:37:05,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 10:37:05,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 10:37:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:37:05,961 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 54 states. [2019-09-07 10:37:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:37:06,072 INFO L93 Difference]: Finished difference Result 260 states and 266 transitions. [2019-09-07 10:37:06,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 10:37:06,073 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 155 [2019-09-07 10:37:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:37:06,074 INFO L225 Difference]: With dead ends: 260 [2019-09-07 10:37:06,074 INFO L226 Difference]: Without dead ends: 159 [2019-09-07 10:37:06,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:37:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-07 10:37:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-09-07 10:37:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-07 10:37:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 162 transitions. [2019-09-07 10:37:06,083 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 162 transitions. Word has length 155 [2019-09-07 10:37:06,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:37:06,084 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 162 transitions. [2019-09-07 10:37:06,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 10:37:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2019-09-07 10:37:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 10:37:06,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:37:06,085 INFO L399 BasicCegarLoop]: trace histogram [51, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:37:06,085 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:37:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:37:06,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1605370362, now seen corresponding path program 42 times [2019-09-07 10:37:06,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:37:06,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:37:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:06,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:37:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:37:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 14 proven. 1326 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-07 10:37:07,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:37:07,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:37:07,321 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:37:49,226 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-07 10:37:49,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:37:49,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:37:49,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:37:49,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:37:49,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:37:49,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:37:49,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:37:49,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-09-07 10:37:49,494 INFO L375 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 19 treesize of output 19 [2019-09-07 10:37:49,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:37:49,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:37:49,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:37:49,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-09-07 10:37:51,593 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_22| Int) (|v_main_~#src~0.offset_BEFORE_CALL_50| Int) (|v_main_~#src~0.base_BEFORE_CALL_50| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_22| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_50| |v_main_~#dst~0.base_BEFORE_CALL_22|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_22|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_22| 28)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_50|) (+ |v_main_~#src~0.offset_BEFORE_CALL_50| 28))))) is different from true [2019-09-07 10:37:53,713 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_23| Int) (|v_main_~#src~0.offset_BEFORE_CALL_51| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_23| Int) (|v_main_~#src~0.base_BEFORE_CALL_51| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_51| |v_main_~#dst~0.base_BEFORE_CALL_23|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_23|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_23| 28)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_51|) (+ |v_main_~#src~0.offset_BEFORE_CALL_51| 28))))) is different from true [2019-09-07 10:37:55,817 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.offset_BEFORE_CALL_52| Int) (|v_main_~#dst~0.base_BEFORE_CALL_24| Int) (|v_main_~#src~0.base_BEFORE_CALL_52| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_24| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_52| |v_main_~#dst~0.base_BEFORE_CALL_24|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_24|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_24| 28)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_52|) (+ |v_main_~#src~0.offset_BEFORE_CALL_52| 28))))) is different from true [2019-09-07 10:37:57,930 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.offset_BEFORE_CALL_53| Int) (|v_main_~#dst~0.base_BEFORE_CALL_25| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_25| Int) (|v_main_~#src~0.base_BEFORE_CALL_53| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_53|) (+ |v_main_~#src~0.offset_BEFORE_CALL_53| 28)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_25|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_25| 28))) (not (= |v_main_~#src~0.base_BEFORE_CALL_53| |v_main_~#dst~0.base_BEFORE_CALL_25|)))) is different from true [2019-09-07 10:38:00,042 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_26| Int) (|v_main_~#src~0.offset_BEFORE_CALL_54| Int) (|v_main_~#src~0.base_BEFORE_CALL_54| Int) (|v_main_~#dst~0.base_BEFORE_CALL_26| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_54| |v_main_~#dst~0.base_BEFORE_CALL_26|)) (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_54|) (+ |v_main_~#src~0.offset_BEFORE_CALL_54| 28)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_26|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_26| 28))))) is different from true [2019-09-07 10:38:02,159 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_27| Int) (|v_main_~#src~0.offset_BEFORE_CALL_55| Int) (|v_main_~#src~0.base_BEFORE_CALL_55| Int) (|v_main_~#dst~0.base_BEFORE_CALL_27| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_55| |v_main_~#dst~0.base_BEFORE_CALL_27|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_27|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_27| 28)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_55|) (+ |v_main_~#src~0.offset_BEFORE_CALL_55| 28))))) is different from true [2019-09-07 10:38:04,286 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.offset_BEFORE_CALL_56| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_28| Int) (|v_main_~#dst~0.base_BEFORE_CALL_28| Int) (|v_main_~#src~0.base_BEFORE_CALL_56| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_56|) (+ |v_main_~#src~0.offset_BEFORE_CALL_56| 28)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_28|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_28| 28))) (not (= |v_main_~#src~0.base_BEFORE_CALL_56| |v_main_~#dst~0.base_BEFORE_CALL_28|)))) is different from true [2019-09-07 10:38:06,342 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-07 10:38:08,403 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-07 10:38:08,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-09-07 10:38:08,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:38:08,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:38:08,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:38:08,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2019-09-07 10:38:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 1326 trivial. 97 not checked. [2019-09-07 10:38:10,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:10,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 31] total 83 [2019-09-07 10:38:10,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-07 10:38:10,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-07 10:38:10,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1505, Invalid=4215, Unknown=8, NotChecked=1078, Total=6806 [2019-09-07 10:38:10,723 INFO L87 Difference]: Start difference. First operand 159 states and 162 transitions. Second operand 83 states. [2019-09-07 10:38:16,798 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-07 10:38:23,133 WARN L188 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-09-07 10:38:27,227 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-09-07 10:38:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:29,358 INFO L93 Difference]: Finished difference Result 271 states and 278 transitions. [2019-09-07 10:38:29,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-07 10:38:29,359 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 156 [2019-09-07 10:38:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:29,361 INFO L225 Difference]: With dead ends: 271 [2019-09-07 10:38:29,361 INFO L226 Difference]: Without dead ends: 170 [2019-09-07 10:38:29,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 121 SyntacticMatches, 7 SemanticMatches, 138 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3614 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=4393, Invalid=13182, Unknown=9, NotChecked=1876, Total=19460 [2019-09-07 10:38:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-07 10:38:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-07 10:38:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-07 10:38:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 172 transitions. [2019-09-07 10:38:29,374 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 172 transitions. Word has length 156 [2019-09-07 10:38:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:29,374 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 172 transitions. [2019-09-07 10:38:29,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-07 10:38:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2019-09-07 10:38:29,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-07 10:38:29,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:29,375 INFO L399 BasicCegarLoop]: trace histogram [52, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:29,376 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:29,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:29,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1875710316, now seen corresponding path program 43 times [2019-09-07 10:38:29,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:29,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:29,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:29,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:38:29,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 16 proven. 1378 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-07 10:38:30,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:30,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:30,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:38:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:30,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:38:30,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-07 10:38:30,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:30,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-07 10:38:30,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 10:38:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 10:38:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:38:30,810 INFO L87 Difference]: Start difference. First operand 169 states and 172 transitions. Second operand 56 states. [2019-09-07 10:38:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:30,929 INFO L93 Difference]: Finished difference Result 280 states and 286 transitions. [2019-09-07 10:38:30,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 10:38:30,930 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 166 [2019-09-07 10:38:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:30,931 INFO L225 Difference]: With dead ends: 280 [2019-09-07 10:38:30,931 INFO L226 Difference]: Without dead ends: 170 [2019-09-07 10:38:30,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:38:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-07 10:38:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-09-07 10:38:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-07 10:38:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 173 transitions. [2019-09-07 10:38:30,942 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 173 transitions. Word has length 166 [2019-09-07 10:38:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:30,942 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 173 transitions. [2019-09-07 10:38:30,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 10:38:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 173 transitions. [2019-09-07 10:38:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-07 10:38:30,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:30,944 INFO L399 BasicCegarLoop]: trace histogram [53, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:30,944 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:30,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash 924886880, now seen corresponding path program 44 times [2019-09-07 10:38:30,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:30,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:30,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:30,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:38:30,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1839 backedges. 16 proven. 1431 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-07 10:38:32,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:32,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:32,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:38:32,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:38:32,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:38:32,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 10:38:32,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1839 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-07 10:38:32,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-07 10:38:32,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 10:38:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 10:38:32,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:38:32,428 INFO L87 Difference]: Start difference. First operand 170 states and 173 transitions. Second operand 57 states. [2019-09-07 10:38:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:32,563 INFO L93 Difference]: Finished difference Result 281 states and 287 transitions. [2019-09-07 10:38:32,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 10:38:32,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 167 [2019-09-07 10:38:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:32,565 INFO L225 Difference]: With dead ends: 281 [2019-09-07 10:38:32,566 INFO L226 Difference]: Without dead ends: 171 [2019-09-07 10:38:32,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:38:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-07 10:38:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-09-07 10:38:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-07 10:38:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 174 transitions. [2019-09-07 10:38:32,590 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 174 transitions. Word has length 167 [2019-09-07 10:38:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:32,590 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 174 transitions. [2019-09-07 10:38:32,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 10:38:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2019-09-07 10:38:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-07 10:38:32,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:32,595 INFO L399 BasicCegarLoop]: trace histogram [54, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:32,595 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:32,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:32,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1514131436, now seen corresponding path program 45 times [2019-09-07 10:38:32,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:32,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:32,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:32,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:38:32,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 16 proven. 1485 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-07 10:38:34,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:34,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:34,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:38:35,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:38:35,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:38:35,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:38:35,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:36,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:38:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 24 proven. 272 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2019-09-07 10:38:36,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:36,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 24] total 79 [2019-09-07 10:38:36,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-07 10:38:36,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-07 10:38:36,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1668, Invalid=4494, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 10:38:36,850 INFO L87 Difference]: Start difference. First operand 171 states and 174 transitions. Second operand 79 states. [2019-09-07 10:38:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:46,152 INFO L93 Difference]: Finished difference Result 369 states and 379 transitions. [2019-09-07 10:38:46,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-07 10:38:46,152 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 168 [2019-09-07 10:38:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:46,153 INFO L225 Difference]: With dead ends: 369 [2019-09-07 10:38:46,153 INFO L226 Difference]: Without dead ends: 183 [2019-09-07 10:38:46,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 132 SyntacticMatches, 15 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4284 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4869, Invalid=13491, Unknown=0, NotChecked=0, Total=18360 [2019-09-07 10:38:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-07 10:38:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 175. [2019-09-07 10:38:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-07 10:38:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2019-09-07 10:38:46,170 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 179 transitions. Word has length 168 [2019-09-07 10:38:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:46,171 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 179 transitions. [2019-09-07 10:38:46,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-07 10:38:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2019-09-07 10:38:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-07 10:38:46,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:46,172 INFO L399 BasicCegarLoop]: trace histogram [55, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:46,172 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:46,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:46,173 INFO L82 PathProgramCache]: Analyzing trace with hash -127365858, now seen corresponding path program 8 times [2019-09-07 10:38:46,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:46,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:46,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:46,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:38:46,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1948 backedges. 24 proven. 100 refuted. 0 times theorem prover too weak. 1824 trivial. 0 not checked. [2019-09-07 10:38:46,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:46,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:46,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:38:46,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:38:46,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:38:46,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 10:38:46,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1948 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-07 10:38:47,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:47,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 58] total 68 [2019-09-07 10:38:47,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-07 10:38:47,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-07 10:38:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2847, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 10:38:47,906 INFO L87 Difference]: Start difference. First operand 175 states and 179 transitions. Second operand 68 states. [2019-09-07 10:38:50,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:50,018 INFO L93 Difference]: Finished difference Result 295 states and 304 transitions. [2019-09-07 10:38:50,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 10:38:50,019 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 169 [2019-09-07 10:38:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:50,020 INFO L225 Difference]: With dead ends: 295 [2019-09-07 10:38:50,020 INFO L226 Difference]: Without dead ends: 182 [2019-09-07 10:38:50,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2536 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5569, Invalid=11987, Unknown=0, NotChecked=0, Total=17556 [2019-09-07 10:38:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-07 10:38:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2019-09-07 10:38:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-07 10:38:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 179 transitions. [2019-09-07 10:38:50,032 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 179 transitions. Word has length 169 [2019-09-07 10:38:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:50,033 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 179 transitions. [2019-09-07 10:38:50,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-07 10:38:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 179 transitions. [2019-09-07 10:38:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-07 10:38:50,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:50,034 INFO L399 BasicCegarLoop]: trace histogram [56, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:50,034 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:50,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:50,034 INFO L82 PathProgramCache]: Analyzing trace with hash -774096083, now seen corresponding path program 46 times [2019-09-07 10:38:50,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:50,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:50,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:50,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:38:50,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2031 backedges. 16 proven. 1596 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-09-07 10:38:51,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:51,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:51,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:38:51,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:38:51,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:38:51,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 10:38:51,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2031 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-07 10:38:51,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:51,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-09-07 10:38:51,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-07 10:38:51,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-07 10:38:51,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:38:51,494 INFO L87 Difference]: Start difference. First operand 176 states and 179 transitions. Second operand 60 states. [2019-09-07 10:38:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:51,601 INFO L93 Difference]: Finished difference Result 290 states and 296 transitions. [2019-09-07 10:38:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 10:38:51,601 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 173 [2019-09-07 10:38:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:51,602 INFO L225 Difference]: With dead ends: 290 [2019-09-07 10:38:51,602 INFO L226 Difference]: Without dead ends: 177 [2019-09-07 10:38:51,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:38:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-07 10:38:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-09-07 10:38:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-07 10:38:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 180 transitions. [2019-09-07 10:38:51,613 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 180 transitions. Word has length 173 [2019-09-07 10:38:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:51,614 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 180 transitions. [2019-09-07 10:38:51,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-07 10:38:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 180 transitions. [2019-09-07 10:38:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-07 10:38:51,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:51,615 INFO L399 BasicCegarLoop]: trace histogram [57, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:51,615 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash -924464455, now seen corresponding path program 47 times [2019-09-07 10:38:51,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:51,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:51,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:38:51,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 16 proven. 1653 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-09-07 10:38:52,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:52,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:52,958 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:40:25,861 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-07 10:40:25,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:40:25,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 10:40:25,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:40:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-07 10:40:25,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:40:25,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-09-07 10:40:25,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 10:40:25,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 10:40:25,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:40:25,950 INFO L87 Difference]: Start difference. First operand 177 states and 180 transitions. Second operand 61 states. [2019-09-07 10:40:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:40:26,047 INFO L93 Difference]: Finished difference Result 291 states and 297 transitions. [2019-09-07 10:40:26,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 10:40:26,048 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 174 [2019-09-07 10:40:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:40:26,049 INFO L225 Difference]: With dead ends: 291 [2019-09-07 10:40:26,049 INFO L226 Difference]: Without dead ends: 178 [2019-09-07 10:40:26,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:40:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-07 10:40:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-09-07 10:40:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-07 10:40:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 181 transitions. [2019-09-07 10:40:26,060 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 181 transitions. Word has length 174 [2019-09-07 10:40:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:40:26,060 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 181 transitions. [2019-09-07 10:40:26,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 10:40:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 181 transitions. [2019-09-07 10:40:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-07 10:40:26,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:40:26,062 INFO L399 BasicCegarLoop]: trace histogram [58, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:40:26,062 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:40:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:40:26,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1290916691, now seen corresponding path program 48 times [2019-09-07 10:40:26,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:40:26,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:40:26,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:40:26,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:40:26,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:40:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:40:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 16 proven. 1711 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-09-07 10:40:27,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:40:27,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:40:27,427 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:41:24,479 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:41:24,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:41:24,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-07 10:41:24,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:24,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:41:24,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:41:24,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:41:24,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:41:24,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-09-07 10:41:24,886 INFO L375 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 19 treesize of output 19 [2019-09-07 10:41:24,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:41:24,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:41:24,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:41:24,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-09-07 10:41:27,013 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_65| Int) (|v_main_~#dst~0.base_BEFORE_CALL_29| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_29|) 32) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_65|) 32)) (not (= |v_main_~#src~0.base_BEFORE_CALL_65| |v_main_~#dst~0.base_BEFORE_CALL_29|)))) is different from true [2019-09-07 10:41:29,165 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_30| Int) (|v_main_~#src~0.base_BEFORE_CALL_66| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_66|) 32) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_30|) 32)) (not (= |v_main_~#src~0.base_BEFORE_CALL_66| |v_main_~#dst~0.base_BEFORE_CALL_30|)))) is different from true [2019-09-07 10:41:31,291 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_31| Int) (|v_main_~#src~0.base_BEFORE_CALL_67| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_67|) 32) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_31|) 32)) (not (= |v_main_~#src~0.base_BEFORE_CALL_67| |v_main_~#dst~0.base_BEFORE_CALL_31|)))) is different from true [2019-09-07 10:41:33,413 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_32| Int) (|v_main_~#src~0.base_BEFORE_CALL_68| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_68|) 32) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_32|) 32)) (not (= |v_main_~#src~0.base_BEFORE_CALL_68| |v_main_~#dst~0.base_BEFORE_CALL_32|)))) is different from true [2019-09-07 10:41:35,542 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_33| Int) (|v_main_~#src~0.base_BEFORE_CALL_69| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_69|) 32) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_33|) 32)) (not (= |v_main_~#src~0.base_BEFORE_CALL_69| |v_main_~#dst~0.base_BEFORE_CALL_33|)))) is different from true [2019-09-07 10:41:37,668 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_70| Int) (|v_main_~#dst~0.base_BEFORE_CALL_34| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_34|) 32) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_70|) 32)) (not (= |v_main_~#src~0.base_BEFORE_CALL_70| |v_main_~#dst~0.base_BEFORE_CALL_34|)))) is different from true [2019-09-07 10:41:39,799 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_71| Int) (|v_main_~#dst~0.base_BEFORE_CALL_35| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_71| |v_main_~#dst~0.base_BEFORE_CALL_35|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_35|) 32) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_71|) 32)))) is different from true [2019-09-07 10:41:41,933 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_72| Int) (|v_main_~#dst~0.base_BEFORE_CALL_36| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_36|) 32) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_72|) 32)) (not (= |v_main_~#src~0.base_BEFORE_CALL_72| |v_main_~#dst~0.base_BEFORE_CALL_36|)))) is different from true [2019-09-07 10:41:43,993 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 10:41:46,056 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-07 10:41:46,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 10:41:46,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:41:46,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:41:46,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:41:46,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:41:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 1711 trivial. 127 not checked. [2019-09-07 10:41:48,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:48,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 34] total 93 [2019-09-07 10:41:48,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-07 10:41:48,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-07 10:41:48,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1912, Invalid=5251, Unknown=9, NotChecked=1384, Total=8556 [2019-09-07 10:41:48,457 INFO L87 Difference]: Start difference. First operand 178 states and 181 transitions. Second operand 93 states. [2019-09-07 10:41:56,947 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-07 10:42:03,400 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-09-07 10:42:07,516 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-09-07 10:42:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:09,713 INFO L93 Difference]: Finished difference Result 302 states and 309 transitions. [2019-09-07 10:42:09,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-07 10:42:09,714 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 175 [2019-09-07 10:42:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:09,715 INFO L225 Difference]: With dead ends: 302 [2019-09-07 10:42:09,715 INFO L226 Difference]: Without dead ends: 189 [2019-09-07 10:42:09,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 136 SyntacticMatches, 8 SemanticMatches, 155 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 4551 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=5598, Invalid=16476, Unknown=10, NotChecked=2408, Total=24492 [2019-09-07 10:42:09,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-07 10:42:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-07 10:42:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-07 10:42:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 191 transitions. [2019-09-07 10:42:09,729 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 191 transitions. Word has length 175 [2019-09-07 10:42:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:09,729 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 191 transitions. [2019-09-07 10:42:09,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-07 10:42:09,730 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 191 transitions. [2019-09-07 10:42:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-07 10:42:09,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:09,731 INFO L399 BasicCegarLoop]: trace histogram [59, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:09,731 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:09,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash -565320319, now seen corresponding path program 49 times [2019-09-07 10:42:09,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:09,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:09,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 18 proven. 1770 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-07 10:42:11,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:11,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:11,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:11,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-07 10:42:11,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-07 10:42:11,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:11,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-09-07 10:42:11,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 10:42:11,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 10:42:11,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:42:11,325 INFO L87 Difference]: Start difference. First operand 188 states and 191 transitions. Second operand 63 states. [2019-09-07 10:42:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:11,442 INFO L93 Difference]: Finished difference Result 311 states and 317 transitions. [2019-09-07 10:42:11,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 10:42:11,442 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 185 [2019-09-07 10:42:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:11,443 INFO L225 Difference]: With dead ends: 311 [2019-09-07 10:42:11,443 INFO L226 Difference]: Without dead ends: 189 [2019-09-07 10:42:11,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:42:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-07 10:42:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-09-07 10:42:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-07 10:42:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 192 transitions. [2019-09-07 10:42:11,461 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 192 transitions. Word has length 185 [2019-09-07 10:42:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:11,461 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 192 transitions. [2019-09-07 10:42:11,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 10:42:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 192 transitions. [2019-09-07 10:42:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-07 10:42:11,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:11,463 INFO L399 BasicCegarLoop]: trace histogram [60, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:11,463 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash 807437069, now seen corresponding path program 50 times [2019-09-07 10:42:11,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:11,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:11,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:11,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2343 backedges. 18 proven. 1830 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-07 10:42:12,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:12,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:42:13,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:42:13,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:13,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-07 10:42:13,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2343 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-07 10:42:13,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:13,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-09-07 10:42:13,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-07 10:42:13,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-07 10:42:13,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 10:42:13,069 INFO L87 Difference]: Start difference. First operand 189 states and 192 transitions. Second operand 64 states. [2019-09-07 10:42:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:13,204 INFO L93 Difference]: Finished difference Result 312 states and 318 transitions. [2019-09-07 10:42:13,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 10:42:13,204 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 186 [2019-09-07 10:42:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:13,205 INFO L225 Difference]: With dead ends: 312 [2019-09-07 10:42:13,205 INFO L226 Difference]: Without dead ends: 190 [2019-09-07 10:42:13,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 10:42:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-07 10:42:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-09-07 10:42:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-07 10:42:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 193 transitions. [2019-09-07 10:42:13,218 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 193 transitions. Word has length 186 [2019-09-07 10:42:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:13,218 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 193 transitions. [2019-09-07 10:42:13,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-07 10:42:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 193 transitions. [2019-09-07 10:42:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 10:42:13,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:13,219 INFO L399 BasicCegarLoop]: trace histogram [61, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:13,220 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash 413243137, now seen corresponding path program 51 times [2019-09-07 10:42:13,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:13,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:13,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:13,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:13,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2404 backedges. 18 proven. 1891 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-07 10:42:14,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:14,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:14,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:42:17,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 10:42:17,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:17,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 10:42:17,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:19,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2404 backedges. 27 proven. 342 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2019-09-07 10:42:19,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:19,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 26] total 88 [2019-09-07 10:42:19,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-07 10:42:19,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-07 10:42:19,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2095, Invalid=5561, Unknown=0, NotChecked=0, Total=7656 [2019-09-07 10:42:19,195 INFO L87 Difference]: Start difference. First operand 190 states and 193 transitions. Second operand 88 states. [2019-09-07 10:42:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:24,721 INFO L93 Difference]: Finished difference Result 453 states and 472 transitions. [2019-09-07 10:42:24,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-07 10:42:24,721 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 187 [2019-09-07 10:42:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:24,722 INFO L225 Difference]: With dead ends: 453 [2019-09-07 10:42:24,722 INFO L226 Difference]: Without dead ends: 246 [2019-09-07 10:42:24,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 147 SyntacticMatches, 17 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5374 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6136, Invalid=16816, Unknown=0, NotChecked=0, Total=22952 [2019-09-07 10:42:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-07 10:42:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 194. [2019-09-07 10:42:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-07 10:42:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 198 transitions. [2019-09-07 10:42:24,737 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 198 transitions. Word has length 187 [2019-09-07 10:42:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:24,737 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 198 transitions. [2019-09-07 10:42:24,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-07 10:42:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2019-09-07 10:42:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 10:42:24,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:24,738 INFO L399 BasicCegarLoop]: trace histogram [62, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:24,739 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:24,739 INFO L82 PathProgramCache]: Analyzing trace with hash -862448881, now seen corresponding path program 9 times [2019-09-07 10:42:24,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:24,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:24,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 27 proven. 126 refuted. 0 times theorem prover too weak. 2313 trivial. 0 not checked. [2019-09-07 10:42:24,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:24,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:24,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:42:27,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 10:42:27,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:27,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:42:27,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 2331 trivial. 0 not checked. [2019-09-07 10:42:27,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:27,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:42:27,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:42:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:42:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:42:27,118 INFO L87 Difference]: Start difference. First operand 194 states and 198 transitions. Second operand 14 states. [2019-09-07 10:42:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:27,387 INFO L93 Difference]: Finished difference Result 295 states and 302 transitions. [2019-09-07 10:42:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:42:27,388 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2019-09-07 10:42:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:27,389 INFO L225 Difference]: With dead ends: 295 [2019-09-07 10:42:27,389 INFO L226 Difference]: Without dead ends: 200 [2019-09-07 10:42:27,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:42:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-07 10:42:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2019-09-07 10:42:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-07 10:42:27,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 197 transitions. [2019-09-07 10:42:27,401 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 197 transitions. Word has length 188 [2019-09-07 10:42:27,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:27,401 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 197 transitions. [2019-09-07 10:42:27,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:42:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 197 transitions. [2019-09-07 10:42:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-07 10:42:27,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:27,403 INFO L399 BasicCegarLoop]: trace histogram [62, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:27,403 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:27,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:27,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1375718862, now seen corresponding path program 52 times [2019-09-07 10:42:27,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:27,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:27,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2496 backedges. 18 proven. 1953 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-09-07 10:42:28,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:28,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:28,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:42:29,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:42:29,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:29,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-07 10:42:29,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2496 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2019-09-07 10:42:29,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:29,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-09-07 10:42:29,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-07 10:42:29,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-07 10:42:29,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 10:42:29,367 INFO L87 Difference]: Start difference. First operand 194 states and 197 transitions. Second operand 66 states. [2019-09-07 10:42:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:29,501 INFO L93 Difference]: Finished difference Result 320 states and 326 transitions. [2019-09-07 10:42:29,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-07 10:42:29,502 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 191 [2019-09-07 10:42:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:29,503 INFO L225 Difference]: With dead ends: 320 [2019-09-07 10:42:29,503 INFO L226 Difference]: Without dead ends: 195 [2019-09-07 10:42:29,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 10:42:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-07 10:42:29,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-09-07 10:42:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-07 10:42:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 198 transitions. [2019-09-07 10:42:29,515 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 198 transitions. Word has length 191 [2019-09-07 10:42:29,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:29,516 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 198 transitions. [2019-09-07 10:42:29,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-07 10:42:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 198 transitions. [2019-09-07 10:42:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 10:42:29,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:29,517 INFO L399 BasicCegarLoop]: trace histogram [63, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:29,517 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:29,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:29,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1634659750, now seen corresponding path program 53 times [2019-09-07 10:42:29,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:29,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:29,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 18 proven. 2016 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-09-07 10:42:31,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:31,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:31,436 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1