/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sep05-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:28:01,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:28:01,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:28:01,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:28:01,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:28:01,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:28:01,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:28:01,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:28:01,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:28:01,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:28:01,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:28:01,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:28:01,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:28:01,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:28:01,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:28:01,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:28:01,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:28:01,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:28:01,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:28:01,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:28:01,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:28:01,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:28:01,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:28:01,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:28:01,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:28:01,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:28:01,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:28:01,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:28:01,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:28:01,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:28:01,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:28:01,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:28:01,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:28:01,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:28:01,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:28:01,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:28:01,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:28:01,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:28:01,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:28:01,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:28:01,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:28:01,375 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-11-23 22:28:01,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:28:01,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:28:01,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:28:01,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:28:01,399 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:28:01,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:28:01,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:28:01,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:28:01,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:28:01,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:28:01,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:28:01,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:28:01,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:28:01,402 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:28:01,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:28:01,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:28:01,402 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:28:01,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:28:01,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:28:01,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:28:01,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:28:01,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:28:01,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:28:01,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:28:01,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:28:01,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:28:01,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:28:01,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:28:01,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:28:01,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:28:01,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:28:01,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:28:01,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:28:01,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:28:01,708 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:28:01,708 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep05-1.i [2019-11-23 22:28:01,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ac2fa67/10b3c9bc4ccc41eaba863396c2c2d2f6/FLAG3b6634a32 [2019-11-23 22:28:02,220 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:28:02,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep05-1.i [2019-11-23 22:28:02,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ac2fa67/10b3c9bc4ccc41eaba863396c2c2d2f6/FLAG3b6634a32 [2019-11-23 22:28:02,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ac2fa67/10b3c9bc4ccc41eaba863396c2c2d2f6 [2019-11-23 22:28:02,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:28:02,615 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:28:02,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:28:02,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:28:02,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:28:02,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:02,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1edaf0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02, skipping insertion in model container [2019-11-23 22:28:02,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:02,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:28:02,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:28:02,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:28:02,870 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:28:02,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:28:02,940 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:28:02,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02 WrapperNode [2019-11-23 22:28:02,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:28:02,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:28:02,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:28:02,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:28:02,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:03,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:03,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:28:03,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:28:03,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:28:03,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:28:03,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:03,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:03,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:03,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:03,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:03,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:03,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (1/1) ... [2019-11-23 22:28:03,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:28:03,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:28:03,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:28:03,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:28:03,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (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-11-23 22:28:03,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 22:28:03,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:28:03,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:28:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 22:28:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 22:28:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 22:28:03,656 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:28:03,657 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-23 22:28:03,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:03 BoogieIcfgContainer [2019-11-23 22:28:03,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:28:03,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:28:03,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:28:03,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:28:03,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:28:02" (1/3) ... [2019-11-23 22:28:03,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@812e8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:03, skipping insertion in model container [2019-11-23 22:28:03,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:02" (2/3) ... [2019-11-23 22:28:03,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@812e8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:03, skipping insertion in model container [2019-11-23 22:28:03,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:03" (3/3) ... [2019-11-23 22:28:03,668 INFO L109 eAbstractionObserver]: Analyzing ICFG sep05-1.i [2019-11-23 22:28:03,678 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:28:03,685 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:28:03,696 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:28:03,724 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:28:03,724 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:28:03,725 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:28:03,725 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:28:03,725 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:28:03,725 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:28:03,725 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:28:03,725 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:28:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-23 22:28:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:28:03,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:03,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:03,748 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:03,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:03,754 INFO L82 PathProgramCache]: Analyzing trace with hash -23080620, now seen corresponding path program 1 times [2019-11-23 22:28:03,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:03,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17245587] [2019-11-23 22:28:03,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:28:03,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17245587] [2019-11-23 22:28:03,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:28:03,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:28:03,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219463526] [2019-11-23 22:28:03,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 22:28:03,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 22:28:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:28:03,902 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-23 22:28:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:03,918 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2019-11-23 22:28:03,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 22:28:03,920 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-11-23 22:28:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:03,927 INFO L225 Difference]: With dead ends: 56 [2019-11-23 22:28:03,928 INFO L226 Difference]: Without dead ends: 26 [2019-11-23 22:28:03,931 INFO L630 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-11-23 22:28:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-23 22:28:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-23 22:28:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-23 22:28:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-23 22:28:03,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2019-11-23 22:28:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:03,962 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-23 22:28:03,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 22:28:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-23 22:28:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:28:03,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:03,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:03,964 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:03,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:03,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1060874985, now seen corresponding path program 1 times [2019-11-23 22:28:03,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:03,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989344989] [2019-11-23 22:28:03,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:28:04,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989344989] [2019-11-23 22:28:04,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:28:04,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:28:04,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640267419] [2019-11-23 22:28:04,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:28:04,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:04,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:28:04,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:28:04,027 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 3 states. [2019-11-23 22:28:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:04,052 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2019-11-23 22:28:04,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:28:04,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:28:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:04,054 INFO L225 Difference]: With dead ends: 50 [2019-11-23 22:28:04,054 INFO L226 Difference]: Without dead ends: 28 [2019-11-23 22:28:04,055 INFO L630 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-11-23 22:28:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-23 22:28:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-23 22:28:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 22:28:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-23 22:28:04,062 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 17 [2019-11-23 22:28:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:04,062 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-23 22:28:04,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:28:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-11-23 22:28:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:28:04,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:04,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:04,064 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash -507200985, now seen corresponding path program 1 times [2019-11-23 22:28:04,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:04,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592867132] [2019-11-23 22:28:04,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:28:04,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592867132] [2019-11-23 22:28:04,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:28:04,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:28:04,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607706431] [2019-11-23 22:28:04,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:28:04,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:04,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:28:04,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:28:04,129 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 3 states. [2019-11-23 22:28:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:04,197 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-11-23 22:28:04,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:28:04,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:28:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:04,198 INFO L225 Difference]: With dead ends: 54 [2019-11-23 22:28:04,198 INFO L226 Difference]: Without dead ends: 36 [2019-11-23 22:28:04,199 INFO L630 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-11-23 22:28:04,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-23 22:28:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-11-23 22:28:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 22:28:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-23 22:28:04,205 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 19 [2019-11-23 22:28:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:04,206 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-23 22:28:04,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:28:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-23 22:28:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:28:04,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:04,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:04,207 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:04,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1833868074, now seen corresponding path program 1 times [2019-11-23 22:28:04,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:04,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219958116] [2019-11-23 22:28:04,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:28:04,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219958116] [2019-11-23 22:28:04,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:28:04,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:28:04,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177847194] [2019-11-23 22:28:04,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:28:04,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:04,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:28:04,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:28:04,315 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 3 states. [2019-11-23 22:28:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:04,338 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-11-23 22:28:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:28:04,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:28:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:04,341 INFO L225 Difference]: With dead ends: 42 [2019-11-23 22:28:04,341 INFO L226 Difference]: Without dead ends: 32 [2019-11-23 22:28:04,342 INFO L630 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-11-23 22:28:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-23 22:28:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-23 22:28:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-23 22:28:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-23 22:28:04,348 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 28 [2019-11-23 22:28:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:04,348 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-23 22:28:04,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:28:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-11-23 22:28:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:28:04,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:04,350 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:04,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:04,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1777663060, now seen corresponding path program 1 times [2019-11-23 22:28:04,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:04,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754785297] [2019-11-23 22:28:04,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:28:04,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754785297] [2019-11-23 22:28:04,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014104565] [2019-11-23 22:28:04,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:04,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:28:04,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:28:04,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:04,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-23 22:28:04,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952866899] [2019-11-23 22:28:04,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:28:04,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:04,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:28:04,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:28:04,604 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-11-23 22:28:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:04,643 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-11-23 22:28:04,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:28:04,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-23 22:28:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:04,647 INFO L225 Difference]: With dead ends: 60 [2019-11-23 22:28:04,647 INFO L226 Difference]: Without dead ends: 34 [2019-11-23 22:28:04,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-11-23 22:28:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-23 22:28:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-23 22:28:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 22:28:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-23 22:28:04,660 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 30 [2019-11-23 22:28:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:04,660 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-23 22:28:04,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:28:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-11-23 22:28:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:28:04,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:04,662 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:04,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:04,863 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:04,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash -861329106, now seen corresponding path program 2 times [2019-11-23 22:28:04,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:04,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19312533] [2019-11-23 22:28:04,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:28:05,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19312533] [2019-11-23 22:28:05,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674240204] [2019-11-23 22:28:05,010 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:05,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:28:05,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:28:05,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 22:28:05,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:28:05,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:05,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-23 22:28:05,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260238018] [2019-11-23 22:28:05,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:28:05,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:28:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:28:05,111 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2019-11-23 22:28:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:05,149 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2019-11-23 22:28:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:28:05,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-23 22:28:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:05,151 INFO L225 Difference]: With dead ends: 62 [2019-11-23 22:28:05,151 INFO L226 Difference]: Without dead ends: 36 [2019-11-23 22:28:05,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-11-23 22:28:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-23 22:28:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-11-23 22:28:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-23 22:28:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-11-23 22:28:05,162 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 32 [2019-11-23 22:28:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:05,163 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-23 22:28:05,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:28:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-11-23 22:28:05,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:28:05,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:05,164 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:05,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:05,369 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:05,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:05,370 INFO L82 PathProgramCache]: Analyzing trace with hash -732694992, now seen corresponding path program 3 times [2019-11-23 22:28:05,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:05,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91071277] [2019-11-23 22:28:05,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:28:05,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91071277] [2019-11-23 22:28:05,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165913962] [2019-11-23 22:28:05,441 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:05,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-23 22:28:05,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:28:05,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:28:05,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 22:28:05,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:05,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-23 22:28:05,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864418886] [2019-11-23 22:28:05,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:28:05,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:05,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:28:05,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:28:05,582 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 8 states. [2019-11-23 22:28:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:05,695 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2019-11-23 22:28:05,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:28:05,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-23 22:28:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:05,698 INFO L225 Difference]: With dead ends: 79 [2019-11-23 22:28:05,698 INFO L226 Difference]: Without dead ends: 53 [2019-11-23 22:28:05,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:28:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-23 22:28:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2019-11-23 22:28:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-23 22:28:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-11-23 22:28:05,709 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 34 [2019-11-23 22:28:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:05,709 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-23 22:28:05,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:28:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-11-23 22:28:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 22:28:05,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:05,713 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:05,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:05,926 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:05,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:05,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1535236799, now seen corresponding path program 4 times [2019-11-23 22:28:05,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:05,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172404463] [2019-11-23 22:28:05,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:28:06,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172404463] [2019-11-23 22:28:06,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663178737] [2019-11-23 22:28:06,069 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:06,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:28:06,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:28:06,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 22:28:06,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-23 22:28:06,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:06,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-23 22:28:06,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911034106] [2019-11-23 22:28:06,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:28:06,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:06,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:28:06,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:28:06,174 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 10 states. [2019-11-23 22:28:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:06,278 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2019-11-23 22:28:06,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:28:06,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-23 22:28:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:06,280 INFO L225 Difference]: With dead ends: 98 [2019-11-23 22:28:06,280 INFO L226 Difference]: Without dead ends: 63 [2019-11-23 22:28:06,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:28:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-23 22:28:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-11-23 22:28:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-23 22:28:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2019-11-23 22:28:06,288 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 45 [2019-11-23 22:28:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:06,289 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-11-23 22:28:06,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:28:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2019-11-23 22:28:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:28:06,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:06,290 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:06,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:06,494 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:06,495 INFO L82 PathProgramCache]: Analyzing trace with hash -326050476, now seen corresponding path program 5 times [2019-11-23 22:28:06,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:06,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266362907] [2019-11-23 22:28:06,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-23 22:28:06,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266362907] [2019-11-23 22:28:06,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84269134] [2019-11-23 22:28:06,643 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:06,751 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-23 22:28:06,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:28:06,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 22:28:06,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-23 22:28:06,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:06,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2019-11-23 22:28:06,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274003917] [2019-11-23 22:28:06,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:28:06,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:28:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:28:06,811 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 8 states. [2019-11-23 22:28:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:06,911 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2019-11-23 22:28:06,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:28:06,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-11-23 22:28:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:06,913 INFO L225 Difference]: With dead ends: 108 [2019-11-23 22:28:06,913 INFO L226 Difference]: Without dead ends: 75 [2019-11-23 22:28:06,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:28:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-23 22:28:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2019-11-23 22:28:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 22:28:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2019-11-23 22:28:06,931 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 56 [2019-11-23 22:28:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:06,931 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2019-11-23 22:28:06,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:28:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2019-11-23 22:28:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:28:06,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:06,935 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:07,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:07,140 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:07,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1510106789, now seen corresponding path program 6 times [2019-11-23 22:28:07,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:07,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872793812] [2019-11-23 22:28:07,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-23 22:28:07,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872793812] [2019-11-23 22:28:07,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764667159] [2019-11-23 22:28:07,290 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:07,389 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-23 22:28:07,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:28:07,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 22:28:07,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 22:28:07,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:07,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-23 22:28:07,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461613034] [2019-11-23 22:28:07,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:28:07,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:28:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:28:07,451 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 10 states. [2019-11-23 22:28:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:07,549 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2019-11-23 22:28:07,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:28:07,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-11-23 22:28:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:07,553 INFO L225 Difference]: With dead ends: 121 [2019-11-23 22:28:07,553 INFO L226 Difference]: Without dead ends: 80 [2019-11-23 22:28:07,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:28:07,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-23 22:28:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-11-23 22:28:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-23 22:28:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2019-11-23 22:28:07,572 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 67 [2019-11-23 22:28:07,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:07,572 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2019-11-23 22:28:07,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:28:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2019-11-23 22:28:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 22:28:07,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:07,574 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:07,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:07,775 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:07,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:07,775 INFO L82 PathProgramCache]: Analyzing trace with hash 844556664, now seen corresponding path program 7 times [2019-11-23 22:28:07,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:07,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261284289] [2019-11-23 22:28:07,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-23 22:28:07,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261284289] [2019-11-23 22:28:07,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813965815] [2019-11-23 22:28:07,888 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:07,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 22:28:08,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-23 22:28:08,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:08,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-23 22:28:08,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344083940] [2019-11-23 22:28:08,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:28:08,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:08,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:28:08,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:28:08,036 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 7 states. [2019-11-23 22:28:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:08,059 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2019-11-23 22:28:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:28:08,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2019-11-23 22:28:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:08,061 INFO L225 Difference]: With dead ends: 103 [2019-11-23 22:28:08,061 INFO L226 Difference]: Without dead ends: 81 [2019-11-23 22:28:08,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 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-11-23 22:28:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-23 22:28:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-11-23 22:28:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-23 22:28:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2019-11-23 22:28:08,069 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 78 [2019-11-23 22:28:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:08,069 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-11-23 22:28:08,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:28:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2019-11-23 22:28:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 22:28:08,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:08,071 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:08,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:08,277 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash -729603206, now seen corresponding path program 8 times [2019-11-23 22:28:08,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:08,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24159526] [2019-11-23 22:28:08,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-23 22:28:09,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24159526] [2019-11-23 22:28:09,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876568300] [2019-11-23 22:28:09,733 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:09,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:28:09,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:28:09,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-23 22:28:09,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:09,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:10,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-23 22:28:12,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:12,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30] total 38 [2019-11-23 22:28:12,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648516074] [2019-11-23 22:28:12,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-23 22:28:12,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:12,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-23 22:28:12,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1260, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 22:28:12,824 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 38 states. [2019-11-23 22:28:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:14,873 INFO L93 Difference]: Finished difference Result 588 states and 711 transitions. [2019-11-23 22:28:14,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-23 22:28:14,873 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-11-23 22:28:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:14,879 INFO L225 Difference]: With dead ends: 588 [2019-11-23 22:28:14,879 INFO L226 Difference]: Without dead ends: 583 [2019-11-23 22:28:14,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 58 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=186, Invalid=1536, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 22:28:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-11-23 22:28:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 216. [2019-11-23 22:28:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 22:28:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 288 transitions. [2019-11-23 22:28:14,907 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 288 transitions. Word has length 80 [2019-11-23 22:28:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:14,908 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 288 transitions. [2019-11-23 22:28:14,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-23 22:28:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 288 transitions. [2019-11-23 22:28:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 22:28:14,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:14,910 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:15,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:15,114 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:15,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:15,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1045404156, now seen corresponding path program 1 times [2019-11-23 22:28:15,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:15,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716760720] [2019-11-23 22:28:15,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-23 22:28:16,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716760720] [2019-11-23 22:28:16,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243060509] [2019-11-23 22:28:16,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:16,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-23 22:28:16,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:16,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:16,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-11-23 22:28:16,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:16,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:16,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:16,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2019-11-23 22:28:16,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:28:16,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:16,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:16,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:16,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2019-11-23 22:28:16,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 22:28:16,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:16,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:16,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:16,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2019-11-23 22:28:16,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:28:16,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:16,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:16,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:16,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2019-11-23 22:28:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 9 proven. 35 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-23 22:28:16,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:16,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13] total 31 [2019-11-23 22:28:16,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611323519] [2019-11-23 22:28:16,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 22:28:16,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:16,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 22:28:16,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-11-23 22:28:16,754 INFO L87 Difference]: Start difference. First operand 216 states and 288 transitions. Second operand 31 states. [2019-11-23 22:28:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:22,364 INFO L93 Difference]: Finished difference Result 668 states and 880 transitions. [2019-11-23 22:28:22,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-11-23 22:28:22,364 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 80 [2019-11-23 22:28:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:22,368 INFO L225 Difference]: With dead ends: 668 [2019-11-23 22:28:22,368 INFO L226 Difference]: Without dead ends: 540 [2019-11-23 22:28:22,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2561 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=956, Invalid=8550, Unknown=0, NotChecked=0, Total=9506 [2019-11-23 22:28:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-23 22:28:22,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 350. [2019-11-23 22:28:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-23 22:28:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 457 transitions. [2019-11-23 22:28:22,411 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 457 transitions. Word has length 80 [2019-11-23 22:28:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:22,412 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 457 transitions. [2019-11-23 22:28:22,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 22:28:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 457 transitions. [2019-11-23 22:28:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 22:28:22,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:22,418 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:22,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:22,623 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:22,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1122630216, now seen corresponding path program 2 times [2019-11-23 22:28:22,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:22,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326711648] [2019-11-23 22:28:22,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 18 proven. 126 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:28:24,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326711648] [2019-11-23 22:28:24,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015173765] [2019-11-23 22:28:24,956 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:25,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:28:25,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:28:25,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 67 conjunts are in the unsatisfiable core [2019-11-23 22:28:25,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:25,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-11-23 22:28:25,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:25,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2019-11-23 22:28:25,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2019-11-23 22:28:25,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2019-11-23 22:28:25,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:25,436 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:25,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,450 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:82, output treesize:46 [2019-11-23 22:28:25,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:28:25,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,572 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:25,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 59 [2019-11-23 22:28:25,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,591 INFO L567 ElimStorePlain]: treesize reduction 17, result has 72.1 percent of original size [2019-11-23 22:28:25,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2019-11-23 22:28:25,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,712 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:25,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 52 [2019-11-23 22:28:25,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:25,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:46 [2019-11-23 22:28:25,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:25,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:25,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 38 [2019-11-23 22:28:25,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:25,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:38 [2019-11-23 22:28:25,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:25,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2019-11-23 22:28:25,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:25,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:25,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:22 [2019-11-23 22:28:26,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:28:26,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:26,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:26,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:26,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2019-11-23 22:28:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 18 proven. 90 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 22:28:26,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:26,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 47 [2019-11-23 22:28:26,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455919291] [2019-11-23 22:28:26,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-23 22:28:26,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:26,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-23 22:28:26,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1976, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 22:28:26,125 INFO L87 Difference]: Start difference. First operand 350 states and 457 transitions. Second operand 47 states. [2019-11-23 22:28:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:28:28,760 INFO L93 Difference]: Finished difference Result 859 states and 1130 transitions. [2019-11-23 22:28:28,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-23 22:28:28,761 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 80 [2019-11-23 22:28:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:28:28,764 INFO L225 Difference]: With dead ends: 859 [2019-11-23 22:28:28,764 INFO L226 Difference]: Without dead ends: 703 [2019-11-23 22:28:28,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 61 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=302, Invalid=3238, Unknown=0, NotChecked=0, Total=3540 [2019-11-23 22:28:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-11-23 22:28:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 612. [2019-11-23 22:28:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-11-23 22:28:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 810 transitions. [2019-11-23 22:28:28,811 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 810 transitions. Word has length 80 [2019-11-23 22:28:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:28:28,811 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 810 transitions. [2019-11-23 22:28:28,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-23 22:28:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 810 transitions. [2019-11-23 22:28:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 22:28:28,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:28:28,813 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:28:29,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:29,027 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:28:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:28:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1316409220, now seen corresponding path program 3 times [2019-11-23 22:28:29,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:28:29,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710301027] [2019-11-23 22:28:29,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:28:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:28:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 21 proven. 118 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 22:28:31,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710301027] [2019-11-23 22:28:31,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633874236] [2019-11-23 22:28:31,114 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:28:31,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-23 22:28:31,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:28:31,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 77 conjunts are in the unsatisfiable core [2019-11-23 22:28:31,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:28:31,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-23 22:28:31,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:31,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:31,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:31,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-23 22:28:31,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-11-23 22:28:31,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:31,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:31,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:31,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2019-11-23 22:28:31,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2019-11-23 22:28:31,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2019-11-23 22:28:31,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:31,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:31,776 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:31,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:31,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:31,787 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:82, output treesize:46 [2019-11-23 22:28:31,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:31,906 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:31,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 45 [2019-11-23 22:28:31,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:31,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:31,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:31,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:38 [2019-11-23 22:28:32,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,124 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-11-23 22:28:32,125 INFO L343 Elim1Store]: treesize reduction 84, result has 60.7 percent of original size [2019-11-23 22:28:32,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 151 [2019-11-23 22:28:32,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:32,182 INFO L567 ElimStorePlain]: treesize reduction 93, result has 45.6 percent of original size [2019-11-23 22:28:32,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:32,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:78 [2019-11-23 22:28:32,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,328 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-23 22:28:32,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:32,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:32,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 85 treesize of output 289 [2019-11-23 22:28:32,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:32,516 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:28:32,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:32,521 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:28:32,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2019-11-23 22:28:32,529 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:32,534 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-23 22:28:32,534 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:32,854 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 50 [2019-11-23 22:28:32,855 INFO L567 ElimStorePlain]: treesize reduction 873, result has 16.9 percent of original size [2019-11-23 22:28:32,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-23 22:28:32,855 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:293, output treesize:178 [2019-11-23 22:28:32,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:28:33,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 22:28:33,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:33,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:33,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:28:33,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:33,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 38 [2019-11-23 22:28:33,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:28:33,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:33,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:28:33,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2019-11-23 22:28:33,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:33,309 INFO L377 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 25 treesize of output 21 [2019-11-23 22:28:33,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:33,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 22:28:33,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:28:33,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-23 22:28:33,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2019-11-23 22:28:33,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:28:33,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:33,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:33,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:28:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 10 proven. 98 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 22:28:33,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:28:33,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 55 [2019-11-23 22:28:33,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60805005] [2019-11-23 22:28:33,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-23 22:28:33,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:28:33,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-23 22:28:33,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2682, Unknown=0, NotChecked=0, Total=2970 [2019-11-23 22:28:33,544 INFO L87 Difference]: Start difference. First operand 612 states and 810 transitions. Second operand 55 states. [2019-11-23 22:28:57,697 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-11-23 22:29:32,304 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-11-23 22:29:32,943 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-11-23 22:29:33,164 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2019-11-23 22:29:33,765 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-11-23 22:29:34,117 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-11-23 22:29:34,527 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91