java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:41:12,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:41:12,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:41:12,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:41:12,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:41:12,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:41:12,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:41:12,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:41:12,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:41:12,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:41:12,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:41:12,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:41:12,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:41:12,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:41:12,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:41:12,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:41:12,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:41:12,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:41:12,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:41:12,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:41:12,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:41:12,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:41:12,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:41:12,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:41:12,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:41:12,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:41:12,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:41:12,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:41:12,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:41:12,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:41:12,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:41:12,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:41:12,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:41:12,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:41:12,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:41:12,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:41:12,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:41:12,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:41:12,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:41:12,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:41:12,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:41:12,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:41:12,221 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:41:12,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:41:12,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:41:12,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:41:12,223 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:41:12,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:41:12,223 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:41:12,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:41:12,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:41:12,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:41:12,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:41:12,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:41:12,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:41:12,224 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:41:12,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:41:12,225 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:41:12,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:41:12,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:41:12,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:41:12,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:41:12,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:41:12,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:41:12,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:41:12,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:41:12,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:41:12,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:41:12,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:41:12,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:41:12,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:41:12,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:41:12,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:41:12,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:41:12,294 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:41:12,295 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:41:12,296 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-09-08 02:41:12,368 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3004f85/90e75cf6414c4aefb89aa56e118a6e26/FLAG7af0b7e7d [2019-09-08 02:41:12,814 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:41:12,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2019-09-08 02:41:12,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3004f85/90e75cf6414c4aefb89aa56e118a6e26/FLAG7af0b7e7d [2019-09-08 02:41:13,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3004f85/90e75cf6414c4aefb89aa56e118a6e26 [2019-09-08 02:41:13,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:41:13,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:41:13,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:41:13,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:41:13,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:41:13,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:41:13" (1/1) ... [2019-09-08 02:41:13,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd174ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13, skipping insertion in model container [2019-09-08 02:41:13,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:41:13" (1/1) ... [2019-09-08 02:41:13,232 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:41:13,248 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:41:13,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:41:13,418 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:41:13,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:41:13,466 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:41:13,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13 WrapperNode [2019-09-08 02:41:13,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:41:13,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:41:13,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:41:13,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:41:13,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13" (1/1) ... [2019-09-08 02:41:13,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13" (1/1) ... [2019-09-08 02:41:13,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13" (1/1) ... [2019-09-08 02:41:13,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13" (1/1) ... [2019-09-08 02:41:13,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13" (1/1) ... [2019-09-08 02:41:13,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13" (1/1) ... [2019-09-08 02:41:13,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13" (1/1) ... [2019-09-08 02:41:13,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:41:13,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:41:13,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:41:13,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:41:13,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:41:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:41:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:41:13,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:41:13,652 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:41:13,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:41:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 02:41:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:41:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:41:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:41:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:41:13,905 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:41:13,906 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 02:41:13,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:41:13 BoogieIcfgContainer [2019-09-08 02:41:13,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:41:13,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:41:13,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:41:13,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:41:13,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:41:13" (1/3) ... [2019-09-08 02:41:13,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db3e976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:41:13, skipping insertion in model container [2019-09-08 02:41:13,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:41:13" (2/3) ... [2019-09-08 02:41:13,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db3e976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:41:13, skipping insertion in model container [2019-09-08 02:41:13,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:41:13" (3/3) ... [2019-09-08 02:41:13,915 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2019-09-08 02:41:13,923 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:41:13,930 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:41:13,946 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:41:13,975 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:41:13,975 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:41:13,975 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:41:13,976 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:41:13,976 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:41:13,976 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:41:13,976 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:41:13,976 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:41:13,976 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:41:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-08 02:41:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 02:41:14,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:14,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:14,009 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2019-09-08 02:41:14,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:14,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:14,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:14,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:14,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:14,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:41:14,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:41:14,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:41:14,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:41:14,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:41:14,130 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-08 02:41:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:14,149 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2019-09-08 02:41:14,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:41:14,150 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-08 02:41:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:14,157 INFO L225 Difference]: With dead ends: 38 [2019-09-08 02:41:14,158 INFO L226 Difference]: Without dead ends: 21 [2019-09-08 02:41:14,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:41:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-08 02:41:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-08 02:41:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 02:41:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-09-08 02:41:14,194 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2019-09-08 02:41:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:14,195 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-09-08 02:41:14,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:41:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-09-08 02:41:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 02:41:14,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:14,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:14,196 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:14,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:14,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2019-09-08 02:41:14,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:14,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:14,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:14,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:14,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:14,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:41:14,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:41:14,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:41:14,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:41:14,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:41:14,330 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2019-09-08 02:41:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:14,459 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2019-09-08 02:41:14,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:41:14,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-08 02:41:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:14,463 INFO L225 Difference]: With dead ends: 28 [2019-09-08 02:41:14,463 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 02:41:14,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09-08 02:41:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 02:41:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-08 02:41:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 02:41:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-09-08 02:41:14,471 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2019-09-08 02:41:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:14,472 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-09-08 02:41:14,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:41:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-09-08 02:41:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:41:14,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:14,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:14,474 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2019-09-08 02:41:14,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:14,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:14,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:14,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:41:14,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:41:14,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:41:14,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:41:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:41:14,613 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2019-09-08 02:41:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:14,757 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2019-09-08 02:41:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:41:14,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-08 02:41:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:14,761 INFO L225 Difference]: With dead ends: 50 [2019-09-08 02:41:14,761 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 02:41:14,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:41:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 02:41:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-08 02:41:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:41:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-09-08 02:41:14,769 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2019-09-08 02:41:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:14,770 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-09-08 02:41:14,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:41:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-09-08 02:41:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:41:14,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:14,771 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:14,771 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:14,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:14,772 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2019-09-08 02:41:14,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:14,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:14,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:14,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:14,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:15,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:15,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:41:15,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:15,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 02:41:15,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:15,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:15,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 02:41:15,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:41:15,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:41:15,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:41:15,259 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2019-09-08 02:41:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:15,563 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-09-08 02:41:15,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:41:15,564 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-09-08 02:41:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:15,565 INFO L225 Difference]: With dead ends: 51 [2019-09-08 02:41:15,565 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 02:41:15,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 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-09-08 02:41:15,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 02:41:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-08 02:41:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 02:41:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-09-08 02:41:15,581 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2019-09-08 02:41:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:15,582 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-09-08 02:41:15,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:41:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-09-08 02:41:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:41:15,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:15,584 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:15,584 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:15,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:15,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2019-09-08 02:41:15,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:15,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:15,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:15,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:15,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:15,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:41:15,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:41:15,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:41:15,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:41:15,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:41:15,658 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2019-09-08 02:41:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:15,738 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2019-09-08 02:41:15,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:41:15,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-08 02:41:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:15,741 INFO L225 Difference]: With dead ends: 61 [2019-09-08 02:41:15,741 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 02:41:15,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:41:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 02:41:15,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-08 02:41:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 02:41:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-08 02:41:15,750 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2019-09-08 02:41:15,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:15,750 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-08 02:41:15,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:41:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-08 02:41:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:41:15,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:15,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:15,752 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:15,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:15,753 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2019-09-08 02:41:15,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:15,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:15,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:15,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:15,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:17,997 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (div c_main_~y~0 2))) (let ((.cse11 (* 2 .cse20))) (let ((.cse2 (= .cse11 c_main_~y~0)) (.cse19 (* (- 2) .cse20)) (.cse18 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse4 (<= .cse18 c_main_~y~0)) (.cse14 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296)) (.cse8 (not .cse2)) (.cse10 (< c_main_~y~0 .cse18)) (.cse15 (div (+ .cse19 c_main_~y~0) 4294967296))) (let ((.cse16 (+ .cse15 1)) (.cse1 (and .cse8 .cse10)) (.cse17 (+ .cse14 1)) (.cse5 (or .cse2 .cse4))) (and (or (let ((.cse12 (* 4294967296 .cse15)) (.cse13 (* 4294967296 .cse14))) (let ((.cse9 (+ .cse11 .cse13 2)) (.cse7 (+ .cse11 .cse12)) (.cse6 (<= c_main_~y~0 (+ .cse11 1))) (.cse3 (+ .cse11 .cse13 3)) (.cse0 (+ .cse11 .cse12 1))) (and (or (and (or (< .cse0 c_main_~y~0) .cse1) (or .cse2 (< .cse3 c_main_~y~0) .cse4)) (and .cse5 .cse6 (or (and .cse5 (<= c_main_~y~0 .cse7)) (and .cse8 (<= c_main_~y~0 .cse9) .cse10) .cse2 .cse1 .cse4) (or (and .cse8 (<= .cse9 c_main_~y~0) .cse10) (and .cse5 (<= .cse7 c_main_~y~0)) (and (or .cse1 (< .cse7 c_main_~y~0)) (or .cse2 (< .cse9 c_main_~y~0) .cse4))))) (<= c_main_~x~0 1) (or (not (= c_main_~y~0 .cse9)) .cse2 .cse4) (<= 1 c_main_~x~0) (or (not (= .cse7 c_main_~y~0)) .cse1) (or (and .cse5 .cse6) (and .cse8 (<= c_main_~y~0 .cse3) .cse10) (and .cse5 (<= c_main_~y~0 .cse0)) (and .cse8 (<= c_main_~y~0 (+ .cse11 3)) .cse10))))) (and .cse5 (<= .cse16 0)) (and .cse8 (<= .cse17 0) .cse10)) (< .cse18 (+ c_main_~y~0 1)) (or (and .cse8 (<= 0 .cse14) .cse10) (and (or (< 0 .cse16) .cse1) (or .cse2 (< 0 .cse17) .cse4)) (and .cse5 (<= 0 .cse15))))))))) is different from false [2019-09-08 02:41:20,033 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse21 (div c_main_~y~0 2))) (let ((.cse15 (* 2 .cse21))) (let ((.cse8 (= .cse15 c_main_~y~0)) (.cse20 (* (- 2) .cse21)) (.cse0 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse0 c_main_~y~0)) (.cse18 (div (+ .cse20 c_main_~y~0 (- 2)) 4294967296)) (.cse3 (not .cse8)) (.cse5 (< c_main_~y~0 .cse0)) (.cse19 (div (+ .cse20 c_main_~y~0) 4294967296))) (let ((.cse2 (+ .cse19 1)) (.cse7 (and .cse3 .cse5)) (.cse4 (+ .cse18 1)) (.cse1 (or .cse8 .cse10))) (and (< .cse0 (+ c_main_~y~0 1)) (or (and .cse1 (<= .cse2 0)) (and .cse3 (<= .cse4 0) .cse5) (let ((.cse16 (* 4294967296 .cse19)) (.cse17 (* 4294967296 .cse18))) (let ((.cse13 (+ .cse15 .cse17 2)) (.cse14 (+ c_main_~x~0 1)) (.cse12 (+ .cse15 .cse16)) (.cse11 (<= c_main_~y~0 (+ .cse15 1))) (.cse9 (+ .cse15 .cse17 3)) (.cse6 (+ .cse15 .cse16 1))) (and (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (and .cse1 .cse11 (or (and .cse1 (<= c_main_~y~0 .cse12)) (and .cse3 (<= c_main_~y~0 .cse13) .cse5) .cse8 .cse7 .cse10) (or (and .cse3 (<= .cse13 c_main_~y~0) .cse5) (and .cse1 (<= .cse12 c_main_~y~0)) (and (or .cse7 (< .cse12 c_main_~y~0)) (or .cse8 (< .cse13 c_main_~y~0) .cse10))))) (<= .cse14 0) (or (not (= c_main_~y~0 .cse13)) .cse8 .cse10) (<= 0 .cse14) (or (not (= .cse12 c_main_~y~0)) .cse7) (or (and .cse1 .cse11) (and .cse3 (<= c_main_~y~0 .cse9) .cse5) (and .cse1 (<= c_main_~y~0 .cse6)) (and .cse3 (<= c_main_~y~0 (+ .cse15 3)) .cse5)))))) (or (and .cse3 (<= 0 .cse18) .cse5) (and (or (< 0 .cse2) .cse7) (or .cse8 (< 0 .cse4) .cse10)) (and .cse1 (<= 0 .cse19))))))))) is different from false [2019-09-08 02:41:22,074 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse24 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse24))) (let ((.cse8 (= .cse13 c_main_~y~0)) (.cse22 (* (- 2) .cse24)) (.cse23 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse23 c_main_~y~0)) (.cse20 (div (+ .cse22 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse8)) (.cse4 (< c_main_~y~0 .cse23)) (.cse21 (div (+ .cse22 c_main_~y~0) 4294967296))) (let ((.cse1 (+ .cse21 1)) (.cse7 (and .cse2 .cse4)) (.cse3 (+ .cse20 1)) (.cse0 (or .cse8 .cse10))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse15 (* 4294967296 .cse21)) (.cse14 (* 4294967296 .cse20))) (let ((.cse12 (+ .cse13 .cse14 2)) (.cse11 (+ .cse13 .cse15)) (.cse5 (+ c_main_~x~0 3)) (.cse16 (and .cse0 (<= c_main_~y~0 (+ .cse13 1)))) (.cse9 (+ .cse13 .cse14 3)) (.cse6 (+ .cse13 .cse15 1)) (.cse17 (and .cse2 (<= c_main_~y~0 (+ .cse13 3)) .cse4))) (and (<= 0 .cse5) (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (let ((.cse18 (and .cse2 (<= .cse12 c_main_~y~0) .cse4)) (.cse19 (and .cse0 (<= .cse11 c_main_~y~0)))) (and (or (and .cse0 (<= c_main_~y~0 .cse11)) (and .cse2 (<= c_main_~y~0 .cse12) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse13 .cse14 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)))) (or .cse16 .cse17) (or .cse18 .cse19) (or .cse18 .cse19 (and (or .cse7 (< .cse11 c_main_~y~0)) (or .cse8 (< .cse12 c_main_~y~0) .cse10)))))) (or (not (= c_main_~y~0 .cse12)) .cse8 .cse10) (or (not (= .cse11 c_main_~y~0)) .cse7) (<= .cse5 0) (or .cse16 (and .cse2 (<= c_main_~y~0 .cse9) .cse4) (and .cse0 (<= c_main_~y~0 .cse6)) .cse17))))) (or (and .cse2 (<= 0 .cse20) .cse4) (and (or (< 0 .cse1) .cse7) (or .cse8 (< 0 .cse3) .cse10)) (and .cse0 (<= 0 .cse21))))))))) is different from false [2019-09-08 02:41:24,115 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse23 (div c_main_~y~0 2))) (let ((.cse12 (* 2 .cse23))) (let ((.cse7 (= .cse12 c_main_~y~0)) (.cse21 (* (- 2) .cse23)) (.cse22 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse22 c_main_~y~0)) (.cse19 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse7)) (.cse4 (< c_main_~y~0 .cse22)) (.cse20 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse1 (+ .cse20 1)) (.cse6 (and .cse2 .cse4)) (.cse3 (+ .cse19 1)) (.cse0 (or .cse7 .cse9))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse14 (* 4294967296 .cse20)) (.cse13 (* 4294967296 .cse19))) (let ((.cse11 (+ .cse12 .cse13 2)) (.cse10 (+ .cse12 .cse14)) (.cse15 (and .cse0 (<= c_main_~y~0 (+ .cse12 1)))) (.cse8 (+ .cse12 .cse13 3)) (.cse5 (+ .cse12 .cse14 1)) (.cse16 (and .cse2 (<= c_main_~y~0 (+ .cse12 3)) .cse4))) (and (or (and (or (< .cse5 c_main_~y~0) .cse6) (or .cse7 (< .cse8 c_main_~y~0) .cse9)) (let ((.cse17 (and .cse2 (<= .cse11 c_main_~y~0) .cse4)) (.cse18 (and .cse0 (<= .cse10 c_main_~y~0)))) (and (or (and .cse0 (<= c_main_~y~0 .cse10)) (and .cse2 (<= c_main_~y~0 .cse11) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse12 .cse13 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse12 .cse14 4294967295)))) (or .cse15 .cse16) (or .cse17 .cse18) (or .cse17 .cse18 (and (or .cse6 (< .cse10 c_main_~y~0)) (or .cse7 (< .cse11 c_main_~y~0) .cse9)))))) (<= c_main_~x~0 1) (or (not (= c_main_~y~0 .cse11)) .cse7 .cse9) (<= 1 c_main_~x~0) (or (not (= .cse10 c_main_~y~0)) .cse6) (or .cse15 (and .cse2 (<= c_main_~y~0 .cse8) .cse4) (and .cse0 (<= c_main_~y~0 .cse5)) .cse16))))) (or (and .cse2 (<= 0 .cse19) .cse4) (and (or (< 0 .cse1) .cse6) (or .cse7 (< 0 .cse3) .cse9)) (and .cse0 (<= 0 .cse20))))))))) is different from false [2019-09-08 02:41:26,161 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse23 (div c_main_~y~0 2))) (let ((.cse10 (* 2 .cse23))) (let ((.cse2 (= .cse10 c_main_~y~0)) (.cse21 (* (- 2) .cse23)) (.cse22 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse4 (<= .cse22 c_main_~y~0)) (.cse17 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse7 (not .cse2)) (.cse9 (< c_main_~y~0 .cse22)) (.cse18 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse19 (+ .cse18 1)) (.cse1 (and .cse7 .cse9)) (.cse20 (+ .cse17 1)) (.cse5 (or .cse2 .cse4))) (and (or (let ((.cse12 (* 4294967296 .cse18)) (.cse11 (* 4294967296 .cse17))) (let ((.cse8 (+ .cse10 .cse11 2)) (.cse6 (+ .cse10 .cse12)) (.cse13 (and .cse5 (<= c_main_~y~0 (+ .cse10 1)))) (.cse3 (+ .cse10 .cse11 3)) (.cse0 (+ .cse10 .cse12 1)) (.cse14 (and .cse7 (<= c_main_~y~0 (+ .cse10 3)) .cse9))) (and (or (and (or (< .cse0 c_main_~y~0) .cse1) (or .cse2 (< .cse3 c_main_~y~0) .cse4)) (let ((.cse15 (and .cse7 (<= .cse8 c_main_~y~0) .cse9)) (.cse16 (and .cse5 (<= .cse6 c_main_~y~0)))) (and (or (and .cse5 (<= c_main_~y~0 .cse6)) (and .cse7 (<= c_main_~y~0 .cse8) .cse9) (and .cse7 (<= c_main_~y~0 (+ .cse10 .cse11 4294967297)) .cse9) (and .cse5 (<= c_main_~y~0 (+ .cse10 .cse12 4294967295)))) (or .cse13 .cse14) (or .cse15 .cse16) (or .cse15 .cse16 (and (or .cse1 (< .cse6 c_main_~y~0)) (or .cse2 (< .cse8 c_main_~y~0) .cse4)))))) (<= c_main_~x~0 3) (or (not (= c_main_~y~0 .cse8)) .cse2 .cse4) (or (not (= .cse6 c_main_~y~0)) .cse1) (<= 3 c_main_~x~0) (or .cse13 (and .cse7 (<= c_main_~y~0 .cse3) .cse9) (and .cse5 (<= c_main_~y~0 .cse0)) .cse14)))) (and .cse5 (<= .cse19 0)) (and .cse7 (<= .cse20 0) .cse9)) (or (and .cse7 (<= 0 .cse17) .cse9) (and (or (< 0 .cse19) .cse1) (or .cse2 (< 0 .cse20) .cse4)) (and .cse5 (<= 0 .cse18))))))))) is different from false [2019-09-08 02:41:28,203 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse22 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse22))) (let ((.cse8 (= .cse13 c_main_~y~0)) (.cse20 (* (- 2) .cse22)) (.cse21 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse21 c_main_~y~0)) (.cse18 (div (+ .cse20 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse8)) (.cse4 (< c_main_~y~0 .cse21)) (.cse19 (div (+ .cse20 c_main_~y~0) 4294967296))) (let ((.cse1 (+ .cse19 1)) (.cse7 (and .cse2 .cse4)) (.cse3 (+ .cse18 1)) (.cse0 (or .cse8 .cse10))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse15 (* 4294967296 .cse19)) (.cse14 (* 4294967296 .cse18))) (let ((.cse5 (+ c_main_~x~0 1)) (.cse16 (and .cse0 (<= c_main_~y~0 (+ .cse13 1)))) (.cse9 (+ .cse13 .cse14 3)) (.cse6 (+ .cse13 .cse15 1)) (.cse17 (and .cse2 (<= c_main_~y~0 (+ .cse13 3)) .cse4))) (and (<= .cse5 0) (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (let ((.cse12 (+ .cse13 .cse14 2)) (.cse11 (+ .cse13 .cse15))) (and (or (and .cse2 .cse4 (<= .cse9 c_main_~y~0)) (and (or .cse7 (< .cse11 c_main_~y~0)) (or .cse8 (< .cse12 c_main_~y~0) .cse10)) (and .cse0 (<= .cse6 c_main_~y~0))) (or (and .cse0 (<= c_main_~y~0 .cse11)) (and .cse2 (<= c_main_~y~0 .cse12) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse13 .cse14 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)))) (or .cse16 .cse17) (or (and .cse2 (<= .cse12 c_main_~y~0) .cse4) (and .cse0 (<= .cse11 c_main_~y~0)))))) (<= 0 .cse5) (or .cse16 (and .cse2 (<= c_main_~y~0 .cse9) .cse4) (and .cse0 (<= c_main_~y~0 .cse6)) .cse17))))) (or (and .cse2 (<= 0 .cse18) .cse4) (and (or (< 0 .cse1) .cse7) (or .cse8 (< 0 .cse3) .cse10)) (and .cse0 (<= 0 .cse19))))))))) is different from false [2019-09-08 02:41:50,625 WARN L188 SmtUtils]: Spent 20.37 s on a formula simplification. DAG size of input: 181 DAG size of output: 21 [2019-09-08 02:41:52,678 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse48 (div c_main_~y~0 2))) (let ((.cse12 (* 2 .cse48))) (let ((.cse35 (= .cse12 c_main_~y~0)) (.cse46 (* (- 2) .cse48)) (.cse47 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse36 (<= .cse47 c_main_~y~0)) (.cse44 (div (+ .cse46 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse35)) (.cse4 (< c_main_~y~0 .cse47)) (.cse45 (div (+ .cse46 c_main_~y~0) 4294967296))) (let ((.cse1 (+ .cse45 1)) (.cse34 (and .cse2 .cse4)) (.cse3 (+ .cse44 1)) (.cse0 (or .cse35 .cse36))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse43 (div c_main_~x~0 2))) (let ((.cse6 (+ c_main_~x~0 5)) (.cse5 (+ .cse43 3))) (and (or (<= .cse5 0) (<= .cse6 0)) (or (let ((.cse14 (* 4294967296 .cse45)) (.cse13 (* 4294967296 .cse44))) (let ((.cse20 (and .cse0 (<= c_main_~y~0 (+ .cse12 1)))) (.cse42 (+ .cse12 .cse13 3)) (.cse41 (+ .cse12 .cse14 1)) (.cse27 (and .cse2 (<= c_main_~y~0 (+ .cse12 3)) .cse4))) (and (<= 0 .cse6) (or (let ((.cse39 (* 2 .cse43)) (.cse37 (* 4294967296 (div c_main_~x~0 4294967296)))) (let ((.cse40 (* (- 2) .cse43)) (.cse10 (+ .cse12 .cse14)) (.cse11 (+ .cse12 .cse13 2)) (.cse32 (<= .cse37 c_main_~x~0)) (.cse33 (= c_main_~x~0 .cse39))) (let ((.cse19 (or .cse32 .cse33)) (.cse7 (and .cse2 .cse4 (<= .cse42 c_main_~y~0))) (.cse8 (and (or .cse34 (< .cse10 c_main_~y~0)) (or .cse35 (< .cse11 c_main_~y~0) .cse36))) (.cse9 (and .cse0 (<= .cse41 c_main_~y~0))) (.cse18 (div (+ c_main_~x~0 .cse40) 4294967296)) (.cse16 (div (+ c_main_~x~0 .cse40 (- 2)) 4294967296)) (.cse15 (not .cse33)) (.cse17 (< c_main_~x~0 .cse37))) (and (or (and (or .cse7 .cse8 .cse9) (or (and .cse0 (<= c_main_~y~0 .cse10)) (and .cse2 (<= c_main_~y~0 .cse11) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse12 .cse13 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse12 .cse14 4294967295))))) (and .cse15 (<= .cse16 0) .cse17) (and (<= .cse18 0) .cse19)) (let ((.cse31 (and .cse15 .cse17))) (or (let ((.cse38 (* 4294967296 .cse16))) (let ((.cse28 (<= c_main_~x~0 .cse39)) (.cse26 (+ .cse12 c_main_~x~0 .cse13 2)) (.cse25 (+ c_main_~y~0 .cse39 (* 4294967296 .cse18))) (.cse22 (+ .cse12 c_main_~x~0 .cse13)) (.cse21 (+ c_main_~y~0 .cse38 .cse39)) (.cse24 (+ .cse12 c_main_~x~0 .cse14)) (.cse23 (+ c_main_~y~0 .cse38 .cse39 2))) (and (or .cse20 (and .cse15 (or (and .cse2 (<= .cse21 .cse22) .cse4) (and .cse0 (<= .cse23 .cse24))) .cse17) (and .cse19 (or (and .cse2 .cse4 (<= .cse25 .cse26)) (and .cse0 (<= .cse25 .cse24)))) .cse27 .cse28) (or (let ((.cse29 (+ .cse18 1)) (.cse30 (+ .cse16 1))) (and (or (and .cse19 (<= .cse29 0)) (and .cse15 .cse17 (<= .cse30 0)) .cse7 .cse8 .cse9) (or (and .cse2 (<= .cse11 c_main_~y~0) .cse4) (and (or .cse31 (< 0 .cse29)) (or .cse32 (< 0 .cse30) .cse33)) (and .cse0 (<= .cse10 c_main_~y~0)) .cse28))) (and (or .cse31 (and (or (< .cse24 .cse25) .cse34) (or .cse35 .cse36 (< .cse26 .cse25)))) (or .cse32 (and (or (< .cse22 .cse21) .cse35 .cse36) (or .cse34 (< .cse24 .cse23))) .cse33))) (< .cse37 (+ c_main_~x~0 1))))) (and (or .cse31 (< 0 .cse18)) (or (< 0 .cse16) .cse32 .cse33)))))))) (and (or (< .cse41 c_main_~y~0) .cse34) (or .cse35 (< .cse42 c_main_~y~0) .cse36))) (or .cse20 (and .cse2 (<= c_main_~y~0 .cse42) .cse4) (and .cse0 (<= c_main_~y~0 .cse41)) .cse27)))) (< 0 .cse5)))))) (or (and .cse2 (<= 0 .cse44) .cse4) (and (or (< 0 .cse1) .cse34) (or .cse35 (< 0 .cse3) .cse36)) (and .cse0 (<= 0 .cse45))))))))) is different from true [2019-09-08 02:41:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:52,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:52,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:52,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:52,756 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 02:41:52,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:52,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:52,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:52,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2019-09-08 02:41:52,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 02:41:52,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 02:41:52,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=115, Unknown=8, NotChecked=182, Total=342 [2019-09-08 02:41:52,957 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 19 states. [2019-09-08 02:41:55,009 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse22 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse22))) (let ((.cse3 (= .cse13 c_main_~y~0)) (.cse21 (* (- 2) .cse22)) (.cse20 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse5 (<= .cse20 c_main_~y~0)) (.cse16 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse9 (not .cse3)) (.cse11 (< c_main_~y~0 .cse20)) (.cse17 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse0 (<= c_main_~x~0 1)) (.cse12 (<= 1 c_main_~x~0)) (.cse18 (+ .cse17 1)) (.cse2 (and .cse9 .cse11)) (.cse19 (+ .cse16 1)) (.cse6 (or .cse3 .cse5))) (and .cse0 (or (let ((.cse14 (* 4294967296 .cse17)) (.cse15 (* 4294967296 .cse16))) (let ((.cse10 (+ .cse13 .cse15 2)) (.cse8 (+ .cse13 .cse14)) (.cse7 (<= c_main_~y~0 (+ .cse13 1))) (.cse4 (+ .cse13 .cse15 3)) (.cse1 (+ .cse13 .cse14 1))) (and (or (and (or (< .cse1 c_main_~y~0) .cse2) (or .cse3 (< .cse4 c_main_~y~0) .cse5)) (and .cse6 .cse7 (or (and .cse6 (<= c_main_~y~0 .cse8)) (and .cse9 (<= c_main_~y~0 .cse10) .cse11) .cse3 .cse2 .cse5) (or (and .cse9 (<= .cse10 c_main_~y~0) .cse11) (and .cse6 (<= .cse8 c_main_~y~0)) (and (or .cse2 (< .cse8 c_main_~y~0)) (or .cse3 (< .cse10 c_main_~y~0) .cse5))))) .cse0 (or (not (= c_main_~y~0 .cse10)) .cse3 .cse5) .cse12 (or (not (= .cse8 c_main_~y~0)) .cse2) (or (and .cse6 .cse7) (and .cse9 (<= c_main_~y~0 .cse4) .cse11) (and .cse6 (<= c_main_~y~0 .cse1)) (and .cse9 (<= c_main_~y~0 (+ .cse13 3)) .cse11))))) (and .cse6 (<= .cse18 0)) (and .cse9 (<= .cse19 0) .cse11)) (< .cse20 (+ c_main_~y~0 1)) .cse12 (not (= (mod c_main_~y~0 2) 0)) (or (and .cse9 (<= 0 .cse16) .cse11) (and (or (< 0 .cse18) .cse2) (or .cse3 (< 0 .cse19) .cse5)) (and .cse6 (<= 0 .cse17))))))))) is different from false [2019-09-08 02:41:57,018 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse22 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse22))) (let ((.cse3 (= .cse13 c_main_~y~0)) (.cse21 (* (- 2) .cse22)) (.cse20 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse5 (<= .cse20 c_main_~y~0)) (.cse16 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse9 (not .cse3)) (.cse11 (< c_main_~y~0 .cse20)) (.cse17 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse0 (<= c_main_~x~0 1)) (.cse12 (<= 1 c_main_~x~0)) (.cse18 (+ .cse17 1)) (.cse2 (and .cse9 .cse11)) (.cse19 (+ .cse16 1)) (.cse6 (or .cse3 .cse5))) (and .cse0 (or (let ((.cse14 (* 4294967296 .cse17)) (.cse15 (* 4294967296 .cse16))) (let ((.cse10 (+ .cse13 .cse15 2)) (.cse8 (+ .cse13 .cse14)) (.cse7 (<= c_main_~y~0 (+ .cse13 1))) (.cse4 (+ .cse13 .cse15 3)) (.cse1 (+ .cse13 .cse14 1))) (and (or (and (or (< .cse1 c_main_~y~0) .cse2) (or .cse3 (< .cse4 c_main_~y~0) .cse5)) (and .cse6 .cse7 (or (and .cse6 (<= c_main_~y~0 .cse8)) (and .cse9 (<= c_main_~y~0 .cse10) .cse11) .cse3 .cse2 .cse5) (or (and .cse9 (<= .cse10 c_main_~y~0) .cse11) (and .cse6 (<= .cse8 c_main_~y~0)) (and (or .cse2 (< .cse8 c_main_~y~0)) (or .cse3 (< .cse10 c_main_~y~0) .cse5))))) .cse0 (or (not (= c_main_~y~0 .cse10)) .cse3 .cse5) .cse12 (or (not (= .cse8 c_main_~y~0)) .cse2) (or (and .cse6 .cse7) (and .cse9 (<= c_main_~y~0 .cse4) .cse11) (and .cse6 (<= c_main_~y~0 .cse1)) (and .cse9 (<= c_main_~y~0 (+ .cse13 3)) .cse11))))) (and .cse6 (<= .cse18 0)) (and .cse9 (<= .cse19 0) .cse11)) (< .cse20 (+ c_main_~y~0 1)) .cse12 (not (= (mod c_main_~y~0 2) 0)) (or (and .cse9 (<= 0 .cse16) .cse11) (and (or (< 0 .cse18) .cse2) (or .cse3 (< 0 .cse19) .cse5)) (and .cse6 (<= 0 .cse17))))))))) is different from true [2019-09-08 02:41:59,064 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse23 (div c_main_~y~0 2))) (let ((.cse16 (* 2 .cse23))) (let ((.cse10 (= .cse16 c_main_~y~0)) (.cse22 (* (- 2) .cse23)) (.cse1 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse12 (<= .cse1 c_main_~y~0)) (.cse19 (div (+ .cse22 c_main_~y~0 (- 2)) 4294967296)) (.cse5 (not .cse10)) (.cse7 (< c_main_~y~0 .cse1)) (.cse20 (div (+ .cse22 c_main_~y~0) 4294967296)) (.cse21 (+ c_main_~x~0 1))) (let ((.cse0 (<= .cse21 0)) (.cse2 (<= 0 .cse21)) (.cse4 (+ .cse20 1)) (.cse9 (and .cse5 .cse7)) (.cse6 (+ .cse19 1)) (.cse3 (or .cse10 .cse12))) (and .cse0 (< .cse1 (+ c_main_~y~0 1)) .cse2 (or (and .cse3 (<= .cse4 0)) (and .cse5 (<= .cse6 0) .cse7) (let ((.cse17 (* 4294967296 .cse20)) (.cse18 (* 4294967296 .cse19))) (let ((.cse15 (+ .cse16 .cse18 2)) (.cse14 (+ .cse16 .cse17)) (.cse13 (<= c_main_~y~0 (+ .cse16 1))) (.cse11 (+ .cse16 .cse18 3)) (.cse8 (+ .cse16 .cse17 1))) (and (or (and (or (< .cse8 c_main_~y~0) .cse9) (or .cse10 (< .cse11 c_main_~y~0) .cse12)) (and .cse3 .cse13 (or (and .cse3 (<= c_main_~y~0 .cse14)) (and .cse5 (<= c_main_~y~0 .cse15) .cse7) .cse10 .cse9 .cse12) (or (and .cse5 (<= .cse15 c_main_~y~0) .cse7) (and .cse3 (<= .cse14 c_main_~y~0)) (and (or .cse9 (< .cse14 c_main_~y~0)) (or .cse10 (< .cse15 c_main_~y~0) .cse12))))) .cse0 (or (not (= c_main_~y~0 .cse15)) .cse10 .cse12) .cse2 (or (not (= .cse14 c_main_~y~0)) .cse9) (or (and .cse3 .cse13) (and .cse5 (<= c_main_~y~0 .cse11) .cse7) (and .cse3 (<= c_main_~y~0 .cse8)) (and .cse5 (<= c_main_~y~0 (+ .cse16 3)) .cse7)))))) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse5 (<= 0 .cse19) .cse7) (and (or (< 0 .cse4) .cse9) (or .cse10 (< 0 .cse6) .cse12)) (and .cse3 (<= 0 .cse20))))))))) is different from false [2019-09-08 02:42:01,106 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse26 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse26))) (let ((.cse8 (= .cse13 c_main_~y~0)) (.cse24 (* (- 2) .cse26)) (.cse25 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse25 c_main_~y~0)) (.cse21 (div (+ .cse24 c_main_~y~0 (- 2)) 4294967296)) (.cse3 (not .cse8)) (.cse5 (< c_main_~y~0 .cse25)) (.cse22 (div (+ .cse24 c_main_~y~0) 4294967296)) (.cse23 (+ c_main_~x~0 3))) (let ((.cse0 (<= 0 .cse23)) (.cse20 (<= .cse23 0)) (.cse2 (+ .cse22 1)) (.cse7 (and .cse3 .cse5)) (.cse4 (+ .cse21 1)) (.cse1 (or .cse8 .cse10))) (and .cse0 (or (and .cse1 (<= .cse2 0)) (and .cse3 (<= .cse4 0) .cse5) (let ((.cse15 (* 4294967296 .cse22)) (.cse14 (* 4294967296 .cse21))) (let ((.cse12 (+ .cse13 .cse14 2)) (.cse11 (+ .cse13 .cse15)) (.cse16 (and .cse1 (<= c_main_~y~0 (+ .cse13 1)))) (.cse9 (+ .cse13 .cse14 3)) (.cse6 (+ .cse13 .cse15 1)) (.cse17 (and .cse3 (<= c_main_~y~0 (+ .cse13 3)) .cse5))) (and .cse0 (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (let ((.cse18 (and .cse3 (<= .cse12 c_main_~y~0) .cse5)) (.cse19 (and .cse1 (<= .cse11 c_main_~y~0)))) (and (or (and .cse1 (<= c_main_~y~0 .cse11)) (and .cse3 (<= c_main_~y~0 .cse12) .cse5) (and .cse3 (<= c_main_~y~0 (+ .cse13 .cse14 4294967297)) .cse5) (and .cse1 (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)))) (or .cse16 .cse17) (or .cse18 .cse19) (or .cse18 .cse19 (and (or .cse7 (< .cse11 c_main_~y~0)) (or .cse8 (< .cse12 c_main_~y~0) .cse10)))))) (or (not (= c_main_~y~0 .cse12)) .cse8 .cse10) (or (not (= .cse11 c_main_~y~0)) .cse7) .cse20 (or .cse16 (and .cse3 (<= c_main_~y~0 .cse9) .cse5) (and .cse1 (<= c_main_~y~0 .cse6)) .cse17))))) .cse20 (not (= (mod c_main_~y~0 2) 0)) (or (and .cse3 (<= 0 .cse21) .cse5) (and (or (< 0 .cse2) .cse7) (or .cse8 (< 0 .cse4) .cse10)) (and .cse1 (<= 0 .cse22))))))))) is different from true [2019-09-08 02:42:03,142 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse25 (div c_main_~y~0 2))) (let ((.cse12 (* 2 .cse25))) (let ((.cse7 (= .cse12 c_main_~y~0)) (.cse23 (* (- 2) .cse25)) (.cse24 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse24 c_main_~y~0)) (.cse21 (div (+ .cse23 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse7)) (.cse4 (< c_main_~y~0 .cse24)) (.cse22 (div (+ .cse23 c_main_~y~0) 4294967296))) (let ((.cse19 (<= c_main_~x~0 1)) (.cse20 (<= 1 c_main_~x~0)) (.cse1 (+ .cse22 1)) (.cse6 (and .cse2 .cse4)) (.cse3 (+ .cse21 1)) (.cse0 (or .cse7 .cse9))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse14 (* 4294967296 .cse22)) (.cse13 (* 4294967296 .cse21))) (let ((.cse11 (+ .cse12 .cse13 2)) (.cse10 (+ .cse12 .cse14)) (.cse15 (and .cse0 (<= c_main_~y~0 (+ .cse12 1)))) (.cse8 (+ .cse12 .cse13 3)) (.cse5 (+ .cse12 .cse14 1)) (.cse16 (and .cse2 (<= c_main_~y~0 (+ .cse12 3)) .cse4))) (and (or (and (or (< .cse5 c_main_~y~0) .cse6) (or .cse7 (< .cse8 c_main_~y~0) .cse9)) (let ((.cse17 (and .cse2 (<= .cse11 c_main_~y~0) .cse4)) (.cse18 (and .cse0 (<= .cse10 c_main_~y~0)))) (and (or (and .cse0 (<= c_main_~y~0 .cse10)) (and .cse2 (<= c_main_~y~0 .cse11) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse12 .cse13 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse12 .cse14 4294967295)))) (or .cse15 .cse16) (or .cse17 .cse18) (or .cse17 .cse18 (and (or .cse6 (< .cse10 c_main_~y~0)) (or .cse7 (< .cse11 c_main_~y~0) .cse9)))))) .cse19 (or (not (= c_main_~y~0 .cse11)) .cse7 .cse9) .cse20 (or (not (= .cse10 c_main_~y~0)) .cse6) (or .cse15 (and .cse2 (<= c_main_~y~0 .cse8) .cse4) (and .cse0 (<= c_main_~y~0 .cse5)) .cse16))))) .cse19 .cse20 (not (= (mod c_main_~y~0 2) 0)) (or (and .cse2 (<= 0 .cse21) .cse4) (and (or (< 0 .cse1) .cse6) (or .cse7 (< 0 .cse3) .cse9)) (and .cse0 (<= 0 .cse22))))))))) is different from true [2019-09-08 02:42:05,169 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse25 (div c_main_~y~0 2))) (let ((.cse10 (* 2 .cse25))) (let ((.cse2 (= .cse10 c_main_~y~0)) (.cse23 (* (- 2) .cse25)) (.cse24 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse4 (<= .cse24 c_main_~y~0)) (.cse19 (div (+ .cse23 c_main_~y~0 (- 2)) 4294967296)) (.cse7 (not .cse2)) (.cse9 (< c_main_~y~0 .cse24)) (.cse20 (div (+ .cse23 c_main_~y~0) 4294967296))) (let ((.cse17 (<= c_main_~x~0 3)) (.cse18 (<= 3 c_main_~x~0)) (.cse21 (+ .cse20 1)) (.cse1 (and .cse7 .cse9)) (.cse22 (+ .cse19 1)) (.cse5 (or .cse2 .cse4))) (and (or (let ((.cse12 (* 4294967296 .cse20)) (.cse11 (* 4294967296 .cse19))) (let ((.cse8 (+ .cse10 .cse11 2)) (.cse6 (+ .cse10 .cse12)) (.cse13 (and .cse5 (<= c_main_~y~0 (+ .cse10 1)))) (.cse3 (+ .cse10 .cse11 3)) (.cse0 (+ .cse10 .cse12 1)) (.cse14 (and .cse7 (<= c_main_~y~0 (+ .cse10 3)) .cse9))) (and (or (and (or (< .cse0 c_main_~y~0) .cse1) (or .cse2 (< .cse3 c_main_~y~0) .cse4)) (let ((.cse15 (and .cse7 (<= .cse8 c_main_~y~0) .cse9)) (.cse16 (and .cse5 (<= .cse6 c_main_~y~0)))) (and (or (and .cse5 (<= c_main_~y~0 .cse6)) (and .cse7 (<= c_main_~y~0 .cse8) .cse9) (and .cse7 (<= c_main_~y~0 (+ .cse10 .cse11 4294967297)) .cse9) (and .cse5 (<= c_main_~y~0 (+ .cse10 .cse12 4294967295)))) (or .cse13 .cse14) (or .cse15 .cse16) (or .cse15 .cse16 (and (or .cse1 (< .cse6 c_main_~y~0)) (or .cse2 (< .cse8 c_main_~y~0) .cse4)))))) .cse17 (or (not (= c_main_~y~0 .cse8)) .cse2 .cse4) (or (not (= .cse6 c_main_~y~0)) .cse1) .cse18 (or .cse13 (and .cse7 (<= c_main_~y~0 .cse3) .cse9) (and .cse5 (<= c_main_~y~0 .cse0)) .cse14)))) (and .cse5 (<= .cse21 0)) (and .cse7 (<= .cse22 0) .cse9)) .cse17 (not (= (mod c_main_~y~0 2) 0)) .cse18 (or (and .cse7 (<= 0 .cse19) .cse9) (and (or (< 0 .cse21) .cse1) (or .cse2 (< 0 .cse22) .cse4)) (and .cse5 (<= 0 .cse20))))))))) is different from true [2019-09-08 02:42:07,185 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse24 (div c_main_~y~0 2))) (let ((.cse14 (* 2 .cse24))) (let ((.cse9 (= .cse14 c_main_~y~0)) (.cse22 (* (- 2) .cse24)) (.cse23 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse11 (<= .cse23 c_main_~y~0)) (.cse19 (div (+ .cse22 c_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse9)) (.cse6 (< c_main_~y~0 .cse23)) (.cse20 (div (+ .cse22 c_main_~y~0) 4294967296)) (.cse21 (+ c_main_~x~0 1))) (let ((.cse0 (<= .cse21 0)) (.cse1 (<= 0 .cse21)) (.cse3 (+ .cse20 1)) (.cse8 (and .cse4 .cse6)) (.cse5 (+ .cse19 1)) (.cse2 (or .cse9 .cse11))) (and .cse0 .cse1 (or (and .cse2 (<= .cse3 0)) (and .cse4 (<= .cse5 0) .cse6) (let ((.cse16 (* 4294967296 .cse20)) (.cse15 (* 4294967296 .cse19))) (let ((.cse17 (and .cse2 (<= c_main_~y~0 (+ .cse14 1)))) (.cse10 (+ .cse14 .cse15 3)) (.cse7 (+ .cse14 .cse16 1)) (.cse18 (and .cse4 (<= c_main_~y~0 (+ .cse14 3)) .cse6))) (and .cse0 (or (and (or (< .cse7 c_main_~y~0) .cse8) (or .cse9 (< .cse10 c_main_~y~0) .cse11)) (let ((.cse13 (+ .cse14 .cse15 2)) (.cse12 (+ .cse14 .cse16))) (and (or (and .cse4 .cse6 (<= .cse10 c_main_~y~0)) (and (or .cse8 (< .cse12 c_main_~y~0)) (or .cse9 (< .cse13 c_main_~y~0) .cse11)) (and .cse2 (<= .cse7 c_main_~y~0))) (or (and .cse2 (<= c_main_~y~0 .cse12)) (and .cse4 (<= c_main_~y~0 .cse13) .cse6) (and .cse4 (<= c_main_~y~0 (+ .cse14 .cse15 4294967297)) .cse6) (and .cse2 (<= c_main_~y~0 (+ .cse14 .cse16 4294967295)))) (or .cse17 .cse18) (or (and .cse4 (<= .cse13 c_main_~y~0) .cse6) (and .cse2 (<= .cse12 c_main_~y~0)))))) .cse1 (or .cse17 (and .cse4 (<= c_main_~y~0 .cse10) .cse6) (and .cse2 (<= c_main_~y~0 .cse7)) .cse18))))) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 (<= 0 .cse19) .cse6) (and (or (< 0 .cse3) .cse8) (or .cse9 (< 0 .cse5) .cse11)) (and .cse2 (<= 0 .cse20))))))))) is different from false [2019-09-08 02:42:09,194 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse24 (div c_main_~y~0 2))) (let ((.cse14 (* 2 .cse24))) (let ((.cse9 (= .cse14 c_main_~y~0)) (.cse22 (* (- 2) .cse24)) (.cse23 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse11 (<= .cse23 c_main_~y~0)) (.cse19 (div (+ .cse22 c_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse9)) (.cse6 (< c_main_~y~0 .cse23)) (.cse20 (div (+ .cse22 c_main_~y~0) 4294967296)) (.cse21 (+ c_main_~x~0 1))) (let ((.cse0 (<= .cse21 0)) (.cse1 (<= 0 .cse21)) (.cse3 (+ .cse20 1)) (.cse8 (and .cse4 .cse6)) (.cse5 (+ .cse19 1)) (.cse2 (or .cse9 .cse11))) (and .cse0 .cse1 (or (and .cse2 (<= .cse3 0)) (and .cse4 (<= .cse5 0) .cse6) (let ((.cse16 (* 4294967296 .cse20)) (.cse15 (* 4294967296 .cse19))) (let ((.cse17 (and .cse2 (<= c_main_~y~0 (+ .cse14 1)))) (.cse10 (+ .cse14 .cse15 3)) (.cse7 (+ .cse14 .cse16 1)) (.cse18 (and .cse4 (<= c_main_~y~0 (+ .cse14 3)) .cse6))) (and .cse0 (or (and (or (< .cse7 c_main_~y~0) .cse8) (or .cse9 (< .cse10 c_main_~y~0) .cse11)) (let ((.cse13 (+ .cse14 .cse15 2)) (.cse12 (+ .cse14 .cse16))) (and (or (and .cse4 .cse6 (<= .cse10 c_main_~y~0)) (and (or .cse8 (< .cse12 c_main_~y~0)) (or .cse9 (< .cse13 c_main_~y~0) .cse11)) (and .cse2 (<= .cse7 c_main_~y~0))) (or (and .cse2 (<= c_main_~y~0 .cse12)) (and .cse4 (<= c_main_~y~0 .cse13) .cse6) (and .cse4 (<= c_main_~y~0 (+ .cse14 .cse15 4294967297)) .cse6) (and .cse2 (<= c_main_~y~0 (+ .cse14 .cse16 4294967295)))) (or .cse17 .cse18) (or (and .cse4 (<= .cse13 c_main_~y~0) .cse6) (and .cse2 (<= .cse12 c_main_~y~0)))))) .cse1 (or .cse17 (and .cse4 (<= c_main_~y~0 .cse10) .cse6) (and .cse2 (<= c_main_~y~0 .cse7)) .cse18))))) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 (<= 0 .cse19) .cse6) (and (or (< 0 .cse3) .cse8) (or .cse9 (< 0 .cse5) .cse11)) (and .cse2 (<= 0 .cse20))))))))) is different from true [2019-09-08 02:42:11,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse51 (div c_main_~y~0 2))) (let ((.cse50 (* (- 2) .cse51))) (let ((.cse14 (* 2 .cse51)) (.cse47 (div (+ .cse50 c_main_~y~0) 4294967296))) (let ((.cse16 (* 4294967296 .cse47)) (.cse37 (= .cse14 c_main_~y~0)) (.cse49 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse38 (<= .cse49 c_main_~y~0)) (.cse46 (div (+ .cse50 c_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse37)) (.cse6 (< c_main_~y~0 .cse49)) (.cse45 (+ .cse14 .cse16 1)) (.cse48 (+ c_main_~x~0 5))) (let ((.cse0 (<= 0 .cse48)) (.cse1 (<= .cse45 c_main_~y~0)) (.cse8 (<= .cse48 0)) (.cse3 (+ .cse47 1)) (.cse36 (and .cse4 .cse6)) (.cse5 (+ .cse46 1)) (.cse2 (or .cse37 .cse38))) (and .cse0 .cse1 (or (and .cse2 (<= .cse3 0)) (and .cse4 (<= .cse5 0) .cse6) (let ((.cse44 (div c_main_~x~0 2))) (let ((.cse7 (+ .cse44 3))) (and (or (<= .cse7 0) .cse8) (or (let ((.cse15 (* 4294967296 .cse46))) (let ((.cse22 (and .cse2 (<= c_main_~y~0 (+ .cse14 1)))) (.cse43 (+ .cse14 .cse15 3)) (.cse29 (and .cse4 (<= c_main_~y~0 (+ .cse14 3)) .cse6))) (and .cse0 (or (let ((.cse41 (* 2 .cse44)) (.cse39 (* 4294967296 (div c_main_~x~0 4294967296)))) (let ((.cse42 (* (- 2) .cse44)) (.cse12 (+ .cse14 .cse16)) (.cse13 (+ .cse14 .cse15 2)) (.cse34 (<= .cse39 c_main_~x~0)) (.cse35 (= c_main_~x~0 .cse41))) (let ((.cse21 (or .cse34 .cse35)) (.cse9 (and .cse4 .cse6 (<= .cse43 c_main_~y~0))) (.cse10 (and (or .cse36 (< .cse12 c_main_~y~0)) (or .cse37 (< .cse13 c_main_~y~0) .cse38))) (.cse11 (and .cse2 .cse1)) (.cse20 (div (+ c_main_~x~0 .cse42) 4294967296)) (.cse18 (div (+ c_main_~x~0 .cse42 (- 2)) 4294967296)) (.cse17 (not .cse35)) (.cse19 (< c_main_~x~0 .cse39))) (and (or (and (or .cse9 .cse10 .cse11) (or (and .cse2 (<= c_main_~y~0 .cse12)) (and .cse4 (<= c_main_~y~0 .cse13) .cse6) (and .cse4 (<= c_main_~y~0 (+ .cse14 .cse15 4294967297)) .cse6) (and .cse2 (<= c_main_~y~0 (+ .cse14 .cse16 4294967295))))) (and .cse17 (<= .cse18 0) .cse19) (and (<= .cse20 0) .cse21)) (let ((.cse33 (and .cse17 .cse19))) (or (let ((.cse40 (* 4294967296 .cse18))) (let ((.cse30 (<= c_main_~x~0 .cse41)) (.cse28 (+ .cse14 c_main_~x~0 .cse15 2)) (.cse27 (+ c_main_~y~0 .cse41 (* 4294967296 .cse20))) (.cse24 (+ .cse14 c_main_~x~0 .cse15)) (.cse23 (+ c_main_~y~0 .cse40 .cse41)) (.cse26 (+ .cse14 c_main_~x~0 .cse16)) (.cse25 (+ c_main_~y~0 .cse40 .cse41 2))) (and (or .cse22 (and .cse17 (or (and .cse4 (<= .cse23 .cse24) .cse6) (and .cse2 (<= .cse25 .cse26))) .cse19) (and .cse21 (or (and .cse4 .cse6 (<= .cse27 .cse28)) (and .cse2 (<= .cse27 .cse26)))) .cse29 .cse30) (or (let ((.cse31 (+ .cse20 1)) (.cse32 (+ .cse18 1))) (and (or (and .cse21 (<= .cse31 0)) (and .cse17 .cse19 (<= .cse32 0)) .cse9 .cse10 .cse11) (or (and .cse4 (<= .cse13 c_main_~y~0) .cse6) (and (or .cse33 (< 0 .cse31)) (or .cse34 (< 0 .cse32) .cse35)) (and .cse2 (<= .cse12 c_main_~y~0)) .cse30))) (and (or .cse33 (and (or (< .cse26 .cse27) .cse36) (or .cse37 .cse38 (< .cse28 .cse27)))) (or .cse34 (and (or (< .cse24 .cse23) .cse37 .cse38) (or .cse36 (< .cse26 .cse25))) .cse35))) (< .cse39 (+ c_main_~x~0 1))))) (and (or .cse33 (< 0 .cse20)) (or (< 0 .cse18) .cse34 .cse35)))))))) (and (or (< .cse45 c_main_~y~0) .cse36) (or .cse37 (< .cse43 c_main_~y~0) .cse38))) (or .cse22 (and .cse4 (<= c_main_~y~0 .cse43) .cse6) (and .cse2 (<= c_main_~y~0 .cse45)) .cse29)))) (< 0 .cse7)))))) .cse8 (or (and .cse4 (<= 0 .cse46) .cse6) (and (or (< 0 .cse3) .cse36) (or .cse37 (< 0 .cse5) .cse38)) (and .cse2 (<= 0 .cse47)))))))))) is different from false [2019-09-08 02:42:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:11,286 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-09-08 02:42:11,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:42:11,286 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-09-08 02:42:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:11,287 INFO L225 Difference]: With dead ends: 62 [2019-09-08 02:42:11,287 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 02:42:11,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=57, Invalid=138, Unknown=17, NotChecked=490, Total=702 [2019-09-08 02:42:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 02:42:11,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-08 02:42:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:42:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-08 02:42:11,292 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 21 [2019-09-08 02:42:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:11,293 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-08 02:42:11,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 02:42:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-08 02:42:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 02:42:11,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:11,294 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:11,294 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1061692130, now seen corresponding path program 2 times [2019-09-08 02:42:11,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:11,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:11,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:42:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:11,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:11,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:11,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:42:11,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:42:11,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:11,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:42:11,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:11,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:11,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-08 02:42:11,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:42:11,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:42:11,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:42:11,786 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2019-09-08 02:42:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:12,231 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-08 02:42:12,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 02:42:12,232 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-09-08 02:42:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:12,233 INFO L225 Difference]: With dead ends: 50 [2019-09-08 02:42:12,233 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 02:42:12,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:42:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 02:42:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-08 02:42:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 02:42:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-08 02:42:12,239 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 32 [2019-09-08 02:42:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:12,239 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-08 02:42:12,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:42:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-08 02:42:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 02:42:12,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:12,241 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:12,241 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash 263609359, now seen corresponding path program 3 times [2019-09-08 02:42:12,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:12,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:12,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:12,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:12,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:12,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:12,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:42:12,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:13,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:42:13,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:13,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 02:42:13,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:13,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:13,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-08 02:42:13,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 02:42:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 02:42:13,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:42:13,064 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 34 states. [2019-09-08 02:42:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:13,868 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-08 02:42:13,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 02:42:13,870 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-09-08 02:42:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:13,871 INFO L225 Difference]: With dead ends: 61 [2019-09-08 02:42:13,871 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 02:42:13,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:42:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 02:42:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-08 02:42:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 02:42:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-08 02:42:13,878 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2019-09-08 02:42:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:13,878 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-08 02:42:13,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 02:42:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-08 02:42:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 02:42:13,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:13,880 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:13,880 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:13,881 INFO L82 PathProgramCache]: Analyzing trace with hash 915707074, now seen corresponding path program 4 times [2019-09-08 02:42:13,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:13,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:13,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:13,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:14,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:14,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:14,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:42:15,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:42:15,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:15,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-08 02:42:15,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:15,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:15,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-08 02:42:15,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 02:42:15,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 02:42:15,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:42:15,105 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 44 states. [2019-09-08 02:42:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:16,445 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-09-08 02:42:16,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 02:42:16,445 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2019-09-08 02:42:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:16,447 INFO L225 Difference]: With dead ends: 72 [2019-09-08 02:42:16,447 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 02:42:16,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 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-09-08 02:42:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 02:42:16,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-08 02:42:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-08 02:42:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-09-08 02:42:16,464 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2019-09-08 02:42:16,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:16,464 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-09-08 02:42:16,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 02:42:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-09-08 02:42:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 02:42:16,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:16,470 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:16,470 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:16,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:16,471 INFO L82 PathProgramCache]: Analyzing trace with hash -161874385, now seen corresponding path program 5 times [2019-09-08 02:42:16,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:16,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:16,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:16,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:16,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:18,785 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2019-09-08 02:42:20,844 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 45 DAG size of output: 19 [2019-09-08 02:42:25,135 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 46 DAG size of output: 19 [2019-09-08 02:42:27,213 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:29,348 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:31,492 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:33,986 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:36,181 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:40,287 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:42,488 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:45,570 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:47,697 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:49,827 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:54,384 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:56,523 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:42:58,669 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:43:02,823 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:43:05,170 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:43:08,120 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-08 02:43:37,065 WARN L188 SmtUtils]: Spent 10.19 s on a formula simplification. DAG size of input: 120 DAG size of output: 27 [2019-09-08 02:43:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 114 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:47,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:43:47,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:43:47,681 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:43:48,916 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 02:43:48,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:43:48,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-08 02:43:48,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:43:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:49,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:50,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:43:50,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 68 [2019-09-08 02:43:50,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-08 02:43:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-08 02:43:50,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=4401, Unknown=9, NotChecked=0, Total=4556 [2019-09-08 02:43:50,020 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 68 states. [2019-09-08 02:43:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:43:52,896 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-09-08 02:43:52,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 02:43:52,896 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 65 [2019-09-08 02:43:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:43:52,898 INFO L225 Difference]: With dead ends: 80 [2019-09-08 02:43:52,898 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 02:43:52,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 91.9s TimeCoverageRelationStatistics Valid=152, Invalid=4531, Unknown=9, NotChecked=0, Total=4692 [2019-09-08 02:43:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 02:43:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 02:43:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 02:43:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 02:43:52,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2019-09-08 02:43:52,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:43:52,901 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 02:43:52,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-08 02:43:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 02:43:52,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 02:43:52,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 02:43:59,118 WARN L188 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 185 DAG size of output: 29 [2019-09-08 02:43:59,270 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-08 02:43:59,273 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-08 02:43:59,274 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:43:59,274 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:43:59,274 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 02:43:59,274 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:43:59,274 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:43:59,274 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 15 45) no Hoare annotation was computed. [2019-09-08 02:43:59,274 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 48) no Hoare annotation was computed. [2019-09-08 02:43:59,274 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 15 45) no Hoare annotation was computed. [2019-09-08 02:43:59,274 INFO L439 ceAbstractionStarter]: At program point L15-2(lines 15 45) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse0 (* 2 .cse3)) (.cse1 (* 4294967296 (div (+ (* (- 2) .cse3) main_~y~0) 4294967296)))) (or (and (<= (+ .cse0 main_~x~0 .cse1) (+ main_~y~0 100)) (<= main_~y~0 (+ .cse0 .cse1)) (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= (+ .cse0 .cse1 1) main_~y~0) (<= .cse2 0)))))) [2019-09-08 02:43:59,275 INFO L443 ceAbstractionStarter]: For program point L40-1(lines 15 45) no Hoare annotation was computed. [2019-09-08 02:43:59,275 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 15 45) no Hoare annotation was computed. [2019-09-08 02:43:59,275 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 17) no Hoare annotation was computed. [2019-09-08 02:43:59,275 INFO L443 ceAbstractionStarter]: For program point L16-2(lines 15 45) no Hoare annotation was computed. [2019-09-08 02:43:59,275 INFO L443 ceAbstractionStarter]: For program point L37-1(lines 15 45) no Hoare annotation was computed. [2019-09-08 02:43:59,275 INFO L443 ceAbstractionStarter]: For program point L25-1(lines 15 45) no Hoare annotation was computed. [2019-09-08 02:43:59,275 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 48) no Hoare annotation was computed. [2019-09-08 02:43:59,275 INFO L443 ceAbstractionStarter]: For program point L34-1(lines 15 45) no Hoare annotation was computed. [2019-09-08 02:43:59,276 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 48) the Hoare annotation is: true [2019-09-08 02:43:59,276 INFO L443 ceAbstractionStarter]: For program point L22-1(lines 15 45) no Hoare annotation was computed. [2019-09-08 02:43:59,276 INFO L439 ceAbstractionStarter]: At program point L43-1(lines 15 45) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ (* (- 2) .cse5) main_~y~0) 4294967296)))) (let ((.cse0 (<= main_~y~0 (+ .cse3 .cse4))) (.cse1 (+ .cse3 main_~x~0 .cse4))) (or (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0) (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse0 (<= main_~x~0 20)) (and (<= .cse1 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (and .cse0 (<= main_~x~0 60) (<= 60 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= (+ .cse3 .cse4 1) main_~y~0) (<= .cse2 0))) (and .cse0 (<= .cse1 (+ main_~y~0 40)) (<= 40 main_~x~0)))))) [2019-09-08 02:43:59,276 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2019-09-08 02:43:59,276 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2019-09-08 02:43:59,276 INFO L443 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-09-08 02:43:59,276 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-09-08 02:43:59,276 INFO L443 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-09-08 02:43:59,277 INFO L443 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2019-09-08 02:43:59,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:43:59 BoogieIcfgContainer [2019-09-08 02:43:59,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 02:43:59,293 INFO L168 Benchmark]: Toolchain (without parser) took 166075.96 ms. Allocated memory was 140.5 MB in the beginning and 298.8 MB in the end (delta: 158.3 MB). Free memory was 87.0 MB in the beginning and 259.9 MB in the end (delta: -172.9 MB). Peak memory consumption was 181.2 MB. Max. memory is 7.1 GB. [2019-09-08 02:43:59,294 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 140.5 MB. Free memory was 105.3 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 02:43:59,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.18 ms. Allocated memory is still 140.5 MB. Free memory was 86.8 MB in the beginning and 76.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-08 02:43:59,296 INFO L168 Benchmark]: Boogie Preprocessor took 130.81 ms. Allocated memory was 140.5 MB in the beginning and 200.3 MB in the end (delta: 59.8 MB). Free memory was 76.8 MB in the beginning and 177.4 MB in the end (delta: -100.6 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-09-08 02:43:59,297 INFO L168 Benchmark]: RCFGBuilder took 308.25 ms. Allocated memory is still 200.3 MB. Free memory was 177.4 MB in the beginning and 162.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-09-08 02:43:59,298 INFO L168 Benchmark]: TraceAbstraction took 165383.43 ms. Allocated memory was 200.3 MB in the beginning and 298.8 MB in the end (delta: 98.6 MB). Free memory was 161.8 MB in the beginning and 259.9 MB in the end (delta: -98.1 MB). Peak memory consumption was 196.3 MB. Max. memory is 7.1 GB. [2019-09-08 02:43:59,301 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 140.5 MB. Free memory was 105.3 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.18 ms. Allocated memory is still 140.5 MB. Free memory was 86.8 MB in the beginning and 76.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.81 ms. Allocated memory was 140.5 MB in the beginning and 200.3 MB in the end (delta: 59.8 MB). Free memory was 76.8 MB in the beginning and 177.4 MB in the end (delta: -100.6 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 308.25 ms. Allocated memory is still 200.3 MB. Free memory was 177.4 MB in the beginning and 162.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 165383.43 ms. Allocated memory was 200.3 MB in the beginning and 298.8 MB in the end (delta: 98.6 MB). Free memory was 161.8 MB in the beginning and 259.9 MB in the end (delta: -98.1 MB). Peak memory consumption was 196.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((((80 <= x && x <= 80) && y <= 2 * (y / 2) + 4294967296 * ((-2 * (y / 2) + y) / 4294967296)) || (x <= 0 && 0 <= x)) || ((20 <= x && y <= 2 * (y / 2) + 4294967296 * ((-2 * (y / 2) + y) / 4294967296)) && x <= 20)) || ((2 * (y / 2) + x + 4294967296 * ((-2 * (y / 2) + y) / 4294967296) <= y + 100 && y <= 2 * (y / 2) + 4294967296 * ((-2 * (y / 2) + y) / 4294967296)) && 100 <= x)) || ((y <= 2 * (y / 2) + 4294967296 * ((-2 * (y / 2) + y) / 4294967296) && x <= 60) && 60 <= x)) || ((0 <= x + 5 && 2 * (y / 2) + 4294967296 * ((-2 * (y / 2) + y) / 4294967296) + 1 <= y) && x + 5 <= 0)) || ((y <= 2 * (y / 2) + 4294967296 * ((-2 * (y / 2) + y) / 4294967296) && 2 * (y / 2) + x + 4294967296 * ((-2 * (y / 2) + y) / 4294967296) <= y + 40) && 40 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 165.3s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 24.5s AutomataDifference, 0.0s DeadEndRemovalTime, 6.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 182 SDtfs, 38 SDslu, 1008 SDs, 0 SdLazy, 7337 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 222 SyntacticMatches, 14 SemanticMatches, 203 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 149.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 8 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 289 HoareAnnotationTreeSize, 18 FomulaSimplifications, 19 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1896 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 132.2s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 518 ConstructedInterpolants, 0 QuantifiedInterpolants, 553568 SizeOfPredicates, 8 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 2/474 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...