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_strcmp_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:28:05,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:28:05,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:28:05,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:28:05,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:28:05,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:28:05,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:28:05,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:28:05,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:28:05,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:28:05,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:28:05,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:28:05,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:28:05,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:28:05,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:28:05,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:28:05,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:28:05,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:28:05,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:28:05,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:28:05,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:28:05,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:28:05,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:28:05,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:28:05,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:28:05,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:28:05,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:28:05,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:28:05,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:28:05,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:28:05,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:28:05,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:28:05,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:28:05,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:28:05,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:28:05,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:28:05,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:28:05,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:28:05,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:28:05,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:28:05,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:28:05,431 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:28:05,445 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:28:05,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:28:05,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:28:05,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:28:05,447 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:28:05,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:28:05,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:28:05,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:28:05,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:28:05,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:28:05,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:28:05,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:28:05,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:28:05,449 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:28:05,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:28:05,450 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:28:05,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:28:05,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:28:05,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:28:05,450 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:28:05,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:28:05,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:28:05,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:28:05,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:28:05,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:28:05,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:28:05,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:28:05,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:28:05,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:28:05,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:28:05,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:28:05,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:28:05,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:28:05,501 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:28:05,502 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcmp_ground.i [2019-09-07 10:28:05,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/522dd34a6/22c26c0b0c1e4e5ebca7d5cfba91962a/FLAG9143bded2 [2019-09-07 10:28:06,038 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:28:06,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcmp_ground.i [2019-09-07 10:28:06,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/522dd34a6/22c26c0b0c1e4e5ebca7d5cfba91962a/FLAG9143bded2 [2019-09-07 10:28:06,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/522dd34a6/22c26c0b0c1e4e5ebca7d5cfba91962a [2019-09-07 10:28:06,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:28:06,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:28:06,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:28:06,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:28:06,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:28:06,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:28:06" (1/1) ... [2019-09-07 10:28:06,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cceac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06, skipping insertion in model container [2019-09-07 10:28:06,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:28:06" (1/1) ... [2019-09-07 10:28:06,422 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:28:06,439 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:28:06,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:28:06,638 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:28:06,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:28:06,678 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:28:06,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06 WrapperNode [2019-09-07 10:28:06,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:28:06,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:28:06,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:28:06,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:28:06,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06" (1/1) ... [2019-09-07 10:28:06,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06" (1/1) ... [2019-09-07 10:28:06,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06" (1/1) ... [2019-09-07 10:28:06,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06" (1/1) ... [2019-09-07 10:28:06,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06" (1/1) ... [2019-09-07 10:28:06,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06" (1/1) ... [2019-09-07 10:28:06,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06" (1/1) ... [2019-09-07 10:28:06,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:28:06,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:28:06,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:28:06,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:28:06,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06" (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:28:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:28:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:28:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:28:06,881 INFO L138 BoogieDeclarations]: Found implementation of procedure _strcmp [2019-09-07 10:28:06,881 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:28:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:28:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:28:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:28:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure _strcmp [2019-09-07 10:28:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:28:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:28:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:28:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:28:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:28:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:28:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:28:07,112 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:28:07,113 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:28:07,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:28:07 BoogieIcfgContainer [2019-09-07 10:28:07,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:28:07,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:28:07,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:28:07,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:28:07,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:28:06" (1/3) ... [2019-09-07 10:28:07,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab13426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:28:07, skipping insertion in model container [2019-09-07 10:28:07,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:28:06" (2/3) ... [2019-09-07 10:28:07,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab13426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:28:07, skipping insertion in model container [2019-09-07 10:28:07,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:28:07" (3/3) ... [2019-09-07 10:28:07,122 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcmp_ground.i [2019-09-07 10:28:07,133 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:28:07,141 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:28:07,176 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:28:07,222 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:28:07,223 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:28:07,224 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:28:07,224 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:28:07,224 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:28:07,224 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:28:07,225 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:28:07,225 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:28:07,225 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:28:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-07 10:28:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 10:28:07,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:07,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:07,259 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:07,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash 893293776, now seen corresponding path program 1 times [2019-09-07 10:28:07,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:07,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:07,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:07,408 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:28:07,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:28:07,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:28:07,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:28:07,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:28:07,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:28:07,428 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-09-07 10:28:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:07,451 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2019-09-07 10:28:07,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:28:07,452 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-09-07 10:28:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:07,459 INFO L225 Difference]: With dead ends: 56 [2019-09-07 10:28:07,460 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 10:28:07,463 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:28:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 10:28:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-07 10:28:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 10:28:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-07 10:28:07,499 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2019-09-07 10:28:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:07,499 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-07 10:28:07,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:28:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-07 10:28:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 10:28:07,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:07,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:07,502 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:07,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:07,502 INFO L82 PathProgramCache]: Analyzing trace with hash -368321770, now seen corresponding path program 1 times [2019-09-07 10:28:07,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:07,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:07,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:07,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:07,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:07,571 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:28:07,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:28:07,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:28:07,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:28:07,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:28:07,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:28:07,575 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2019-09-07 10:28:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:07,631 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-09-07 10:28:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:28:07,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 10:28:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:07,633 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:28:07,633 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 10:28:07,634 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:28:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 10:28:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-07 10:28:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:28:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-07 10:28:07,642 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2019-09-07 10:28:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:07,642 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-07 10:28:07,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:28:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-07 10:28:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 10:28:07,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:07,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:07,644 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:07,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:07,644 INFO L82 PathProgramCache]: Analyzing trace with hash -967109544, now seen corresponding path program 1 times [2019-09-07 10:28:07,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:07,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:07,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:07,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:07,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:28:07,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:28:07,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:28:07,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:28:07,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:28:07,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:28:07,728 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2019-09-07 10:28:07,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:07,745 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-09-07 10:28:07,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:28:07,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-07 10:28:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:07,749 INFO L225 Difference]: With dead ends: 47 [2019-09-07 10:28:07,750 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 10:28:07,750 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:28:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 10:28:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-09-07 10:28:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 10:28:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-07 10:28:07,758 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2019-09-07 10:28:07,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:07,759 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-07 10:28:07,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:28:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-07 10:28:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 10:28:07,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:07,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:07,761 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash 716522559, now seen corresponding path program 1 times [2019-09-07 10:28:07,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:07,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:07,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:07,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:07,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:28:07,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:28:07,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 10:28:07,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:28:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:28:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:28:07,872 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2019-09-07 10:28:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:07,889 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-09-07 10:28:07,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:28:07,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-09-07 10:28:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:07,892 INFO L225 Difference]: With dead ends: 43 [2019-09-07 10:28:07,893 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 10:28:07,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:28:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 10:28:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-07 10:28:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 10:28:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-07 10:28:07,902 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2019-09-07 10:28:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:07,904 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-07 10:28:07,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:28:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-07 10:28:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 10:28:07,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:07,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:07,908 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:07,909 INFO L82 PathProgramCache]: Analyzing trace with hash 487231732, now seen corresponding path program 1 times [2019-09-07 10:28:07,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:07,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:07,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:07,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:07,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:28:07,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:07,996 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:28:08,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:08,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:28:08,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:28:08,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:08,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:28:08,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:28:08,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:28:08,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:28:08,107 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2019-09-07 10:28:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:08,139 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-09-07 10:28:08,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:28:08,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-07 10:28:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:08,141 INFO L225 Difference]: With dead ends: 52 [2019-09-07 10:28:08,141 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 10:28:08,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:28:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 10:28:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-07 10:28:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 10:28:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-07 10:28:08,149 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2019-09-07 10:28:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:08,149 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-07 10:28:08,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:28:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-07 10:28:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 10:28:08,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:08,151 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:08,151 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:08,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1622628662, now seen corresponding path program 2 times [2019-09-07 10:28:08,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:08,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:08,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:28:08,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:08,236 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) [2019-09-07 10:28:08,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:08,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:28:08,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:08,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:28:08,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:28:08,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:08,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 10:28:08,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:28:08,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:28:08,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:28:08,363 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 7 states. [2019-09-07 10:28:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:08,438 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-07 10:28:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:28:08,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-07 10:28:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:08,440 INFO L225 Difference]: With dead ends: 57 [2019-09-07 10:28:08,440 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 10:28:08,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:28:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 10:28:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-07 10:28:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 10:28:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-09-07 10:28:08,447 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 26 [2019-09-07 10:28:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:08,447 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-09-07 10:28:08,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:28:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-09-07 10:28:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 10:28:08,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:08,449 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:08,449 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:08,450 INFO L82 PathProgramCache]: Analyzing trace with hash 622062996, now seen corresponding path program 3 times [2019-09-07 10:28:08,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:08,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:08,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:08,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:08,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:28:08,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:08,523 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) [2019-09-07 10:28:08,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:08,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:28:08,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:08,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:28:08,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:28:08,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:08,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:28:08,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:28:08,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:28:08,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:28:08,600 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2019-09-07 10:28:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:08,626 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2019-09-07 10:28:08,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:28:08,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-09-07 10:28:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:08,631 INFO L225 Difference]: With dead ends: 53 [2019-09-07 10:28:08,631 INFO L226 Difference]: Without dead ends: 38 [2019-09-07 10:28:08,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:28:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-07 10:28:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-07 10:28:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 10:28:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-09-07 10:28:08,641 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2019-09-07 10:28:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:08,641 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-09-07 10:28:08,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:28:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-09-07 10:28:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 10:28:08,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:08,644 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:08,644 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:08,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1326314704, now seen corresponding path program 4 times [2019-09-07 10:28:08,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:08,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:08,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:08,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:08,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:28:08,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:08,759 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:08,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:28:08,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:28:08,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:08,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:28:08,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:28:08,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:08,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:28:08,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:28:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:28:08,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:28:08,849 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 7 states. [2019-09-07 10:28:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:08,901 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-09-07 10:28:08,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:28:08,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-09-07 10:28:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:08,905 INFO L225 Difference]: With dead ends: 64 [2019-09-07 10:28:08,905 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 10:28:08,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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:28:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 10:28:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-07 10:28:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 10:28:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-09-07 10:28:08,918 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 32 [2019-09-07 10:28:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:08,919 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-09-07 10:28:08,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:28:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-09-07 10:28:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 10:28:08,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:08,920 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:08,920 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash 956002674, now seen corresponding path program 5 times [2019-09-07 10:28:08,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:08,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:08,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:28:08,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:08,992 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:09,013 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:28:09,069 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 10:28:09,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:09,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:28:09,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:28:09,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:09,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:28:09,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:28:09,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:28:09,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:28:09,091 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 7 states. [2019-09-07 10:28:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:09,120 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-09-07 10:28:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:28:09,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-09-07 10:28:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:09,122 INFO L225 Difference]: With dead ends: 57 [2019-09-07 10:28:09,122 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 10:28:09,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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:28:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 10:28:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-07 10:28:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 10:28:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-09-07 10:28:09,129 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2019-09-07 10:28:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:09,129 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-09-07 10:28:09,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:28:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-09-07 10:28:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 10:28:09,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:09,131 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:09,131 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:09,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1762135950, now seen corresponding path program 6 times [2019-09-07 10:28:09,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:09,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:09,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:09,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:28:09,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:09,210 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:28:09,233 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:09,276 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 10:28:09,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:09,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:28:09,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:28:09,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:09,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-07 10:28:09,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:28:09,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:28:09,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:28:09,351 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2019-09-07 10:28:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:09,428 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-09-07 10:28:09,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:28:09,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-09-07 10:28:09,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:09,430 INFO L225 Difference]: With dead ends: 73 [2019-09-07 10:28:09,430 INFO L226 Difference]: Without dead ends: 47 [2019-09-07 10:28:09,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:28:09,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-07 10:28:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-09-07 10:28:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-07 10:28:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-09-07 10:28:09,437 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 36 [2019-09-07 10:28:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:09,438 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-09-07 10:28:09,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:28:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-09-07 10:28:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 10:28:09,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:09,440 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:09,440 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash -995769492, now seen corresponding path program 7 times [2019-09-07 10:28:09,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:09,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:09,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:09,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:09,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:28:09,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:09,529 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:09,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:28:09,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:28:09,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:09,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:28:09,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:28:09,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:28:09,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:28:09,644 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 9 states. [2019-09-07 10:28:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:09,687 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2019-09-07 10:28:09,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:28:09,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-09-07 10:28:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:09,689 INFO L225 Difference]: With dead ends: 76 [2019-09-07 10:28:09,689 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 10:28:09,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:28:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 10:28:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-07 10:28:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 10:28:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-09-07 10:28:09,707 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2019-09-07 10:28:09,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:09,707 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-09-07 10:28:09,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:28:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-09-07 10:28:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 10:28:09,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:09,710 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:09,710 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:09,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1316108370, now seen corresponding path program 8 times [2019-09-07 10:28:09,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:09,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:09,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:09,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:09,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:28:09,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:09,827 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) [2019-09-07 10:28:09,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:09,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:28:09,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:09,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:28:09,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:28:09,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:09,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 10:28:09,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:28:09,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:28:09,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:28:09,980 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 15 states. [2019-09-07 10:28:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:10,071 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-09-07 10:28:10,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:28:10,072 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2019-09-07 10:28:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:10,073 INFO L225 Difference]: With dead ends: 81 [2019-09-07 10:28:10,073 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 10:28:10,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:28:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 10:28:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-09-07 10:28:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 10:28:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-09-07 10:28:10,079 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 42 [2019-09-07 10:28:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:10,080 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-09-07 10:28:10,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:28:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-09-07 10:28:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 10:28:10,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:10,081 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:10,081 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:10,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:10,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2068175372, now seen corresponding path program 9 times [2019-09-07 10:28:10,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:10,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:10,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:10,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:10,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 10:28:10,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:10,178 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) [2019-09-07 10:28:10,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:10,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:28:10,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:10,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:28:10,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:10,484 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:28:10,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-09-07 10:28:10,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:28:10,495 INFO L567 ElimStorePlain]: treesize reduction 9, result has 25.0 percent of original size [2019-09-07 10:28:10,496 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:28:10,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-09-07 10:28:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 10:28:10,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:10,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2019-09-07 10:28:10,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:28:10,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:28:10,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:28:10,572 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 18 states. [2019-09-07 10:28:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:10,936 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-09-07 10:28:10,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:28:10,937 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2019-09-07 10:28:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:10,938 INFO L225 Difference]: With dead ends: 77 [2019-09-07 10:28:10,938 INFO L226 Difference]: Without dead ends: 62 [2019-09-07 10:28:10,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:28:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-07 10:28:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-09-07 10:28:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-07 10:28:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-09-07 10:28:10,945 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 46 [2019-09-07 10:28:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:10,946 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-09-07 10:28:10,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:28:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-09-07 10:28:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 10:28:10,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:10,947 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:10,947 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:10,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1337013960, now seen corresponding path program 1 times [2019-09-07 10:28:10,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:10,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:10,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-07 10:28:11,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:11,049 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:11,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:11,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:28:11,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-07 10:28:11,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:11,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:28:11,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:28:11,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:28:11,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:28:11,148 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 11 states. [2019-09-07 10:28:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:11,183 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-09-07 10:28:11,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:28:11,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-09-07 10:28:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:11,185 INFO L225 Difference]: With dead ends: 100 [2019-09-07 10:28:11,185 INFO L226 Difference]: Without dead ends: 62 [2019-09-07 10:28:11,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 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:28:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-07 10:28:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-07 10:28:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 10:28:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-07 10:28:11,193 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 56 [2019-09-07 10:28:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:11,193 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-07 10:28:11,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:28:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-07 10:28:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 10:28:11,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:11,195 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:11,195 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1081739642, now seen corresponding path program 2 times [2019-09-07 10:28:11,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:11,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:11,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:28:11,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:11,304 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) [2019-09-07 10:28:11,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:11,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:28:11,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:11,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:28:11,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-07 10:28:11,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:11,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 10:28:11,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:28:11,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:28:11,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:28:11,505 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 19 states. [2019-09-07 10:28:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:11,617 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-09-07 10:28:11,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:28:11,619 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-09-07 10:28:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:11,620 INFO L225 Difference]: With dead ends: 105 [2019-09-07 10:28:11,621 INFO L226 Difference]: Without dead ends: 67 [2019-09-07 10:28:11,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:28:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-07 10:28:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-09-07 10:28:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-07 10:28:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-09-07 10:28:11,628 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 58 [2019-09-07 10:28:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:11,629 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-09-07 10:28:11,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:28:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-09-07 10:28:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 10:28:11,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:11,630 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:11,630 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:11,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:11,631 INFO L82 PathProgramCache]: Analyzing trace with hash -536912680, now seen corresponding path program 3 times [2019-09-07 10:28:11,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:11,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:11,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:11,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:11,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 10:28:11,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:11,733 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:28:11,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:28:11,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 10:28:11,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:11,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 10:28:11,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:11,825 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:28:11,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:28:11,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:28:11,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:28:11,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:28:13,994 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 4) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)))) is different from true [2019-09-07 10:28:16,048 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 10:28:18,085 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-07 10:28:18,189 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:28:18,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:28:18,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:28:18,196 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:28:18,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:28:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 117 trivial. 1 not checked. [2019-09-07 10:28:20,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:20,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2019-09-07 10:28:20,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:28:20,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:28:20,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=449, Unknown=2, NotChecked=44, Total=600 [2019-09-07 10:28:20,310 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 25 states. [2019-09-07 10:28:22,695 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-07 10:28:28,865 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-09-07 10:28:32,928 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-09-07 10:28:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:35,031 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2019-09-07 10:28:35,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:28:35,031 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2019-09-07 10:28:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:35,032 INFO L225 Difference]: With dead ends: 99 [2019-09-07 10:28:35,032 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 10:28:35,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=215, Invalid=1118, Unknown=3, NotChecked=70, Total=1406 [2019-09-07 10:28:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 10:28:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-09-07 10:28:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-07 10:28:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2019-09-07 10:28:35,041 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 62 [2019-09-07 10:28:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:35,041 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2019-09-07 10:28:35,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:28:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2019-09-07 10:28:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 10:28:35,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:35,042 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:35,043 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:35,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1905624324, now seen corresponding path program 4 times [2019-09-07 10:28:35,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:35,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:35,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-07 10:28:35,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:35,159 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) [2019-09-07 10:28:35,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:35,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:28:35,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:35,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:28:35,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:28:35,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:35,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:28:35,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:28:35,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:28:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:28:35,325 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 13 states. [2019-09-07 10:28:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:35,397 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2019-09-07 10:28:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:28:35,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-09-07 10:28:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:35,399 INFO L225 Difference]: With dead ends: 128 [2019-09-07 10:28:35,400 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 10:28:35,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:28:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 10:28:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-07 10:28:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 10:28:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-09-07 10:28:35,411 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 72 [2019-09-07 10:28:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:35,412 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-09-07 10:28:35,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:28:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-09-07 10:28:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 10:28:35,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:35,416 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:35,417 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:35,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1895038650, now seen corresponding path program 5 times [2019-09-07 10:28:35,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:35,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:35,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:35,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:35,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-07 10:28:35,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:35,540 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) [2019-09-07 10:28:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:36,179 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-07 10:28:36,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:36,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:28:36,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 10:28:36,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:36,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-09-07 10:28:36,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:28:36,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:28:36,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:28:36,366 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 23 states. [2019-09-07 10:28:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:36,481 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2019-09-07 10:28:36,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:28:36,482 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2019-09-07 10:28:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:36,483 INFO L225 Difference]: With dead ends: 133 [2019-09-07 10:28:36,483 INFO L226 Difference]: Without dead ends: 83 [2019-09-07 10:28:36,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:28:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-07 10:28:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-09-07 10:28:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 10:28:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-09-07 10:28:36,491 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 74 [2019-09-07 10:28:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:36,491 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-09-07 10:28:36,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:28:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-09-07 10:28:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 10:28:36,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:36,492 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:36,492 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:36,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1980306852, now seen corresponding path program 6 times [2019-09-07 10:28:36,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:36,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:36,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:36,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:36,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 4 proven. 100 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-07 10:28:36,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:36,617 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) [2019-09-07 10:28:36,631 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:37,601 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-09-07 10:28:37,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:37,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:28:37,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-07 10:28:37,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:37,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:28:37,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:28:37,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:28:37,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:28:37,638 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 14 states. [2019-09-07 10:28:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:37,681 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2019-09-07 10:28:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:28:37,681 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 78 [2019-09-07 10:28:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:37,683 INFO L225 Difference]: With dead ends: 113 [2019-09-07 10:28:37,683 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 10:28:37,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 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:28:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 10:28:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-07 10:28:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 10:28:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-09-07 10:28:37,689 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 78 [2019-09-07 10:28:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:37,690 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2019-09-07 10:28:37,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:28:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2019-09-07 10:28:37,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 10:28:37,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:37,691 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:37,691 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:37,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1217920832, now seen corresponding path program 7 times [2019-09-07 10:28:37,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:37,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:37,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:37,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:37,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 4 proven. 121 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-07 10:28:37,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:37,839 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:37,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:37,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:28:37,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-07 10:28:37,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:37,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:28:37,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:28:37,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:28:37,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:28:37,942 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 15 states. [2019-09-07 10:28:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:38,004 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2019-09-07 10:28:38,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:28:38,004 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2019-09-07 10:28:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:38,005 INFO L225 Difference]: With dead ends: 140 [2019-09-07 10:28:38,005 INFO L226 Difference]: Without dead ends: 86 [2019-09-07 10:28:38,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:28:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-07 10:28:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-07 10:28:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-07 10:28:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2019-09-07 10:28:38,012 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 80 [2019-09-07 10:28:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:38,012 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2019-09-07 10:28:38,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:28:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2019-09-07 10:28:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 10:28:38,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:38,013 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:38,014 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:38,014 INFO L82 PathProgramCache]: Analyzing trace with hash -277407358, now seen corresponding path program 8 times [2019-09-07 10:28:38,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:38,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:38,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:38,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:38,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 4 proven. 121 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-09-07 10:28:38,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:38,156 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) [2019-09-07 10:28:38,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:38,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:28:38,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:38,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:28:38,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-07 10:28:38,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:38,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-09-07 10:28:38,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:28:38,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:28:38,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:28:38,425 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 27 states. [2019-09-07 10:28:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:38,545 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2019-09-07 10:28:38,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:28:38,546 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2019-09-07 10:28:38,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:38,547 INFO L225 Difference]: With dead ends: 145 [2019-09-07 10:28:38,547 INFO L226 Difference]: Without dead ends: 91 [2019-09-07 10:28:38,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:28:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-07 10:28:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-09-07 10:28:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 10:28:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-09-07 10:28:38,554 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 82 [2019-09-07 10:28:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:38,554 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-09-07 10:28:38,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:28:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-09-07 10:28:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 10:28:38,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:38,555 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:38,556 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1342657312, now seen corresponding path program 9 times [2019-09-07 10:28:38,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:38,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:38,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:38,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:38,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 4 proven. 144 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-07 10:28:38,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:38,691 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) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:38,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:28:38,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 10:28:38,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:38,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-07 10:28:38,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:38,780 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:28:38,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:28:38,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:28:38,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:28:38,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:28:41,055 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|))) (and (= (select .cse0 4) (select .cse1 4)) (= (select .cse1 8) (select .cse0 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|))))) is different from true [2019-09-07 10:28:43,223 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|)) (.cse1 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|))) (and (= (select .cse0 4) (select .cse1 4)) (= (select .cse0 8) (select .cse1 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|))))) is different from true [2019-09-07 10:28:45,258 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-07 10:28:47,296 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-07 10:28:47,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-09-07 10:28:47,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:28:47,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:28:47,388 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:28:47,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:3 [2019-09-07 10:28:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 250 trivial. 7 not checked. [2019-09-07 10:28:49,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:49,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 34 [2019-09-07 10:28:49,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:28:49,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:28:49,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=794, Unknown=3, NotChecked=122, Total=1122 [2019-09-07 10:28:49,492 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 34 states. [2019-09-07 10:28:56,163 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-09-07 10:29:00,224 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:29:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:02,468 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-09-07 10:29:02,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:29:02,472 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 86 [2019-09-07 10:29:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:02,473 INFO L225 Difference]: With dead ends: 131 [2019-09-07 10:29:02,473 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 10:29:02,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=365, Invalid=1709, Unknown=4, NotChecked=178, Total=2256 [2019-09-07 10:29:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 10:29:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2019-09-07 10:29:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-07 10:29:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-09-07 10:29:02,500 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 86 [2019-09-07 10:29:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:02,500 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-09-07 10:29:02,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:29:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-09-07 10:29:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 10:29:02,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:02,502 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:02,502 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1246868236, now seen corresponding path program 10 times [2019-09-07 10:29:02,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:02,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:02,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 6 proven. 169 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-07 10:29:02,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:02,670 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) [2019-09-07 10:29:02,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:02,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:29:02,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:02,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:29:02,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-09-07 10:29:02,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:02,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:29:02,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:29:02,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:29:02,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:29:02,774 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 17 states. [2019-09-07 10:29:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:02,840 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2019-09-07 10:29:02,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:29:02,840 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-09-07 10:29:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:02,841 INFO L225 Difference]: With dead ends: 168 [2019-09-07 10:29:02,841 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 10:29:02,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 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:29:02,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 10:29:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-07 10:29:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 10:29:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-09-07 10:29:02,849 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 96 [2019-09-07 10:29:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:02,850 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-09-07 10:29:02,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:29:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-09-07 10:29:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 10:29:02,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:02,851 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:02,851 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1602750798, now seen corresponding path program 11 times [2019-09-07 10:29:02,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:02,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:02,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:02,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:02,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 6 proven. 169 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-09-07 10:29:03,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:03,027 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) [2019-09-07 10:29:03,058 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:10,163 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-09-07 10:29:10,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:10,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:29:10,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-09-07 10:29:10,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:10,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-09-07 10:29:10,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:29:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:29:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:29:10,378 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 31 states. [2019-09-07 10:29:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:10,529 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2019-09-07 10:29:10,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:29:10,529 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 98 [2019-09-07 10:29:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:10,531 INFO L225 Difference]: With dead ends: 173 [2019-09-07 10:29:10,531 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 10:29:10,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:29:10,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 10:29:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-09-07 10:29:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-07 10:29:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-09-07 10:29:10,544 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 98 [2019-09-07 10:29:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:10,545 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-09-07 10:29:10,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:29:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-09-07 10:29:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 10:29:10,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:10,547 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:10,547 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash -454599252, now seen corresponding path program 12 times [2019-09-07 10:29:10,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:10,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:10,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:10,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:10,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 6 proven. 196 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-07 10:29:10,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:10,760 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:29:10,777 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:29:12,053 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-07 10:29:12,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:12,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:29:12,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-09-07 10:29:12,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:12,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 10:29:12,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:29:12,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:29:12,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:29:12,307 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 33 states. [2019-09-07 10:29:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:12,428 INFO L93 Difference]: Finished difference Result 179 states and 185 transitions. [2019-09-07 10:29:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:29:12,428 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 102 [2019-09-07 10:29:12,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:12,430 INFO L225 Difference]: With dead ends: 179 [2019-09-07 10:29:12,431 INFO L226 Difference]: Without dead ends: 111 [2019-09-07 10:29:12,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:29:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-07 10:29:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-09-07 10:29:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-07 10:29:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2019-09-07 10:29:12,441 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 102 [2019-09-07 10:29:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:12,441 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2019-09-07 10:29:12,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:29:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2019-09-07 10:29:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 10:29:12,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:12,443 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:12,443 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:12,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:12,443 INFO L82 PathProgramCache]: Analyzing trace with hash -64314998, now seen corresponding path program 13 times [2019-09-07 10:29:12,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:12,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:12,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:12,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:12,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 6 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-07 10:29:12,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:12,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:29:12,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:12,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:29:12,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-09-07 10:29:13,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:13,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2019-09-07 10:29:13,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:29:13,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:29:13,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:29:13,090 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 35 states. [2019-09-07 10:29:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:13,240 INFO L93 Difference]: Finished difference Result 185 states and 191 transitions. [2019-09-07 10:29:13,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:29:13,247 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2019-09-07 10:29:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:13,248 INFO L225 Difference]: With dead ends: 185 [2019-09-07 10:29:13,248 INFO L226 Difference]: Without dead ends: 115 [2019-09-07 10:29:13,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:29:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-07 10:29:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2019-09-07 10:29:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-07 10:29:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2019-09-07 10:29:13,257 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 106 [2019-09-07 10:29:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:13,258 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2019-09-07 10:29:13,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:29:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2019-09-07 10:29:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 10:29:13,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:13,259 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:13,260 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash 263484648, now seen corresponding path program 14 times [2019-09-07 10:29:13,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:13,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:13,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:13,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:29:13,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 6 proven. 256 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-07 10:29:13,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:13,463 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:29:13,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:29:13,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:29:13,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:13,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:29:13,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-07 10:29:13,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:13,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2019-09-07 10:29:13,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:29:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:29:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:29:13,876 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 37 states. [2019-09-07 10:29:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:14,006 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2019-09-07 10:29:14,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:29:14,006 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 110 [2019-09-07 10:29:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:14,007 INFO L225 Difference]: With dead ends: 191 [2019-09-07 10:29:14,007 INFO L226 Difference]: Without dead ends: 119 [2019-09-07 10:29:14,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:29:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-07 10:29:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-09-07 10:29:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-07 10:29:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2019-09-07 10:29:14,017 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 110 [2019-09-07 10:29:14,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:14,018 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2019-09-07 10:29:14,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:29:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2019-09-07 10:29:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-07 10:29:14,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:14,019 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:14,019 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:14,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1216383034, now seen corresponding path program 15 times [2019-09-07 10:29:14,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:14,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:14,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 6 proven. 289 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-09-07 10:29:14,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:14,257 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:29:14,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:29:14,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:29:14,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:14,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 10:29:14,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:14,376 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:29:14,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:14,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:14,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:14,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:29:16,558 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) 12) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_7| |v_main_~#a~0.base_BEFORE_CALL_7|)))) is different from true [2019-09-07 10:29:18,637 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) 12) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_8| |v_main_~#a~0.base_BEFORE_CALL_8|)))) is different from true [2019-09-07 10:29:20,712 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_9| |v_main_~#a~0.base_BEFORE_CALL_9|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) 12) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|) 12)))) is different from true [2019-09-07 10:29:22,745 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 10:29:24,777 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-07 10:29:24,855 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:29:24,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:24,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:24,859 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:29:24,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:29:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 493 trivial. 17 not checked. [2019-09-07 10:29:26,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:26,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2019-09-07 10:29:26,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 10:29:26,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 10:29:26,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1035, Unknown=4, NotChecked=216, Total=1560 [2019-09-07 10:29:26,972 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 40 states. [2019-09-07 10:29:29,740 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-07 10:29:35,942 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:29:39,999 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:29:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:42,096 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2019-09-07 10:29:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:29:42,097 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2019-09-07 10:29:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:42,098 INFO L225 Difference]: With dead ends: 167 [2019-09-07 10:29:42,098 INFO L226 Difference]: Without dead ends: 130 [2019-09-07 10:29:42,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=590, Invalid=2609, Unknown=5, NotChecked=336, Total=3540 [2019-09-07 10:29:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-07 10:29:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-09-07 10:29:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-07 10:29:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2019-09-07 10:29:42,107 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 114 [2019-09-07 10:29:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:42,107 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2019-09-07 10:29:42,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 10:29:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2019-09-07 10:29:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-07 10:29:42,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:42,108 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:42,109 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:42,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash -669655438, now seen corresponding path program 16 times [2019-09-07 10:29:42,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:42,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:42,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:42,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:42,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 8 proven. 324 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-07 10:29:42,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:42,356 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:29:42,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:29:42,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:29:42,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:42,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:29:42,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-09-07 10:29:42,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:42,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:29:42,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:29:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:29:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:29:42,477 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 22 states. [2019-09-07 10:29:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:42,571 INFO L93 Difference]: Finished difference Result 214 states and 218 transitions. [2019-09-07 10:29:42,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:29:42,571 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 124 [2019-09-07 10:29:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:42,572 INFO L225 Difference]: With dead ends: 214 [2019-09-07 10:29:42,572 INFO L226 Difference]: Without dead ends: 130 [2019-09-07 10:29:42,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:29:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-07 10:29:42,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-07 10:29:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-07 10:29:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-09-07 10:29:42,581 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 124 [2019-09-07 10:29:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:42,581 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-09-07 10:29:42,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:29:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-09-07 10:29:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 10:29:42,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:42,582 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:42,583 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:42,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:42,583 INFO L82 PathProgramCache]: Analyzing trace with hash 497556916, now seen corresponding path program 17 times [2019-09-07 10:29:42,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:42,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:42,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:42,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:42,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 8 proven. 324 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-09-07 10:29:42,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:42,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 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:29:42,852 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:29:57,761 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-07 10:29:57,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:57,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:29:57,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-07 10:29:57,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:57,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:29:57,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:29:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:29:57,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:29:57,814 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 22 states. [2019-09-07 10:29:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:57,899 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2019-09-07 10:29:57,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:29:57,901 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 126 [2019-09-07 10:29:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:57,902 INFO L225 Difference]: With dead ends: 177 [2019-09-07 10:29:57,902 INFO L226 Difference]: Without dead ends: 132 [2019-09-07 10:29:57,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:29:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-07 10:29:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-07 10:29:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-07 10:29:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2019-09-07 10:29:57,911 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 126 [2019-09-07 10:29:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:57,911 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2019-09-07 10:29:57,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:29:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2019-09-07 10:29:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-07 10:29:57,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:57,913 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:57,913 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:57,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:57,913 INFO L82 PathProgramCache]: Analyzing trace with hash -858795184, now seen corresponding path program 18 times [2019-09-07 10:29:57,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:57,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:57,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:57,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:57,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 361 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-09-07 10:29:58,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:58,150 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:29:58,162 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:30:08,030 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-09-07 10:30:08,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:08,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:30:08,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 37 proven. 361 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:30:08,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:08,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-09-07 10:30:08,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 10:30:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 10:30:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:30:08,696 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 44 states. [2019-09-07 10:30:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:08,971 INFO L93 Difference]: Finished difference Result 224 states and 231 transitions. [2019-09-07 10:30:08,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:30:08,971 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 128 [2019-09-07 10:30:08,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:08,972 INFO L225 Difference]: With dead ends: 224 [2019-09-07 10:30:08,972 INFO L226 Difference]: Without dead ends: 138 [2019-09-07 10:30:08,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:30:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-07 10:30:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-07 10:30:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-07 10:30:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2019-09-07 10:30:08,981 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 128 [2019-09-07 10:30:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:08,982 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2019-09-07 10:30:08,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 10:30:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2019-09-07 10:30:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-07 10:30:08,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:08,983 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:08,984 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1855277840, now seen corresponding path program 19 times [2019-09-07 10:30:08,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:08,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:08,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:08,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 8 proven. 400 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-09-07 10:30:09,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:09,261 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) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:09,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:30:09,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-09-07 10:30:09,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:09,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2019-09-07 10:30:09,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 10:30:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 10:30:09,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:30:09,742 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 45 states. [2019-09-07 10:30:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:09,991 INFO L93 Difference]: Finished difference Result 231 states and 237 transitions. [2019-09-07 10:30:09,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 10:30:09,992 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 134 [2019-09-07 10:30:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:09,993 INFO L225 Difference]: With dead ends: 231 [2019-09-07 10:30:09,993 INFO L226 Difference]: Without dead ends: 143 [2019-09-07 10:30:09,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:30:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-07 10:30:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-09-07 10:30:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-07 10:30:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2019-09-07 10:30:10,002 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 134 [2019-09-07 10:30:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:10,003 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2019-09-07 10:30:10,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 10:30:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2019-09-07 10:30:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-07 10:30:10,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:10,004 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:10,004 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:10,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:10,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1858275378, now seen corresponding path program 20 times [2019-09-07 10:30:10,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:10,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 8 proven. 441 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-09-07 10:30:10,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:10,283 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:30:10,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:30:10,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:30:10,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:10,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:30:10,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-09-07 10:30:10,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:10,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2019-09-07 10:30:10,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:30:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:30:10,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:30:10,816 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 47 states. [2019-09-07 10:30:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:11,059 INFO L93 Difference]: Finished difference Result 237 states and 243 transitions. [2019-09-07 10:30:11,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:30:11,059 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 138 [2019-09-07 10:30:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:11,061 INFO L225 Difference]: With dead ends: 237 [2019-09-07 10:30:11,061 INFO L226 Difference]: Without dead ends: 147 [2019-09-07 10:30:11,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:30:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-07 10:30:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-09-07 10:30:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-07 10:30:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2019-09-07 10:30:11,070 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 138 [2019-09-07 10:30:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:11,071 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2019-09-07 10:30:11,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:30:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2019-09-07 10:30:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 10:30:11,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:11,072 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:11,072 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:11,073 INFO L82 PathProgramCache]: Analyzing trace with hash 697698860, now seen corresponding path program 21 times [2019-09-07 10:30:11,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:11,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:11,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:11,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:11,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 8 proven. 484 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-09-07 10:30:11,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:11,412 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:30:11,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:30:11,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 10:30:11,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:11,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-07 10:30:11,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:11,619 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:11,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:11,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:11,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:30:11,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:30:13,829 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_11| Int) (|v_main_~#b~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_11| |v_main_~#b~0.base_BEFORE_CALL_11|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_11|) 16) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) 16)))) is different from true [2019-09-07 10:30:15,903 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_12| Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_12|) 16) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) 16)) (not (= |v_main_~#a~0.base_BEFORE_CALL_12| |v_main_~#b~0.base_BEFORE_CALL_12|)))) is different from true [2019-09-07 10:30:18,008 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_13| Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_13| |v_main_~#b~0.base_BEFORE_CALL_13|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_13|) 16) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))) is different from true [2019-09-07 10:30:20,088 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_14| Int) (|v_main_~#b~0.base_BEFORE_CALL_14| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_14|) 16) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_14|) 16)) (not (= |v_main_~#a~0.base_BEFORE_CALL_14| |v_main_~#b~0.base_BEFORE_CALL_14|)))) is different from true [2019-09-07 10:30:22,122 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 10:30:24,156 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-07 10:30:24,231 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:24,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:30:24,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:30:24,235 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:24,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:30:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 818 trivial. 31 not checked. [2019-09-07 10:30:26,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:26,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2019-09-07 10:30:26,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-07 10:30:26,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-07 10:30:26,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1441, Unknown=5, NotChecked=348, Total=2256 [2019-09-07 10:30:26,386 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 48 states. [2019-09-07 10:30:29,399 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-07 10:30:35,577 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:39,637 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:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:41,723 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2019-09-07 10:30:41,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:30:41,724 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 142 [2019-09-07 10:30:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:41,726 INFO L225 Difference]: With dead ends: 203 [2019-09-07 10:30:41,726 INFO L226 Difference]: Without dead ends: 158 [2019-09-07 10:30:41,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=891, Invalid=3675, Unknown=6, NotChecked=540, Total=5112 [2019-09-07 10:30:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-07 10:30:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2019-09-07 10:30:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-07 10:30:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2019-09-07 10:30:41,737 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 142 [2019-09-07 10:30:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:41,738 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2019-09-07 10:30:41,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-07 10:30:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2019-09-07 10:30:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 10:30:41,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:41,739 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:41,739 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:41,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1496215896, now seen corresponding path program 22 times [2019-09-07 10:30:41,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:41,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:41,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:41,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 10 proven. 529 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2019-09-07 10:30:42,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:42,190 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) [2019-09-07 10:30:42,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:42,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:30:42,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:42,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:30:42,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2019-09-07 10:30:42,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:42,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:30:42,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:30:42,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:30:42,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:30:42,364 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 27 states. [2019-09-07 10:30:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:42,473 INFO L93 Difference]: Finished difference Result 260 states and 264 transitions. [2019-09-07 10:30:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:30:42,474 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 152 [2019-09-07 10:30:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:42,475 INFO L225 Difference]: With dead ends: 260 [2019-09-07 10:30:42,475 INFO L226 Difference]: Without dead ends: 158 [2019-09-07 10:30:42,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:30:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-07 10:30:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-07 10:30:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-07 10:30:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-09-07 10:30:42,485 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 152 [2019-09-07 10:30:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:42,485 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-09-07 10:30:42,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:30:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-09-07 10:30:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 10:30:42,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:42,486 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:42,487 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:42,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1080747622, now seen corresponding path program 23 times [2019-09-07 10:30:42,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:42,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:42,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:42,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:42,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 10 proven. 529 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-09-07 10:30:42,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:42,805 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:30:42,816 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:31:17,892 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-07 10:31:17,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:17,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:31:17,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2019-09-07 10:31:18,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:18,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-09-07 10:31:18,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:31:18,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:31:18,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:31:18,447 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 51 states. [2019-09-07 10:31:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:18,739 INFO L93 Difference]: Finished difference Result 265 states and 271 transitions. [2019-09-07 10:31:18,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:31:18,740 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 154 [2019-09-07 10:31:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:18,742 INFO L225 Difference]: With dead ends: 265 [2019-09-07 10:31:18,742 INFO L226 Difference]: Without dead ends: 163 [2019-09-07 10:31:18,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:31:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-07 10:31:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-09-07 10:31:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-07 10:31:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-09-07 10:31:18,754 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 154 [2019-09-07 10:31:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:18,755 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-09-07 10:31:18,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:31:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-09-07 10:31:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 10:31:18,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:18,757 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:18,757 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:18,758 INFO L82 PathProgramCache]: Analyzing trace with hash 525561080, now seen corresponding path program 24 times [2019-09-07 10:31:18,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:18,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:18,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 10 proven. 576 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-07 10:31:19,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:19,250 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) [2019-09-07 10:31:19,264 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:31:56,127 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 10:31:56,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:56,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-07 10:31:56,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:56,157 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:56,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:31:56,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:31:56,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:31:56,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:31:56,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-09-07 10:31:56,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:31:56,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:31:56,210 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:56,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:11 [2019-09-07 10:31:58,417 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_16| Int) (|v_main_~#a~0.base_BEFORE_CALL_16| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_16|) 20) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) 20)) (not (= |v_main_~#a~0.base_BEFORE_CALL_16| |v_main_~#b~0.base_BEFORE_CALL_16|)))) is different from true [2019-09-07 10:32:00,514 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_17| |v_main_~#b~0.base_BEFORE_CALL_17|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_17|) 20) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) 20)))) is different from true [2019-09-07 10:32:02,600 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_18| Int) (|v_main_~#b~0.base_BEFORE_CALL_18| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_18|) 20) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_18|) 20)) (not (= |v_main_~#a~0.base_BEFORE_CALL_18| |v_main_~#b~0.base_BEFORE_CALL_18|)))) is different from true [2019-09-07 10:32:04,693 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| Int) (|v_main_~#b~0.base_BEFORE_CALL_19| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_19| |v_main_~#b~0.base_BEFORE_CALL_19|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) 20) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_19|) 20)))) is different from true [2019-09-07 10:32:06,771 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_20| Int) (|v_main_~#a~0.base_BEFORE_CALL_20| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_20|) 20) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_20|) 20)) (not (= |v_main_~#a~0.base_BEFORE_CALL_20| |v_main_~#b~0.base_BEFORE_CALL_20|)))) is different from true [2019-09-07 10:32:08,808 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 10:32:10,846 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-07 10:32:10,962 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:32:10,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:32:10,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:32:10,966 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:32:10,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:32:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 949 trivial. 49 not checked. [2019-09-07 10:32:13,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:13,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2019-09-07 10:32:13,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 10:32:13,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 10:32:13,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1719, Unknown=6, NotChecked=480, Total=2756 [2019-09-07 10:32:13,130 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 53 states. [2019-09-07 10:32:16,254 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-07 10:32:22,425 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:32:26,479 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:32:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:28,550 INFO L93 Difference]: Finished difference Result 227 states and 231 transitions. [2019-09-07 10:32:28,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 10:32:28,551 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 158 [2019-09-07 10:32:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:28,553 INFO L225 Difference]: With dead ends: 227 [2019-09-07 10:32:28,553 INFO L226 Difference]: Without dead ends: 174 [2019-09-07 10:32:28,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=1021, Invalid=4248, Unknown=7, NotChecked=730, Total=6006 [2019-09-07 10:32:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-07 10:32:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-09-07 10:32:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-07 10:32:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-09-07 10:32:28,565 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 158 [2019-09-07 10:32:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:28,565 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-09-07 10:32:28,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 10:32:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-09-07 10:32:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-07 10:32:28,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:28,567 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:28,567 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:28,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:28,567 INFO L82 PathProgramCache]: Analyzing trace with hash -385807068, now seen corresponding path program 25 times [2019-09-07 10:32:28,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:28,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:28,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:28,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:28,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 12 proven. 625 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 10:32:29,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:29,046 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:29,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:29,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:32:29,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2019-09-07 10:32:29,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:29,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:32:29,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:32:29,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:32:29,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:32:29,261 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 29 states. [2019-09-07 10:32:29,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:29,374 INFO L93 Difference]: Finished difference Result 288 states and 292 transitions. [2019-09-07 10:32:29,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:32:29,374 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 168 [2019-09-07 10:32:29,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:29,375 INFO L225 Difference]: With dead ends: 288 [2019-09-07 10:32:29,375 INFO L226 Difference]: Without dead ends: 174 [2019-09-07 10:32:29,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:32:29,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-07 10:32:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-07 10:32:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-07 10:32:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2019-09-07 10:32:29,386 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 168 [2019-09-07 10:32:29,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:29,387 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2019-09-07 10:32:29,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:32:29,387 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2019-09-07 10:32:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-07 10:32:29,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:29,388 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:29,388 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:29,389 INFO L82 PathProgramCache]: Analyzing trace with hash 149090662, now seen corresponding path program 26 times [2019-09-07 10:32:29,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:29,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:29,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:32:29,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 12 proven. 625 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-09-07 10:32:29,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:29,865 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:29,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:32:29,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:32:29,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:29,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:32:29,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2019-09-07 10:32:30,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:30,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2019-09-07 10:32:30,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 10:32:30,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 10:32:30,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:32:30,574 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 55 states. [2019-09-07 10:32:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:30,856 INFO L93 Difference]: Finished difference Result 293 states and 299 transitions. [2019-09-07 10:32:30,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 10:32:30,865 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 170 [2019-09-07 10:32:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:30,866 INFO L225 Difference]: With dead ends: 293 [2019-09-07 10:32:30,866 INFO L226 Difference]: Without dead ends: 179 [2019-09-07 10:32:30,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:32:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-07 10:32:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-07 10:32:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-07 10:32:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 179 transitions. [2019-09-07 10:32:30,876 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 179 transitions. Word has length 170 [2019-09-07 10:32:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:30,876 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 179 transitions. [2019-09-07 10:32:30,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 10:32:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2019-09-07 10:32:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-07 10:32:30,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:30,878 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:30,878 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:30,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash -844036668, now seen corresponding path program 27 times [2019-09-07 10:32:30,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:30,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:30,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 12 proven. 676 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-07 10:32:31,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:31,282 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:31,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:32:32,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 10:32:32,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:32,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-07 10:32:32,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:32,089 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:32,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:32:32,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:32:32,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:32:32,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:32:34,385 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_22| Int) (|v_main_~#b~0.base_BEFORE_CALL_22| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_22|) 24) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_22|) 24)) (not (= |v_main_~#a~0.base_BEFORE_CALL_22| |v_main_~#b~0.base_BEFORE_CALL_22|)))) is different from true [2019-09-07 10:32:36,474 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_23| Int) (|v_main_~#a~0.base_BEFORE_CALL_23| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_23| |v_main_~#b~0.base_BEFORE_CALL_23|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_23|) 24) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_23|) 24)))) is different from true [2019-09-07 10:32:38,573 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_24| Int) (|v_main_~#a~0.base_BEFORE_CALL_24| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_24| |v_main_~#b~0.base_BEFORE_CALL_24|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_24|) 24) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_24|) 24)))) is different from true [2019-09-07 10:32:40,659 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_25| Int) (|v_main_~#b~0.base_BEFORE_CALL_25| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_25|) 24) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_25|) 24)) (not (= |v_main_~#a~0.base_BEFORE_CALL_25| |v_main_~#b~0.base_BEFORE_CALL_25|)))) is different from true [2019-09-07 10:32:42,748 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_26| Int) (|v_main_~#b~0.base_BEFORE_CALL_26| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_26|) 24) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_26|) 24)) (not (= |v_main_~#a~0.base_BEFORE_CALL_26| |v_main_~#b~0.base_BEFORE_CALL_26|)))) is different from true [2019-09-07 10:32:44,840 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_27| Int) (|v_main_~#a~0.base_BEFORE_CALL_27| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_27| |v_main_~#b~0.base_BEFORE_CALL_27|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_27|) 24) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_27|) 24)))) is different from true [2019-09-07 10:32:46,901 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 10:32:48,943 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-07 10:32:49,057 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:32:49,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:32:49,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:32:49,064 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:32:49,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:32:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 0 proven. 388 refuted. 0 times theorem prover too weak. 1090 trivial. 71 not checked. [2019-09-07 10:32:51,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:51,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2019-09-07 10:32:51,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 10:32:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 10:32:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=2022, Unknown=7, NotChecked=630, Total=3306 [2019-09-07 10:32:51,291 INFO L87 Difference]: Start difference. First operand 177 states and 179 transitions. Second operand 58 states. [2019-09-07 10:32:54,944 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-07 10:33:01,137 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:33:05,200 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:33:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:07,295 INFO L93 Difference]: Finished difference Result 251 states and 255 transitions. [2019-09-07 10:33:07,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:33:07,296 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 174 [2019-09-07 10:33:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:07,298 INFO L225 Difference]: With dead ends: 251 [2019-09-07 10:33:07,298 INFO L226 Difference]: Without dead ends: 190 [2019-09-07 10:33:07,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 140 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=1160, Invalid=4862, Unknown=8, NotChecked=942, Total=6972 [2019-09-07 10:33:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-07 10:33:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-09-07 10:33:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-07 10:33:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 189 transitions. [2019-09-07 10:33:07,310 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 189 transitions. Word has length 174 [2019-09-07 10:33:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:07,310 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 189 transitions. [2019-09-07 10:33:07,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 10:33:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 189 transitions. [2019-09-07 10:33:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-07 10:33:07,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:07,312 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:07,312 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:07,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1386193168, now seen corresponding path program 28 times [2019-09-07 10:33:07,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:07,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:07,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:07,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:07,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 14 proven. 729 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [2019-09-07 10:33:07,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:07,812 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) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:07,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:33:07,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:33:07,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:07,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:33:07,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-09-07 10:33:08,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:08,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:33:08,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:33:08,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:33:08,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:33:08,006 INFO L87 Difference]: Start difference. First operand 187 states and 189 transitions. Second operand 31 states. [2019-09-07 10:33:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:08,142 INFO L93 Difference]: Finished difference Result 316 states and 320 transitions. [2019-09-07 10:33:08,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:33:08,143 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 184 [2019-09-07 10:33:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:08,144 INFO L225 Difference]: With dead ends: 316 [2019-09-07 10:33:08,144 INFO L226 Difference]: Without dead ends: 190 [2019-09-07 10:33:08,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:33:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-07 10:33:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-07 10:33:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-07 10:33:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 191 transitions. [2019-09-07 10:33:08,155 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 191 transitions. Word has length 184 [2019-09-07 10:33:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:08,156 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 191 transitions. [2019-09-07 10:33:08,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:33:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 191 transitions. [2019-09-07 10:33:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-07 10:33:08,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:08,157 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:08,158 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash 12943154, now seen corresponding path program 29 times [2019-09-07 10:33:08,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:08,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:08,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 14 proven. 729 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-09-07 10:33:08,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:08,668 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:33:08,679 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:34:58,820 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-09-07 10:34:58,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:58,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:34:58,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2019-09-07 10:34:58,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:58,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:34:58,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:34:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:34:58,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:34:58,926 INFO L87 Difference]: Start difference. First operand 189 states and 191 transitions. Second operand 31 states. [2019-09-07 10:34:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:59,036 INFO L93 Difference]: Finished difference Result 261 states and 264 transitions. [2019-09-07 10:34:59,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:34:59,037 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 186 [2019-09-07 10:34:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:59,038 INFO L225 Difference]: With dead ends: 261 [2019-09-07 10:34:59,038 INFO L226 Difference]: Without dead ends: 192 [2019-09-07 10:34:59,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 186 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:34:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-07 10:34:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-07 10:34:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-07 10:34:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 193 transitions. [2019-09-07 10:34:59,052 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 193 transitions. Word has length 186 [2019-09-07 10:34:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:59,053 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 193 transitions. [2019-09-07 10:34:59,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:34:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 193 transitions. [2019-09-07 10:34:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 10:34:59,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:59,054 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:59,054 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1256807090, now seen corresponding path program 30 times [2019-09-07 10:34:59,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:59,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:59,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:59,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:59,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:59,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 14 proven. 784 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-09-07 10:34:59,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:59,569 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) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:59,580 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:36:44,985 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-09-07 10:36:44,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:45,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:36:45,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2019-09-07 10:36:45,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:45,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 10:36:45,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:36:45,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:36:45,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:36:45,067 INFO L87 Difference]: Start difference. First operand 191 states and 193 transitions. Second operand 32 states. [2019-09-07 10:36:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:45,198 INFO L93 Difference]: Finished difference Result 322 states and 326 transitions. [2019-09-07 10:36:45,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:36:45,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 188 [2019-09-07 10:36:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:45,200 INFO L225 Difference]: With dead ends: 322 [2019-09-07 10:36:45,200 INFO L226 Difference]: Without dead ends: 194 [2019-09-07 10:36:45,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:36:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-07 10:36:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-07 10:36:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-07 10:36:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 195 transitions. [2019-09-07 10:36:45,215 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 195 transitions. Word has length 188 [2019-09-07 10:36:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:45,215 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 195 transitions. [2019-09-07 10:36:45,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:36:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 195 transitions. [2019-09-07 10:36:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 10:36:45,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:45,216 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:45,217 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:45,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1802644336, now seen corresponding path program 31 times [2019-09-07 10:36:45,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:45,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:45,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:45,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:36:45,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 14 proven. 784 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2019-09-07 10:36:45,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:45,747 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:36:45,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:36:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:45,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:36:45,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2019-09-07 10:36:46,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:46,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 61 [2019-09-07 10:36:46,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 10:36:46,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 10:36:46,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:36:46,800 INFO L87 Difference]: Start difference. First operand 193 states and 195 transitions. Second operand 61 states. [2019-09-07 10:36:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:47,076 INFO L93 Difference]: Finished difference Result 327 states and 333 transitions. [2019-09-07 10:36:47,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 10:36:47,077 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 190 [2019-09-07 10:36:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:47,079 INFO L225 Difference]: With dead ends: 327 [2019-09-07 10:36:47,079 INFO L226 Difference]: Without dead ends: 199 [2019-09-07 10:36:47,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:36:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-07 10:36:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2019-09-07 10:36:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-07 10:36:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 199 transitions. [2019-09-07 10:36:47,092 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 199 transitions. Word has length 190 [2019-09-07 10:36:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:47,092 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 199 transitions. [2019-09-07 10:36:47,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 10:36:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 199 transitions. [2019-09-07 10:36:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-07 10:36:47,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:47,094 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:47,094 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:47,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1577638254, now seen corresponding path program 32 times [2019-09-07 10:36:47,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:47,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:47,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:36:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 14 proven. 841 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2019-09-07 10:36:47,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:47,560 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:36:47,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:36:47,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:36:47,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:47,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:36:47,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2019-09-07 10:36:48,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:48,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 63 [2019-09-07 10:36:48,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 10:36:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 10:36:48,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:36:48,494 INFO L87 Difference]: Start difference. First operand 197 states and 199 transitions. Second operand 63 states. [2019-09-07 10:36:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:48,766 INFO L93 Difference]: Finished difference Result 333 states and 339 transitions. [2019-09-07 10:36:48,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 10:36:48,766 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 194 [2019-09-07 10:36:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:48,767 INFO L225 Difference]: With dead ends: 333 [2019-09-07 10:36:48,767 INFO L226 Difference]: Without dead ends: 203 [2019-09-07 10:36:48,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:36:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-07 10:36:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-09-07 10:36:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-07 10:36:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2019-09-07 10:36:48,779 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 194 [2019-09-07 10:36:48,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:48,779 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2019-09-07 10:36:48,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 10:36:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2019-09-07 10:36:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-07 10:36:48,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:48,781 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:48,781 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:48,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash 292105676, now seen corresponding path program 33 times [2019-09-07 10:36:48,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:48,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:48,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:36:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 14 proven. 900 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2019-09-07 10:36:49,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:49,507 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) [2019-09-07 10:36:49,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:36:50,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-07 10:36:50,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:50,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-07 10:36:50,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:50,534 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:36:50,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:36:50,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:36:50,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:36:50,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:36:52,811 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_29| Int) (|v_main_~#b~0.base_BEFORE_CALL_29| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_29| |v_main_~#b~0.base_BEFORE_CALL_29|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_29|) 28) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_29|) 28)))) is different from true [2019-09-07 10:36:54,892 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_30| Int) (|v_main_~#b~0.base_BEFORE_CALL_30| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_30| |v_main_~#b~0.base_BEFORE_CALL_30|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_30|) 28) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_30|) 28)))) is different from true [2019-09-07 10:36:56,986 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_31| Int) (|v_main_~#a~0.base_BEFORE_CALL_31| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_31| |v_main_~#b~0.base_BEFORE_CALL_31|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_31|) 28) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_31|) 28)))) is different from true [2019-09-07 10:36:59,075 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_32| Int) (|v_main_~#b~0.base_BEFORE_CALL_32| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_32|) 28) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_32|) 28)) (not (= |v_main_~#a~0.base_BEFORE_CALL_32| |v_main_~#b~0.base_BEFORE_CALL_32|)))) is different from true [2019-09-07 10:37:01,169 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_33| Int) (|v_main_~#b~0.base_BEFORE_CALL_33| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_33|) 28) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_33|) 28)) (not (= |v_main_~#a~0.base_BEFORE_CALL_33| |v_main_~#b~0.base_BEFORE_CALL_33|)))) is different from true [2019-09-07 10:37:03,297 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_34| Int) (|v_main_~#a~0.base_BEFORE_CALL_34| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_34| |v_main_~#b~0.base_BEFORE_CALL_34|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_34|) 28) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_34|) 28)))) is different from true [2019-09-07 10:37:05,432 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_35| Int) (|v_main_~#a~0.base_BEFORE_CALL_35| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_35| |v_main_~#b~0.base_BEFORE_CALL_35|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_35|) 28) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_35|) 28)))) is different from true [2019-09-07 10:37:05,534 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:37:05,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:37:05,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:37:05,539 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:37:05,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:37:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 0 proven. 514 refuted. 0 times theorem prover too weak. 1445 trivial. 98 not checked. [2019-09-07 10:37:05,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:37:05,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 63 [2019-09-07 10:37:05,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 10:37:05,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 10:37:05,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=2276, Unknown=7, NotChecked=798, Total=3906 [2019-09-07 10:37:05,740 INFO L87 Difference]: Start difference. First operand 201 states and 203 transitions. Second operand 63 states. [2019-09-07 10:37:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:37:07,633 INFO L93 Difference]: Finished difference Result 283 states and 287 transitions. [2019-09-07 10:37:07,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 10:37:07,633 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 198 [2019-09-07 10:37:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:37:07,635 INFO L225 Difference]: With dead ends: 283 [2019-09-07 10:37:07,635 INFO L226 Difference]: Without dead ends: 214 [2019-09-07 10:37:07,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 162 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2092 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1461, Invalid=5202, Unknown=7, NotChecked=1162, Total=7832 [2019-09-07 10:37:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-07 10:37:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-09-07 10:37:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-07 10:37:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 213 transitions. [2019-09-07 10:37:07,647 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 213 transitions. Word has length 198 [2019-09-07 10:37:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:37:07,647 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 213 transitions. [2019-09-07 10:37:07,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 10:37:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 213 transitions. [2019-09-07 10:37:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-07 10:37:07,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:37:07,649 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:37:07,649 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:37:07,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:37:07,650 INFO L82 PathProgramCache]: Analyzing trace with hash 306537720, now seen corresponding path program 34 times [2019-09-07 10:37:07,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:37:07,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:37:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:07,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:37:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:37:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 16 proven. 961 refuted. 0 times theorem prover too weak. 1201 trivial. 0 not checked. [2019-09-07 10:37:08,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:37:08,469 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) [2019-09-07 10:37:08,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:37:08,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:37:08,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:37:08,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:37:08,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:37:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-09-07 10:37:08,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:37:08,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:37:08,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:37:08,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:37:08,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:37:08,670 INFO L87 Difference]: Start difference. First operand 211 states and 213 transitions. Second operand 35 states. [2019-09-07 10:37:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:37:08,810 INFO L93 Difference]: Finished difference Result 356 states and 360 transitions. [2019-09-07 10:37:08,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:37:08,810 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 208 [2019-09-07 10:37:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:37:08,811 INFO L225 Difference]: With dead ends: 356 [2019-09-07 10:37:08,811 INFO L226 Difference]: Without dead ends: 214 [2019-09-07 10:37:08,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:37:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-07 10:37:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-09-07 10:37:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-07 10:37:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-09-07 10:37:08,824 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 208 [2019-09-07 10:37:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:37:08,824 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-09-07 10:37:08,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:37:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-09-07 10:37:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-07 10:37:08,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:37:08,826 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:37:08,826 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:37:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:37:08,826 INFO L82 PathProgramCache]: Analyzing trace with hash -457285830, now seen corresponding path program 35 times [2019-09-07 10:37:08,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:37:08,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:37:08,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:08,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:37:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:37:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 16 proven. 961 refuted. 0 times theorem prover too weak. 1264 trivial. 0 not checked. [2019-09-07 10:37:09,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:37:09,343 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:37:09,356 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:39:28,841 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-09-07 10:39:28,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:39:28,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:39:28,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:39:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-09-07 10:39:29,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:39:29,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 67 [2019-09-07 10:39:29,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 10:39:29,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 10:39:29,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 10:39:29,764 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 67 states. [2019-09-07 10:39:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:39:30,034 INFO L93 Difference]: Finished difference Result 361 states and 367 transitions. [2019-09-07 10:39:30,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 10:39:30,040 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 210 [2019-09-07 10:39:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:39:30,041 INFO L225 Difference]: With dead ends: 361 [2019-09-07 10:39:30,041 INFO L226 Difference]: Without dead ends: 219 [2019-09-07 10:39:30,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 10:39:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-07 10:39:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-09-07 10:39:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-07 10:39:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-09-07 10:39:30,053 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 210 [2019-09-07 10:39:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:39:30,053 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-09-07 10:39:30,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 10:39:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-09-07 10:39:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-07 10:39:30,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:39:30,055 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:39:30,055 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:39:30,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:39:30,056 INFO L82 PathProgramCache]: Analyzing trace with hash 528413848, now seen corresponding path program 36 times [2019-09-07 10:39:30,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:39:30,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:39:30,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:39:30,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:39:30,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:39:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:39:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2369 backedges. 16 proven. 1024 refuted. 0 times theorem prover too weak. 1329 trivial. 0 not checked. [2019-09-07 10:39:30,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:39:30,603 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:39:30,613 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:40:49,210 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-09-07 10:40:49,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:40:49,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:40:49,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:40:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2369 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2019-09-07 10:40:50,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:40:50,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 69 [2019-09-07 10:40:50,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 10:40:50,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 10:40:50,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:40:50,143 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 69 states. [2019-09-07 10:40:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:40:50,494 INFO L93 Difference]: Finished difference Result 367 states and 373 transitions. [2019-09-07 10:40:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 10:40:50,494 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 214 [2019-09-07 10:40:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:40:50,495 INFO L225 Difference]: With dead ends: 367 [2019-09-07 10:40:50,496 INFO L226 Difference]: Without dead ends: 223 [2019-09-07 10:40:50,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:40:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-07 10:40:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-09-07 10:40:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-07 10:40:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 223 transitions. [2019-09-07 10:40:50,508 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 223 transitions. Word has length 214 [2019-09-07 10:40:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:40:50,509 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 223 transitions. [2019-09-07 10:40:50,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 10:40:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 223 transitions. [2019-09-07 10:40:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 10:40:50,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:40:50,511 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:40:50,511 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:40:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:40:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash -135972490, now seen corresponding path program 37 times [2019-09-07 10:40:50,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:40:50,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:40:50,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:40:50,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:40:50,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:40:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:40:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 16 proven. 1089 refuted. 0 times theorem prover too weak. 1396 trivial. 0 not checked. [2019-09-07 10:40:51,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:40:51,402 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) [2019-09-07 10:40:51,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:40:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:40:51,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:40:51,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:40:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1345 trivial. 0 not checked. [2019-09-07 10:40:52,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:40:52,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 71 [2019-09-07 10:40:52,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-07 10:40:52,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-07 10:40:52,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:40:52,547 INFO L87 Difference]: Start difference. First operand 221 states and 223 transitions. Second operand 71 states. [2019-09-07 10:40:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:40:52,862 INFO L93 Difference]: Finished difference Result 373 states and 379 transitions. [2019-09-07 10:40:52,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 10:40:52,868 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 218 [2019-09-07 10:40:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:40:52,869 INFO L225 Difference]: With dead ends: 373 [2019-09-07 10:40:52,869 INFO L226 Difference]: Without dead ends: 227 [2019-09-07 10:40:52,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:40:52,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-07 10:40:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2019-09-07 10:40:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-07 10:40:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 227 transitions. [2019-09-07 10:40:52,883 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 227 transitions. Word has length 218 [2019-09-07 10:40:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:40:52,883 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 227 transitions. [2019-09-07 10:40:52,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-07 10:40:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 227 transitions. [2019-09-07 10:40:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 10:40:52,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:40:52,885 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:40:52,885 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:40:52,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:40:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1209807404, now seen corresponding path program 38 times [2019-09-07 10:40:52,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:40:52,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:40:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:40:52,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:40:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:40:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:40:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2637 backedges. 16 proven. 1156 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2019-09-07 10:40:53,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:40:53,502 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) [2019-09-07 10:40:53,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:40:53,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:40:53,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:40:53,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:40:53,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:40:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2637 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1412 trivial. 0 not checked. [2019-09-07 10:40:54,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:40:54,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 73 [2019-09-07 10:40:54,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-07 10:40:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-07 10:40:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 10:40:54,714 INFO L87 Difference]: Start difference. First operand 225 states and 227 transitions. Second operand 73 states. [2019-09-07 10:40:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:40:55,072 INFO L93 Difference]: Finished difference Result 379 states and 385 transitions. [2019-09-07 10:40:55,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-07 10:40:55,073 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 222 [2019-09-07 10:40:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:40:55,074 INFO L225 Difference]: With dead ends: 379 [2019-09-07 10:40:55,074 INFO L226 Difference]: Without dead ends: 231 [2019-09-07 10:40:55,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 10:40:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-09-07 10:40:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-09-07 10:40:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-07 10:40:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 231 transitions. [2019-09-07 10:40:55,086 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 231 transitions. Word has length 222 [2019-09-07 10:40:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:40:55,086 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 231 transitions. [2019-09-07 10:40:55,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-07 10:40:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 231 transitions. [2019-09-07 10:40:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-07 10:40:55,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:40:55,088 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:40:55,088 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:40:55,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:40:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1291497038, now seen corresponding path program 39 times [2019-09-07 10:40:55,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:40:55,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:40:55,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:40:55,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:40:55,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:40:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:40:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2777 backedges. 16 proven. 1225 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2019-09-07 10:40:55,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:40:55,984 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:40:56,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:40:58,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-07 10:40:58,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:40:58,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-07 10:40:58,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:40:58,355 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:40:58,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:40:58,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:40:58,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:40:58,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:41:00,741 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_37| Int) (|v_main_~#b~0.base_BEFORE_CALL_37| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_37|) 32) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_37|) 32)) (not (= |v_main_~#a~0.base_BEFORE_CALL_37| |v_main_~#b~0.base_BEFORE_CALL_37|)))) is different from true [2019-09-07 10:41:02,834 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_38| Int) (|v_main_~#a~0.base_BEFORE_CALL_38| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_38|) 32) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_38|) 32)) (not (= |v_main_~#a~0.base_BEFORE_CALL_38| |v_main_~#b~0.base_BEFORE_CALL_38|)))) is different from true [2019-09-07 10:41:04,978 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_39| Int) (|v_main_~#a~0.base_BEFORE_CALL_39| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_39|) 32) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_39|) 32)) (not (= |v_main_~#a~0.base_BEFORE_CALL_39| |v_main_~#b~0.base_BEFORE_CALL_39|)))) is different from true [2019-09-07 10:41:07,078 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_40| Int) (|v_main_~#b~0.base_BEFORE_CALL_40| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_40|) 32) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_40|) 32)) (not (= |v_main_~#a~0.base_BEFORE_CALL_40| |v_main_~#b~0.base_BEFORE_CALL_40|)))) is different from true [2019-09-07 10:41:09,178 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_41| Int) (|v_main_~#b~0.base_BEFORE_CALL_41| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_41| |v_main_~#b~0.base_BEFORE_CALL_41|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_41|) 32) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_41|) 32)))) is different from true [2019-09-07 10:41:11,281 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_42| Int) (|v_main_~#a~0.base_BEFORE_CALL_42| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_42|) 32) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_42|) 32)) (not (= |v_main_~#a~0.base_BEFORE_CALL_42| |v_main_~#b~0.base_BEFORE_CALL_42|)))) is different from true [2019-09-07 10:41:13,404 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_43| Int) (|v_main_~#b~0.base_BEFORE_CALL_43| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_43|) 32) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_43|) 32)) (not (= |v_main_~#a~0.base_BEFORE_CALL_43| |v_main_~#b~0.base_BEFORE_CALL_43|)))) is different from true [2019-09-07 10:41:15,521 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_44| Int) (|v_main_~#b~0.base_BEFORE_CALL_44| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_44| |v_main_~#b~0.base_BEFORE_CALL_44|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_44|) 32) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_44|) 32)))) is different from true [2019-09-07 10:41:17,570 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 10:41:19,619 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-07 10:41:19,737 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:19,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:41:19,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:41:19,741 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:19,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 10:41:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2777 backedges. 0 proven. 678 refuted. 0 times theorem prover too weak. 1972 trivial. 127 not checked. [2019-09-07 10:41:22,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:22,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 73 [2019-09-07 10:41:22,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-07 10:41:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-07 10:41:22,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=3103, Unknown=9, NotChecked=1064, Total=5256 [2019-09-07 10:41:22,002 INFO L87 Difference]: Start difference. First operand 229 states and 231 transitions. Second operand 73 states. [2019-09-07 10:41:26,099 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-07 10:41:32,366 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:41:36,444 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:41:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:38,594 INFO L93 Difference]: Finished difference Result 319 states and 323 transitions. [2019-09-07 10:41:38,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-07 10:41:38,595 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 226 [2019-09-07 10:41:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:38,597 INFO L225 Difference]: With dead ends: 319 [2019-09-07 10:41:38,597 INFO L226 Difference]: Without dead ends: 242 [2019-09-07 10:41:38,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 184 SyntacticMatches, 8 SemanticMatches, 104 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2945 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=1950, Invalid=7578, Unknown=10, NotChecked=1592, Total=11130 [2019-09-07 10:41:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-07 10:41:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2019-09-07 10:41:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-07 10:41:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 241 transitions. [2019-09-07 10:41:38,611 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 241 transitions. Word has length 226 [2019-09-07 10:41:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:38,611 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 241 transitions. [2019-09-07 10:41:38,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-07 10:41:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 241 transitions. [2019-09-07 10:41:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-07 10:41:38,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:38,613 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:38,613 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2061784738, now seen corresponding path program 40 times [2019-09-07 10:41:38,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:38,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:38,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:41:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 18 proven. 1296 refuted. 0 times theorem prover too weak. 1602 trivial. 0 not checked. [2019-09-07 10:41:39,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:39,333 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:41:39,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:41:39,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:41:39,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:41:39,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 10:41:39,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2019-09-07 10:41:39,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:39,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-07 10:41:39,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 10:41:39,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 10:41:39,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:41:39,570 INFO L87 Difference]: Start difference. First operand 239 states and 241 transitions. Second operand 40 states. [2019-09-07 10:41:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:39,709 INFO L93 Difference]: Finished difference Result 402 states and 406 transitions. [2019-09-07 10:41:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:41:39,710 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 236 [2019-09-07 10:41:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:39,711 INFO L225 Difference]: With dead ends: 402 [2019-09-07 10:41:39,711 INFO L226 Difference]: Without dead ends: 242 [2019-09-07 10:41:39,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:41:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-07 10:41:39,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-09-07 10:41:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-07 10:41:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-09-07 10:41:39,724 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 236 [2019-09-07 10:41:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:39,724 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-09-07 10:41:39,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 10:41:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-09-07 10:41:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-07 10:41:39,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:39,726 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:39,726 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash 525503648, now seen corresponding path program 41 times [2019-09-07 10:41:39,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:39,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:39,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:41:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2989 backedges. 18 proven. 1296 refuted. 0 times theorem prover too weak. 1675 trivial. 0 not checked. [2019-09-07 10:41:40,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:40,500 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) [2019-09-07 10:41:40,514 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000