/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/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:07:14,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:07:14,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:07:14,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:07:14,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:07:14,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:07:14,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:07:14,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:07:14,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:07:14,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:07:14,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:07:14,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:07:14,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:07:14,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:07:14,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:07:14,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:07:14,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:07:14,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:07:14,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:07:15,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:07:15,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:07:15,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:07:15,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:07:15,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:07:15,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:07:15,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:07:15,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:07:15,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:07:15,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:07:15,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:07:15,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:07:15,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:07:15,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:07:15,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:07:15,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:07:15,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:07:15,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:07:15,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:07:15,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:07:15,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:07:15,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:07:15,032 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:07:15,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:07:15,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:07:15,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:07:15,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:07:15,057 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:07:15,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:07:15,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:07:15,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:07:15,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:07:15,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:07:15,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:07:15,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:07:15,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:07:15,059 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:07:15,059 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:07:15,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:07:15,059 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:07:15,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:07:15,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:07:15,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:07:15,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:07:15,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:07:15,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:07:15,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:07:15,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:07:15,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:07:15,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:07:15,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:07:15,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:07:15,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:07:15,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:07:15,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:07:15,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:07:15,373 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:07:15,373 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:07:15,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2019-11-23 22:07:15,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067f4adf6/65943667365548409437e09cce8dfdd1/FLAG2ffb46a78 [2019-11-23 22:07:15,811 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:07:15,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2019-11-23 22:07:15,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067f4adf6/65943667365548409437e09cce8dfdd1/FLAG2ffb46a78 [2019-11-23 22:07:16,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067f4adf6/65943667365548409437e09cce8dfdd1 [2019-11-23 22:07:16,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:07:16,188 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:07:16,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:07:16,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:07:16,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:07:16,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:07:16" (1/1) ... [2019-11-23 22:07:16,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9aebed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16, skipping insertion in model container [2019-11-23 22:07:16,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:07:16" (1/1) ... [2019-11-23 22:07:16,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:07:16,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:07:16,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:07:16,468 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:07:16,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:07:16,524 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:07:16,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16 WrapperNode [2019-11-23 22:07:16,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:07:16,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:07:16,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:07:16,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:07:16,535 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:07:16" (1/1) ... [2019-11-23 22:07:16,554 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:07:16" (1/1) ... [2019-11-23 22:07:16,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:07:16,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:07:16,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:07:16,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:07:16,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16" (1/1) ... [2019-11-23 22:07:16,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16" (1/1) ... [2019-11-23 22:07:16,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16" (1/1) ... [2019-11-23 22:07:16,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16" (1/1) ... [2019-11-23 22:07:16,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16" (1/1) ... [2019-11-23 22:07:16,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16" (1/1) ... [2019-11-23 22:07:16,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16" (1/1) ... [2019-11-23 22:07:16,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:07:16,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:07:16,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:07:16,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:07:16,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16" (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:07:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:07:16,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:07:17,020 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:07:17,021 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:07:17,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:07:17 BoogieIcfgContainer [2019-11-23 22:07:17,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:07:17,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:07:17,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:07:17,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:07:17,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:07:16" (1/3) ... [2019-11-23 22:07:17,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245585d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:07:17, skipping insertion in model container [2019-11-23 22:07:17,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:07:16" (2/3) ... [2019-11-23 22:07:17,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245585d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:07:17, skipping insertion in model container [2019-11-23 22:07:17,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:07:17" (3/3) ... [2019-11-23 22:07:17,030 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2019-11-23 22:07:17,040 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:07:17,047 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:07:17,059 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:07:17,084 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:07:17,084 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:07:17,084 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:07:17,084 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:07:17,085 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:07:17,085 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:07:17,085 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:07:17,085 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:07:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-23 22:07:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-23 22:07:17,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:17,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-23 22:07:17,105 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:17,110 INFO L82 PathProgramCache]: Analyzing trace with hash 31771204, now seen corresponding path program 1 times [2019-11-23 22:07:17,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:17,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536381124] [2019-11-23 22:07:17,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:17,206 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:07:17,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536381124] [2019-11-23 22:07:17,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:17,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:07:17,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789809280] [2019-11-23 22:07:17,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 22:07:17,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:17,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 22:07:17,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:07:17,227 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-23 22:07:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:17,245 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2019-11-23 22:07:17,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 22:07:17,247 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-23 22:07:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:17,256 INFO L225 Difference]: With dead ends: 26 [2019-11-23 22:07:17,257 INFO L226 Difference]: Without dead ends: 16 [2019-11-23 22:07:17,260 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:07:17,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-23 22:07:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-23 22:07:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-23 22:07:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2019-11-23 22:07:17,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 5 [2019-11-23 22:07:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:17,293 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2019-11-23 22:07:17,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 22:07:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2019-11-23 22:07:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-23 22:07:17,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:17,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-23 22:07:17,295 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash 29864580, now seen corresponding path program 1 times [2019-11-23 22:07:17,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:17,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634332013] [2019-11-23 22:07:17,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:17,433 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:07:17,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634332013] [2019-11-23 22:07:17,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:17,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:07:17,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026287397] [2019-11-23 22:07:17,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:17,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:17,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:17,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:17,440 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 3 states. [2019-11-23 22:07:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:17,529 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2019-11-23 22:07:17,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:17,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-23 22:07:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:17,533 INFO L225 Difference]: With dead ends: 22 [2019-11-23 22:07:17,533 INFO L226 Difference]: Without dead ends: 18 [2019-11-23 22:07:17,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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:07:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-23 22:07:17,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-23 22:07:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-23 22:07:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2019-11-23 22:07:17,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 5 [2019-11-23 22:07:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:17,542 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 27 transitions. [2019-11-23 22:07:17,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 27 transitions. [2019-11-23 22:07:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:07:17,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:17,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:17,544 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:17,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:17,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1273519218, now seen corresponding path program 1 times [2019-11-23 22:07:17,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:17,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011256059] [2019-11-23 22:07:17,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:19,691 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2019-11-23 22:07:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:19,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011256059] [2019-11-23 22:07:19,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:19,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:19,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715642306] [2019-11-23 22:07:19,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:19,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:19,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:19,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:19,706 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand 3 states. [2019-11-23 22:07:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:19,860 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2019-11-23 22:07:19,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:19,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:07:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:19,862 INFO L225 Difference]: With dead ends: 47 [2019-11-23 22:07:19,863 INFO L226 Difference]: Without dead ends: 32 [2019-11-23 22:07:19,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:19,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-23 22:07:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-23 22:07:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 22:07:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-23 22:07:19,869 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2019-11-23 22:07:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:19,870 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-23 22:07:19,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2019-11-23 22:07:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:07:19,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:19,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:19,872 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:19,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:19,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1974583796, now seen corresponding path program 1 times [2019-11-23 22:07:19,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:19,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120491148] [2019-11-23 22:07:19,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:20,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120491148] [2019-11-23 22:07:20,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439268724] [2019-11-23 22:07:20,237 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:07:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:20,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 22:07:20,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:07:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:20,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:07:20,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-23 22:07:20,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871833194] [2019-11-23 22:07:20,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 22:07:20,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:20,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 22:07:20,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:07:20,411 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 14 states. [2019-11-23 22:07:20,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:20,660 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-11-23 22:07:20,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 22:07:20,662 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-11-23 22:07:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:20,663 INFO L225 Difference]: With dead ends: 45 [2019-11-23 22:07:20,663 INFO L226 Difference]: Without dead ends: 41 [2019-11-23 22:07:20,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:07:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-23 22:07:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-23 22:07:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 22:07:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2019-11-23 22:07:20,679 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 16 [2019-11-23 22:07:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:20,679 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-11-23 22:07:20,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 22:07:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2019-11-23 22:07:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:07:20,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:20,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:20,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:07:20,885 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:20,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:20,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1309266250, now seen corresponding path program 1 times [2019-11-23 22:07:20,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:20,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978675225] [2019-11-23 22:07:20,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:20,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978675225] [2019-11-23 22:07:20,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:20,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:20,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932964001] [2019-11-23 22:07:20,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:20,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:20,992 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 3 states. [2019-11-23 22:07:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:21,084 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-11-23 22:07:21,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:21,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:07:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:21,086 INFO L225 Difference]: With dead ends: 58 [2019-11-23 22:07:21,086 INFO L226 Difference]: Without dead ends: 43 [2019-11-23 22:07:21,086 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:07:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-23 22:07:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-11-23 22:07:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 22:07:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-23 22:07:21,095 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 16 [2019-11-23 22:07:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:21,095 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-23 22:07:21,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-23 22:07:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:07:21,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:21,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:21,098 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1301479604, now seen corresponding path program 1 times [2019-11-23 22:07:21,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:21,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241146289] [2019-11-23 22:07:21,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:25,421 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 40 DAG size of output: 18 [2019-11-23 22:07:27,462 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse3 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse11 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse3)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse14 (+ .cse18 (* 4294967296 .cse16))) (.cse2 (and .cse4 .cse5)) (.cse1 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse6 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse0 (or .cse1 .cse3 (< .cse6 c_ULTIMATE.start_main_~y~0))) (.cse12 (or (< .cse14 c_ULTIMATE.start_main_~y~0) .cse2)) (.cse10 (or .cse1 .cse3)) (.cse7 (+ .cse17 1)) (.cse13 (+ .cse16 1))) (and .cse0 (or .cse1 .cse2 .cse3) (or (and .cse4 .cse5 (<= c_ULTIMATE.start_main_~y~0 .cse6)) (and .cse4 .cse5 (<= .cse7 0)) (and .cse0 (let ((.cse8 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse9 (* 4 .cse11))) (or (and .cse4 .cse5 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 5))) (and (<= (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 1)) .cse10))) .cse12) (and .cse10 (<= .cse13 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse14) .cse10)) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse1 (not (= .cse6 c_ULTIMATE.start_main_~y~0)) .cse3) .cse12 (or (and (<= 0 .cse16) .cse10) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse7) .cse1 .cse3) (or .cse2 (< 0 .cse13)))) (or (not (= .cse14 c_ULTIMATE.start_main_~y~0)) .cse2)))))))) is different from false [2019-11-23 22:07:29,504 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse7))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse14 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse7 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse0 (not .cse14)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse11 (+ .cse18 (* 4294967296 .cse16))) (.cse13 (and .cse0 .cse1)) (.cse12 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse2 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse8 (or .cse12 .cse14 (< .cse2 c_ULTIMATE.start_main_~y~0))) (.cse9 (or (< .cse11 c_ULTIMATE.start_main_~y~0) .cse13)) (.cse4 (or .cse12 .cse14)) (.cse3 (+ .cse17 1)) (.cse10 (+ .cse16 1))) (and (or (and .cse0 .cse1 (<= c_ULTIMATE.start_main_~y~0 .cse2)) (and .cse0 .cse1 (<= .cse3 0)) (and (let ((.cse5 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse6 (* 4 .cse7))) (or (and .cse4 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 3))) (and .cse0 .cse1 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 4) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 7))))) .cse8 .cse9) (and .cse4 (<= .cse10 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse4)) .cse8 (or .cse12 .cse13 .cse14) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse12 (not (= .cse2 c_ULTIMATE.start_main_~y~0)) .cse14) .cse9 (or (and (<= 0 .cse16) .cse4) (and .cse0 .cse1 (<= 0 .cse17)) (and (or (< 0 .cse3) .cse12 .cse14) (or .cse13 (< 0 .cse10)))) (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse13)))))))) is different from false [2019-11-23 22:07:31,537 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse23 (* .cse12 (- 2)))) (let ((.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse7 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse17 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse17)) (.cse4 (not .cse19)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse7)) (.cse1 (* 4294967296 .cse16))) (let ((.cse21 (+ .cse0 .cse1)) (.cse20 (and .cse4 .cse5)) (.cse18 (<= .cse7 c_ULTIMATE.start_main_~y~0)) (.cse22 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse18 .cse19 (< .cse22 c_ULTIMATE.start_main_~y~0))) (.cse8 (or .cse18 (not (= .cse22 c_ULTIMATE.start_main_~y~0)) .cse19)) (.cse9 (or (< .cse21 c_ULTIMATE.start_main_~y~0) .cse20)) (.cse2 (or .cse18 .cse19)) (.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse13 (or (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse20))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (< .cse7 (+ c_ULTIMATE.start_main_~y~0 1)) .cse8 .cse9 (or (and .cse6 (let ((.cse10 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse11 (* 4 .cse12))) (or (and .cse2 (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse8 .cse9 .cse13) (and .cse4 .cse5 (<= .cse14 0)) (and .cse2 (<= .cse15 0))) (or (and (<= 0 .cse16) .cse2) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse14) .cse18 .cse19) (or .cse20 (< 0 .cse15)))) .cse13))))))) is different from false [2019-11-23 22:07:33,582 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse11)) (.cse23 (* .cse11 (- 2)))) (let ((.cse15 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse22 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse18 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse16)) (.cse4 (not .cse18)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse22)) (.cse1 (* 4294967296 .cse15))) (let ((.cse20 (+ .cse0 .cse1)) (.cse19 (and .cse4 .cse5)) (.cse17 (<= .cse22 c_ULTIMATE.start_main_~y~0)) (.cse21 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse17 .cse18 (< .cse21 c_ULTIMATE.start_main_~y~0))) (.cse7 (or .cse17 (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse18)) (.cse8 (or (< .cse20 c_ULTIMATE.start_main_~y~0) .cse19)) (.cse2 (or .cse17 .cse18)) (.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse12 (or (not (= .cse20 c_ULTIMATE.start_main_~y~0)) .cse19))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 .cse7 .cse8 (or (and (let ((.cse9 (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse10 (* 4 .cse11))) (or (and .cse4 .cse5 (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 5))) (and (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 1)) .cse2))) .cse6 .cse7 .cse8 .cse12) (and .cse4 .cse5 (<= .cse13 0)) (and .cse2 (<= .cse14 0))) (or (and (<= 0 .cse15) .cse2) (and .cse4 .cse5 (<= 0 .cse16)) (and (or (< 0 .cse13) .cse17 .cse18) (or .cse19 (< 0 .cse14)))) .cse12))))))) is different from false [2019-11-23 22:07:35,612 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse12 (* 2 .cse6)) (.cse23 (* .cse6 (- 2)))) (let ((.cse15 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse22 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse18 (= .cse12 c_ULTIMATE.start_main_~y~0)) (.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse14 (* 4294967296 .cse16)) (.cse3 (not .cse18)) (.cse4 (< c_ULTIMATE.start_main_~y~0 .cse22)) (.cse13 (* 4294967296 .cse15))) (let ((.cse20 (+ .cse12 .cse13)) (.cse19 (and .cse3 .cse4)) (.cse17 (<= .cse22 c_ULTIMATE.start_main_~y~0)) (.cse21 (+ .cse14 .cse12 2))) (let ((.cse0 (or .cse17 .cse18 (< .cse21 c_ULTIMATE.start_main_~y~0))) (.cse7 (or .cse17 (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse18)) (.cse8 (or (< .cse20 c_ULTIMATE.start_main_~y~0) .cse19)) (.cse5 (or .cse17 .cse18)) (.cse10 (+ .cse16 1)) (.cse11 (+ .cse15 1)) (.cse9 (or (not (= .cse20 c_ULTIMATE.start_main_~y~0)) .cse19))) (and (or (and .cse0 (let ((.cse1 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 4) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse2 (* 4 .cse6))) (or (and (<= .cse1 (+ .cse2 c_ULTIMATE.start_main_~x~0 9)) .cse3 .cse4) (and .cse5 (<= .cse1 (+ .cse2 c_ULTIMATE.start_main_~x~0 5))))) .cse7 .cse8 .cse9) (and .cse3 .cse4 (<= .cse10 0)) (and .cse5 (<= .cse11 0))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse12 .cse13 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse14 .cse12 4294967297)) .cse3 .cse4)) .cse0 .cse7 .cse8 (or (and (<= 0 .cse15) .cse5) (and .cse3 .cse4 (<= 0 .cse16)) (and (or (< 0 .cse10) .cse17 .cse18) (or .cse19 (< 0 .cse11)))) .cse9))))))) is different from false [2019-11-23 22:07:37,658 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse15 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse15)) (.cse22 (* .cse15 (- 2)))) (let ((.cse19 (div (+ .cse22 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse21 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse10 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse20 (div (+ .cse22 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse20)) (.cse4 (not .cse10)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse21)) (.cse1 (* 4294967296 .cse19))) (let ((.cse16 (+ .cse0 .cse1)) (.cse17 (and .cse4 .cse5)) (.cse8 (<= .cse21 c_ULTIMATE.start_main_~y~0)) (.cse9 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse8 .cse10 (< .cse9 c_ULTIMATE.start_main_~y~0))) (.cse11 (or (< .cse16 c_ULTIMATE.start_main_~y~0) .cse17)) (.cse2 (or .cse8 .cse10)) (.cse7 (+ .cse20 1)) (.cse18 (+ .cse19 1))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (or (and .cse4 .cse5 (<= .cse7 0)) (and .cse6 (or .cse8 (not (= .cse9 c_ULTIMATE.start_main_~y~0)) .cse10) .cse11 (let ((.cse12 (* 2 (div (+ c_ULTIMATE.start_main_~x~0 (- 2)) 2))) (.cse13 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse14 (* 4 .cse15))) (or (and .cse4 .cse5 (<= (+ .cse12 .cse13) (+ .cse14 c_ULTIMATE.start_main_~x~0 3))) (and .cse2 (<= (+ .cse12 .cse13 1) (+ .cse14 c_ULTIMATE.start_main_~x~0))))) (or (not (= .cse16 c_ULTIMATE.start_main_~y~0)) .cse17)) (and .cse2 (<= .cse18 0))) .cse11 (or (and (<= 0 .cse19) .cse2) (and .cse4 .cse5 (<= 0 .cse20)) (and (or (< 0 .cse7) .cse8 .cse10) (or .cse17 (< 0 .cse18))))))))))) is different from true [2019-11-23 22:07:51,826 WARN L192 SmtUtils]: Spent 14.15 s on a formula simplification. DAG size of input: 74 DAG size of output: 24 [2019-11-23 22:07:53,853 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse24 (* 2 .cse35))) (let ((.cse39 (div c_ULTIMATE.start_main_~x~0 2)) (.cse37 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse24 c_ULTIMATE.start_main_~y~0)) (.cse40 (* .cse35 (- 2)))) (let ((.cse17 (div (+ .cse40 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse19)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse37)) (.cse16 (div (+ .cse40 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse13 (* 2 .cse39)) (.cse36 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296))) (.cse38 (* .cse39 (- 2)))) (let ((.cse0 (div (+ .cse38 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse21 (div (+ .cse38 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (<= .cse36 c_ULTIMATE.start_main_~x~0)) (.cse23 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse25 (* 4294967296 .cse16)) (.cse20 (and .cse2 .cse3)) (.cse26 (* 4294967296 .cse17)) (.cse18 (<= .cse37 c_ULTIMATE.start_main_~y~0))) (let ((.cse6 (* 8589934592 .cse16)) (.cse5 (or .cse18 .cse19)) (.cse11 (* 8589934592 .cse17)) (.cse27 (or .cse18 .cse19 (< (+ .cse26 .cse24 2) c_ULTIMATE.start_main_~y~0))) (.cse28 (or (< (+ .cse24 .cse25) c_ULTIMATE.start_main_~y~0) .cse20)) (.cse1 (or .cse22 .cse23)) (.cse14 (* 4294967296 .cse21)) (.cse15 (* 4294967296 .cse0)) (.cse9 (< c_ULTIMATE.start_main_~x~0 .cse36)) (.cse10 (not .cse23))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (or (let ((.cse4 (+ .cse17 1)) (.cse12 (+ .cse16 1))) (and (let ((.cse7 (+ .cse13 .cse15)) (.cse8 (+ .cse13 .cse14 3))) (or (and .cse2 .cse3 (<= .cse4 0)) (and .cse5 (or (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 .cse6 1) .cse7)) (and (<= (+ c_ULTIMATE.start_main_~x~0 .cse6) .cse8) .cse9 .cse10))) (and .cse2 .cse3 (or (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0 1) .cse7) .cse1) (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0) .cse8) .cse9 .cse10))) (and .cse5 (<= .cse12 0)))) (or (and (<= 0 .cse16) .cse5) (and .cse2 .cse3 (<= 0 .cse17)) (and (or (< 0 .cse4) .cse18 .cse19) (or .cse20 (< 0 .cse12)))))) (and (or (< 0 .cse21) .cse22 .cse23) (or (and .cse9 .cse10) (< 0 .cse0)))) (or (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse24 .cse25 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse26 .cse24 4294967297)) .cse2 .cse3)) .cse27 .cse28) (and (<= .cse21 0) .cse9 .cse10) (and .cse1 (<= .cse0 0)))) (and .cse27 .cse28 (let ((.cse29 (+ .cse24 c_ULTIMATE.start_main_~x~0 .cse25)) (.cse30 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15)) (.cse34 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0))) (or (and (or (and .cse1 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15 1) .cse29)) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3) .cse29) .cse9 .cse10)) .cse5) (and (let ((.cse33 (* 2 c_ULTIMATE.start_main_~y~0))) (let ((.cse31 (+ .cse13 .cse33 .cse15)) (.cse32 (* 4 .cse35))) (or (and (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2) .cse29) .cse10) (and .cse1 (<= .cse30 .cse29))) .cse5) (and (or (and (<= .cse31 (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6 1)) .cse1) (and (<= (+ .cse13 .cse33 .cse14 3) (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6)) .cse9 .cse10)) .cse5) (and .cse2 .cse3 (or (and (<= (+ .cse13 .cse33 .cse14) (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 1)) .cse9 .cse10) (and .cse1 (<= .cse31 (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 5))))) (and .cse2 .cse3 (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14) .cse34) .cse10) (and .cse1 (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 2)))))))) .cse27 .cse28) (and .cse2 .cse3 (or (and (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 1)) .cse1) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1) .cse34) .cse9 .cse10)))))) (and .cse9 (<= (+ .cse21 1) 0) .cse10)))))))) is different from false [2019-11-23 22:07:55,865 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse24 (* 2 .cse35))) (let ((.cse39 (div c_ULTIMATE.start_main_~x~0 2)) (.cse37 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse24 c_ULTIMATE.start_main_~y~0)) (.cse40 (* .cse35 (- 2)))) (let ((.cse17 (div (+ .cse40 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse19)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse37)) (.cse16 (div (+ .cse40 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse13 (* 2 .cse39)) (.cse36 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296))) (.cse38 (* .cse39 (- 2)))) (let ((.cse0 (div (+ .cse38 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse21 (div (+ .cse38 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (<= .cse36 c_ULTIMATE.start_main_~x~0)) (.cse23 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse25 (* 4294967296 .cse16)) (.cse20 (and .cse2 .cse3)) (.cse26 (* 4294967296 .cse17)) (.cse18 (<= .cse37 c_ULTIMATE.start_main_~y~0))) (let ((.cse6 (* 8589934592 .cse16)) (.cse5 (or .cse18 .cse19)) (.cse11 (* 8589934592 .cse17)) (.cse27 (or .cse18 .cse19 (< (+ .cse26 .cse24 2) c_ULTIMATE.start_main_~y~0))) (.cse28 (or (< (+ .cse24 .cse25) c_ULTIMATE.start_main_~y~0) .cse20)) (.cse1 (or .cse22 .cse23)) (.cse14 (* 4294967296 .cse21)) (.cse15 (* 4294967296 .cse0)) (.cse9 (< c_ULTIMATE.start_main_~x~0 .cse36)) (.cse10 (not .cse23))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (or (let ((.cse4 (+ .cse17 1)) (.cse12 (+ .cse16 1))) (and (let ((.cse7 (+ .cse13 .cse15)) (.cse8 (+ .cse13 .cse14 3))) (or (and .cse2 .cse3 (<= .cse4 0)) (and .cse5 (or (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 .cse6 1) .cse7)) (and (<= (+ c_ULTIMATE.start_main_~x~0 .cse6) .cse8) .cse9 .cse10))) (and .cse2 .cse3 (or (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0 1) .cse7) .cse1) (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0) .cse8) .cse9 .cse10))) (and .cse5 (<= .cse12 0)))) (or (and (<= 0 .cse16) .cse5) (and .cse2 .cse3 (<= 0 .cse17)) (and (or (< 0 .cse4) .cse18 .cse19) (or .cse20 (< 0 .cse12)))))) (and (or (< 0 .cse21) .cse22 .cse23) (or (and .cse9 .cse10) (< 0 .cse0)))) (or (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse24 .cse25 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse26 .cse24 4294967297)) .cse2 .cse3)) .cse27 .cse28) (and (<= .cse21 0) .cse9 .cse10) (and .cse1 (<= .cse0 0)))) (and .cse27 .cse28 (let ((.cse29 (+ .cse24 c_ULTIMATE.start_main_~x~0 .cse25)) (.cse30 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15)) (.cse34 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0))) (or (and (or (and .cse1 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15 1) .cse29)) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3) .cse29) .cse9 .cse10)) .cse5) (and (let ((.cse33 (* 2 c_ULTIMATE.start_main_~y~0))) (let ((.cse31 (+ .cse13 .cse33 .cse15)) (.cse32 (* 4 .cse35))) (or (and (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2) .cse29) .cse10) (and .cse1 (<= .cse30 .cse29))) .cse5) (and (or (and (<= .cse31 (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6 1)) .cse1) (and (<= (+ .cse13 .cse33 .cse14 3) (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6)) .cse9 .cse10)) .cse5) (and .cse2 .cse3 (or (and (<= (+ .cse13 .cse33 .cse14) (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 1)) .cse9 .cse10) (and .cse1 (<= .cse31 (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 5))))) (and .cse2 .cse3 (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14) .cse34) .cse10) (and .cse1 (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 2)))))))) .cse27 .cse28) (and .cse2 .cse3 (or (and (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 1)) .cse1) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1) .cse34) .cse9 .cse10)))))) (and .cse9 (<= (+ .cse21 1) 0) .cse10)))))))) is different from true [2019-11-23 22:07:57,904 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse36 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296)))) (and (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse24 (* 2 .cse35))) (let ((.cse39 (div c_ULTIMATE.start_main_~x~0 2)) (.cse37 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse24 c_ULTIMATE.start_main_~y~0)) (.cse40 (* .cse35 (- 2)))) (let ((.cse17 (div (+ .cse40 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse19)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse37)) (.cse16 (div (+ .cse40 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse13 (* 2 .cse39)) (.cse38 (* .cse39 (- 2)))) (let ((.cse0 (div (+ .cse38 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse21 (div (+ .cse38 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (<= .cse36 c_ULTIMATE.start_main_~x~0)) (.cse23 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse25 (* 4294967296 .cse16)) (.cse20 (and .cse2 .cse3)) (.cse26 (* 4294967296 .cse17)) (.cse18 (<= .cse37 c_ULTIMATE.start_main_~y~0))) (let ((.cse6 (* 8589934592 .cse16)) (.cse5 (or .cse18 .cse19)) (.cse11 (* 8589934592 .cse17)) (.cse27 (or .cse18 .cse19 (< (+ .cse26 .cse24 2) c_ULTIMATE.start_main_~y~0))) (.cse28 (or (< (+ .cse24 .cse25) c_ULTIMATE.start_main_~y~0) .cse20)) (.cse1 (or .cse22 .cse23)) (.cse14 (* 4294967296 .cse21)) (.cse15 (* 4294967296 .cse0)) (.cse9 (< c_ULTIMATE.start_main_~x~0 .cse36)) (.cse10 (not .cse23))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (or (let ((.cse4 (+ .cse17 1)) (.cse12 (+ .cse16 1))) (and (let ((.cse7 (+ .cse13 .cse15)) (.cse8 (+ .cse13 .cse14 3))) (or (and .cse2 .cse3 (<= .cse4 0)) (and .cse5 (or (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 .cse6 1) .cse7)) (and (<= (+ c_ULTIMATE.start_main_~x~0 .cse6) .cse8) .cse9 .cse10))) (and .cse2 .cse3 (or (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0 1) .cse7) .cse1) (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0) .cse8) .cse9 .cse10))) (and .cse5 (<= .cse12 0)))) (or (and (<= 0 .cse16) .cse5) (and .cse2 .cse3 (<= 0 .cse17)) (and (or (< 0 .cse4) .cse18 .cse19) (or .cse20 (< 0 .cse12)))))) (and (or (< 0 .cse21) .cse22 .cse23) (or (and .cse9 .cse10) (< 0 .cse0)))) (or (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse24 .cse25 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse26 .cse24 4294967297)) .cse2 .cse3)) .cse27 .cse28) (and (<= .cse21 0) .cse9 .cse10) (and .cse1 (<= .cse0 0)))) (and .cse27 .cse28 (let ((.cse29 (+ .cse24 c_ULTIMATE.start_main_~x~0 .cse25)) (.cse30 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15)) (.cse34 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0))) (or (and (or (and .cse1 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15 1) .cse29)) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3) .cse29) .cse9 .cse10)) .cse5) (and (let ((.cse33 (* 2 c_ULTIMATE.start_main_~y~0))) (let ((.cse31 (+ .cse13 .cse33 .cse15)) (.cse32 (* 4 .cse35))) (or (and (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2) .cse29) .cse10) (and .cse1 (<= .cse30 .cse29))) .cse5) (and (or (and (<= .cse31 (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6 1)) .cse1) (and (<= (+ .cse13 .cse33 .cse14 3) (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6)) .cse9 .cse10)) .cse5) (and .cse2 .cse3 (or (and (<= (+ .cse13 .cse33 .cse14) (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 1)) .cse9 .cse10) (and .cse1 (<= .cse31 (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 5))))) (and .cse2 .cse3 (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14) .cse34) .cse10) (and .cse1 (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 2)))))))) .cse27 .cse28) (and .cse2 .cse3 (or (and (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 1)) .cse1) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1) .cse34) .cse9 .cse10)))))) (and .cse9 (<= (+ .cse21 1) 0) .cse10)))))))) (< .cse36 (+ c_ULTIMATE.start_main_~x~0 1)))) is different from false [2019-11-23 22:07:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-11-23 22:07:57,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241146289] [2019-11-23 22:07:57,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379488490] [2019-11-23 22:07:57,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:07:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:57,986 WARN L253 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 22:07:57,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:07:58,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:07:58,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:07:58,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:07:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:58,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:07:58,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2019-11-23 22:07:58,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785433237] [2019-11-23 22:07:58,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 22:07:58,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 22:07:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=111, Unknown=9, NotChecked=216, Total=380 [2019-11-23 22:07:58,149 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 20 states. [2019-11-23 22:08:00,198 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse3 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse11 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse3)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse14 (+ .cse18 (* 4294967296 .cse16))) (.cse2 (and .cse4 .cse5)) (.cse1 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse6 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse0 (or .cse1 .cse3 (< .cse6 c_ULTIMATE.start_main_~y~0))) (.cse12 (or (< .cse14 c_ULTIMATE.start_main_~y~0) .cse2)) (.cse10 (or .cse1 .cse3)) (.cse7 (+ .cse17 1)) (.cse13 (+ .cse16 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) .cse0 (or .cse1 .cse2 .cse3) (or (and .cse4 .cse5 (<= c_ULTIMATE.start_main_~y~0 .cse6)) (and .cse4 .cse5 (<= .cse7 0)) (and .cse0 (let ((.cse8 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse9 (* 4 .cse11))) (or (and .cse4 .cse5 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 5))) (and (<= (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 1)) .cse10))) .cse12) (and .cse10 (<= .cse13 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse14) .cse10)) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse1 (not (= .cse6 c_ULTIMATE.start_main_~y~0)) .cse3) .cse12 (= c_ULTIMATE.start_main_~x~0 1) (or (and (<= 0 .cse16) .cse10) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse7) .cse1 .cse3) (or .cse2 (< 0 .cse13)))) (or (not (= .cse14 c_ULTIMATE.start_main_~y~0)) .cse2)))))))) is different from false [2019-11-23 22:08:02,217 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse7))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse14 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse7 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse0 (not .cse14)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse11 (+ .cse18 (* 4294967296 .cse16))) (.cse13 (and .cse0 .cse1)) (.cse12 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse2 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse8 (or .cse12 .cse14 (< .cse2 c_ULTIMATE.start_main_~y~0))) (.cse9 (or (< .cse11 c_ULTIMATE.start_main_~y~0) .cse13)) (.cse4 (or .cse12 .cse14)) (.cse3 (+ .cse17 1)) (.cse10 (+ .cse16 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and .cse0 .cse1 (<= c_ULTIMATE.start_main_~y~0 .cse2)) (and .cse0 .cse1 (<= .cse3 0)) (and (let ((.cse5 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse6 (* 4 .cse7))) (or (and .cse4 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 3))) (and .cse0 .cse1 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 4) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 7))))) .cse8 .cse9) (and .cse4 (<= .cse10 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse4)) .cse8 (or .cse12 .cse13 .cse14) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse12 (not (= .cse2 c_ULTIMATE.start_main_~y~0)) .cse14) .cse9 (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse16) .cse4) (and .cse0 .cse1 (<= 0 .cse17)) (and (or (< 0 .cse3) .cse12 .cse14) (or .cse13 (< 0 .cse10)))) (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse13)))))))) is different from false [2019-11-23 22:08:04,258 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse23 (* .cse12 (- 2)))) (let ((.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse7 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse17 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse17)) (.cse4 (not .cse19)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse7)) (.cse1 (* 4294967296 .cse16))) (let ((.cse21 (+ .cse0 .cse1)) (.cse20 (and .cse4 .cse5)) (.cse18 (<= .cse7 c_ULTIMATE.start_main_~y~0)) (.cse22 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse18 .cse19 (< .cse22 c_ULTIMATE.start_main_~y~0))) (.cse8 (or .cse18 (not (= .cse22 c_ULTIMATE.start_main_~y~0)) .cse19)) (.cse9 (or (< .cse21 c_ULTIMATE.start_main_~y~0) .cse20)) (.cse2 (or .cse18 .cse19)) (.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse13 (or (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse20))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (< .cse7 (+ c_ULTIMATE.start_main_~y~0 1)) .cse8 .cse9 (or (and .cse6 (let ((.cse10 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse11 (* 4 .cse12))) (or (and .cse2 (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse8 .cse9 .cse13) (and .cse4 .cse5 (<= .cse14 0)) (and .cse2 (<= .cse15 0))) (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse16) .cse2) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse14) .cse18 .cse19) (or .cse20 (< 0 .cse15)))) .cse13))))))) is different from false [2019-11-23 22:08:08,356 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse11)) (.cse23 (* .cse11 (- 2)))) (let ((.cse15 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse22 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse18 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse16)) (.cse4 (not .cse18)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse22)) (.cse1 (* 4294967296 .cse15))) (let ((.cse20 (+ .cse0 .cse1)) (.cse19 (and .cse4 .cse5)) (.cse17 (<= .cse22 c_ULTIMATE.start_main_~y~0)) (.cse21 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse17 .cse18 (< .cse21 c_ULTIMATE.start_main_~y~0))) (.cse7 (or .cse17 (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse18)) (.cse8 (or (< .cse20 c_ULTIMATE.start_main_~y~0) .cse19)) (.cse2 (or .cse17 .cse18)) (.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse12 (or (not (= .cse20 c_ULTIMATE.start_main_~y~0)) .cse19))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 .cse7 .cse8 (= c_ULTIMATE.start_main_~x~0 1) (or (and (let ((.cse9 (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse10 (* 4 .cse11))) (or (and .cse4 .cse5 (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 5))) (and (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 1)) .cse2))) .cse6 .cse7 .cse8 .cse12) (and .cse4 .cse5 (<= .cse13 0)) (and .cse2 (<= .cse14 0))) (or (and (<= 0 .cse15) .cse2) (and .cse4 .cse5 (<= 0 .cse16)) (and (or (< 0 .cse13) .cse17 .cse18) (or .cse19 (< 0 .cse14)))) .cse12))))))) is different from true [2019-11-23 22:08:10,395 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse15)) (.cse22 (* .cse15 (- 2)))) (let ((.cse19 (div (+ .cse22 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse21 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse10 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse20 (div (+ .cse22 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse20)) (.cse4 (not .cse10)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse21)) (.cse1 (* 4294967296 .cse19))) (let ((.cse16 (+ .cse0 .cse1)) (.cse17 (and .cse4 .cse5)) (.cse8 (<= .cse21 c_ULTIMATE.start_main_~y~0)) (.cse9 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse8 .cse10 (< .cse9 c_ULTIMATE.start_main_~y~0))) (.cse11 (or (< .cse16 c_ULTIMATE.start_main_~y~0) .cse17)) (.cse2 (or .cse8 .cse10)) (.cse7 (+ .cse20 1)) (.cse18 (+ .cse19 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (or (and .cse4 .cse5 (<= .cse7 0)) (and .cse6 (or .cse8 (not (= .cse9 c_ULTIMATE.start_main_~y~0)) .cse10) .cse11 (let ((.cse12 (* 2 (div (+ c_ULTIMATE.start_main_~x~0 (- 2)) 2))) (.cse13 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse14 (* 4 .cse15))) (or (and .cse4 .cse5 (<= (+ .cse12 .cse13) (+ .cse14 c_ULTIMATE.start_main_~x~0 3))) (and .cse2 (<= (+ .cse12 .cse13 1) (+ .cse14 c_ULTIMATE.start_main_~x~0))))) (or (not (= .cse16 c_ULTIMATE.start_main_~y~0)) .cse17)) (and .cse2 (<= .cse18 0))) .cse11 (= c_ULTIMATE.start_main_~x~0 3) (or (and (<= 0 .cse19) .cse2) (and .cse4 .cse5 (<= 0 .cse20)) (and (or (< 0 .cse7) .cse8 .cse10) (or .cse17 (< 0 .cse18))))))))))) is different from false [2019-11-23 22:08:12,469 WARN L860 $PredicateComparison]: unable to prove that (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse24 (* 2 .cse35))) (let ((.cse39 (div c_ULTIMATE.start_main_~x~0 2)) (.cse37 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse24 c_ULTIMATE.start_main_~y~0)) (.cse40 (* .cse35 (- 2)))) (let ((.cse17 (div (+ .cse40 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse19)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse37)) (.cse16 (div (+ .cse40 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse13 (* 2 .cse39)) (.cse36 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296))) (.cse38 (* .cse39 (- 2)))) (let ((.cse0 (div (+ .cse38 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse21 (div (+ .cse38 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (<= .cse36 c_ULTIMATE.start_main_~x~0)) (.cse23 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse25 (* 4294967296 .cse16)) (.cse20 (and .cse2 .cse3)) (.cse26 (* 4294967296 .cse17)) (.cse18 (<= .cse37 c_ULTIMATE.start_main_~y~0))) (let ((.cse6 (* 8589934592 .cse16)) (.cse5 (or .cse18 .cse19)) (.cse11 (* 8589934592 .cse17)) (.cse27 (or .cse18 .cse19 (< (+ .cse26 .cse24 2) c_ULTIMATE.start_main_~y~0))) (.cse28 (or (< (+ .cse24 .cse25) c_ULTIMATE.start_main_~y~0) .cse20)) (.cse1 (or .cse22 .cse23)) (.cse14 (* 4294967296 .cse21)) (.cse15 (* 4294967296 .cse0)) (.cse9 (< c_ULTIMATE.start_main_~x~0 .cse36)) (.cse10 (not .cse23))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (or (let ((.cse4 (+ .cse17 1)) (.cse12 (+ .cse16 1))) (and (let ((.cse7 (+ .cse13 .cse15)) (.cse8 (+ .cse13 .cse14 3))) (or (and .cse2 .cse3 (<= .cse4 0)) (and .cse5 (or (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 .cse6 1) .cse7)) (and (<= (+ c_ULTIMATE.start_main_~x~0 .cse6) .cse8) .cse9 .cse10))) (and .cse2 .cse3 (or (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0 1) .cse7) .cse1) (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0) .cse8) .cse9 .cse10))) (and .cse5 (<= .cse12 0)))) (or (and (<= 0 .cse16) .cse5) (and .cse2 .cse3 (<= 0 .cse17)) (and (or (< 0 .cse4) .cse18 .cse19) (or .cse20 (< 0 .cse12)))))) (and (or (< 0 .cse21) .cse22 .cse23) (or (and .cse9 .cse10) (< 0 .cse0)))) (or (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse24 .cse25 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse26 .cse24 4294967297)) .cse2 .cse3)) .cse27 .cse28) (and (<= .cse21 0) .cse9 .cse10) (and .cse1 (<= .cse0 0)))) (and .cse27 .cse28 (let ((.cse29 (+ .cse24 c_ULTIMATE.start_main_~x~0 .cse25)) (.cse30 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15)) (.cse34 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0))) (or (and (or (and .cse1 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15 1) .cse29)) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3) .cse29) .cse9 .cse10)) .cse5) (and (let ((.cse33 (* 2 c_ULTIMATE.start_main_~y~0))) (let ((.cse31 (+ .cse13 .cse33 .cse15)) (.cse32 (* 4 .cse35))) (or (and (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2) .cse29) .cse10) (and .cse1 (<= .cse30 .cse29))) .cse5) (and (or (and (<= .cse31 (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6 1)) .cse1) (and (<= (+ .cse13 .cse33 .cse14 3) (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6)) .cse9 .cse10)) .cse5) (and .cse2 .cse3 (or (and (<= (+ .cse13 .cse33 .cse14) (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 1)) .cse9 .cse10) (and .cse1 (<= .cse31 (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 5))))) (and .cse2 .cse3 (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14) .cse34) .cse10) (and .cse1 (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 2)))))))) .cse27 .cse28) (and .cse2 .cse3 (or (and (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 1)) .cse1) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1) .cse34) .cse9 .cse10)))))) (and .cse9 (<= (+ .cse21 1) 0) .cse10)))))))) (= (+ c_ULTIMATE.start_main_~x~0 5) 0)) is different from true [2019-11-23 22:08:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:08:18,648 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-11-23 22:08:18,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 22:08:18,648 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 16 [2019-11-23 22:08:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:08:18,649 INFO L225 Difference]: With dead ends: 53 [2019-11-23 22:08:18,649 INFO L226 Difference]: Without dead ends: 49 [2019-11-23 22:08:18,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=62, Invalid=135, Unknown=15, NotChecked=490, Total=702 [2019-11-23 22:08:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-23 22:08:18,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-23 22:08:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 22:08:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-11-23 22:08:18,657 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 16 [2019-11-23 22:08:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:08:18,657 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-11-23 22:08:18,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 22:08:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-11-23 22:08:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:08:18,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:08:18,658 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-23 22:08:18,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:08:18,861 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:08:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:08:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash 489860484, now seen corresponding path program 2 times [2019-11-23 22:08:18,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:08:18,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171417590] [2019-11-23 22:08:18,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:08:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:08:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:08:19,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171417590] [2019-11-23 22:08:19,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021218276] [2019-11-23 22:08:19,357 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 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:08:19,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:08:19,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:08:19,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-23 22:08:19,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:08:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:08:19,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:08:19,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-11-23 22:08:19,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690858265] [2019-11-23 22:08:19,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 22:08:19,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:08:19,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 22:08:19,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:08:19,451 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 24 states. [2019-11-23 22:08:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:08:19,955 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-11-23 22:08:19,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 22:08:19,955 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-11-23 22:08:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:08:19,956 INFO L225 Difference]: With dead ends: 65 [2019-11-23 22:08:19,956 INFO L226 Difference]: Without dead ends: 61 [2019-11-23 22:08:19,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:08:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-23 22:08:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-11-23 22:08:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-23 22:08:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-23 22:08:19,973 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2019-11-23 22:08:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:08:19,975 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-23 22:08:19,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 22:08:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-23 22:08:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:08:19,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:08:19,976 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-23 22:08:20,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:08:20,180 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:08:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:08:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1485399428, now seen corresponding path program 2 times [2019-11-23 22:08:20,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:08:20,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178743701] [2019-11-23 22:08:20,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:08:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:08:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:08:20,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178743701] [2019-11-23 22:08:20,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037375200] [2019-11-23 22:08:20,285 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 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:08:20,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:08:20,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:08:20,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 22:08:20,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:08:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:08:20,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:08:20,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-23 22:08:20,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561737356] [2019-11-23 22:08:20,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:08:20,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:08:20,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:08:20,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:08:20,355 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 9 states. [2019-11-23 22:08:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:08:20,494 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-11-23 22:08:20,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:08:20,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-23 22:08:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:08:20,495 INFO L225 Difference]: With dead ends: 64 [2019-11-23 22:08:20,495 INFO L226 Difference]: Without dead ends: 39 [2019-11-23 22:08:20,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:08:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-23 22:08:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-23 22:08:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 22:08:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-11-23 22:08:20,502 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 27 [2019-11-23 22:08:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:08:20,503 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-11-23 22:08:20,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:08:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-11-23 22:08:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:08:20,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:08:20,506 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-11-23 22:08:20,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:08:20,708 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:08:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:08:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 902325004, now seen corresponding path program 3 times [2019-11-23 22:08:20,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:08:20,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289065057] [2019-11-23 22:08:20,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:08:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:08:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:08:21,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289065057] [2019-11-23 22:08:21,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870422021] [2019-11-23 22:08:21,507 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 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:08:21,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 22:08:21,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:08:21,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-23 22:08:21,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:08:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:08:21,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:08:21,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-11-23 22:08:21,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657414810] [2019-11-23 22:08:21,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-23 22:08:21,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:08:21,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-23 22:08:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 22:08:21,618 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 34 states. [2019-11-23 22:08:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:08:22,484 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-11-23 22:08:22,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-23 22:08:22,487 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2019-11-23 22:08:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:08:22,488 INFO L225 Difference]: With dead ends: 55 [2019-11-23 22:08:22,488 INFO L226 Difference]: Without dead ends: 51 [2019-11-23 22:08:22,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 22:08:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-23 22:08:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-11-23 22:08:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 22:08:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-11-23 22:08:22,496 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 38 [2019-11-23 22:08:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:08:22,497 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-11-23 22:08:22,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-23 22:08:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-11-23 22:08:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:08:22,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:08:22,498 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-11-23 22:08:22,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:08:22,700 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:08:22,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:08:22,700 INFO L82 PathProgramCache]: Analyzing trace with hash 241133700, now seen corresponding path program 4 times [2019-11-23 22:08:22,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:08:22,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661996038] [2019-11-23 22:08:22,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:08:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:08:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:08:23,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661996038] [2019-11-23 22:08:23,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238377598] [2019-11-23 22:08:23,769 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 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:08:23,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:08:23,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:08:23,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 83 conjunts are in the unsatisfiable core [2019-11-23 22:08:23,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:08:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:08:23,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:08:23,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-11-23 22:08:23,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219965814] [2019-11-23 22:08:23,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-23 22:08:23,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:08:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-23 22:08:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 22:08:23,918 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 44 states. [2019-11-23 22:08:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:08:25,492 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-11-23 22:08:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-23 22:08:25,497 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 49 [2019-11-23 22:08:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:08:25,498 INFO L225 Difference]: With dead ends: 66 [2019-11-23 22:08:25,498 INFO L226 Difference]: Without dead ends: 62 [2019-11-23 22:08:25,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 22:08:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-23 22:08:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-23 22:08:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-23 22:08:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-11-23 22:08:25,504 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 49 [2019-11-23 22:08:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:08:25,504 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-11-23 22:08:25,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-23 22:08:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-11-23 22:08:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 22:08:25,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:08:25,506 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-11-23 22:08:25,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:08:25,715 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:08:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:08:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash -722941940, now seen corresponding path program 5 times [2019-11-23 22:08:25,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:08:25,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128544270] [2019-11-23 22:08:25,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:08:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:08:29,988 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2019-11-23 22:08:34,043 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2019-11-23 22:08:36,125 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-23 22:08:38,201 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-23 22:08:40,262 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-23 22:08:44,422 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-23 22:08:46,516 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-23 22:08:48,592 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-23 22:08:50,668 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-23 22:08:52,747 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-23 22:08:56,840 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-23 22:09:02,931 WARN L192 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19