java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 11:53:44,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 11:53:44,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 11:53:44,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 11:53:44,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 11:53:44,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 11:53:44,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 11:53:44,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 11:53:44,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 11:53:44,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 11:53:44,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 11:53:44,111 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 11:53:44,112 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 11:53:44,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 11:53:44,115 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 11:53:44,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 11:53:44,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 11:53:44,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 11:53:44,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 11:53:44,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 11:53:44,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 11:53:44,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 11:53:44,139 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 11:53:44,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 11:53:44,139 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 11:53:44,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 11:53:44,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 11:53:44,144 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 11:53:44,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 11:53:44,146 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 11:53:44,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 11:53:44,149 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 11:53:44,149 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 11:53:44,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 11:53:44,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 11:53:44,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 11:53:44,155 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 11:53:44,176 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 11:53:44,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 11:53:44,177 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 11:53:44,178 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 11:53:44,178 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 11:53:44,178 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 11:53:44,178 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 11:53:44,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 11:53:44,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 11:53:44,179 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 11:53:44,179 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 11:53:44,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 11:53:44,180 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 11:53:44,180 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 11:53:44,180 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 11:53:44,180 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 11:53:44,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 11:53:44,181 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 11:53:44,181 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 11:53:44,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 11:53:44,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 11:53:44,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 11:53:44,182 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 11:53:44,182 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 11:53:44,182 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 11:53:44,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 11:53:44,182 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 11:53:44,183 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 11:53:44,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 11:53:44,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 11:53:44,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 11:53:44,258 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 11:53:44,258 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 11:53:44,259 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-24 11:53:44,333 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/63d930eae/481e8454243a4f209c7181e67ccf9396/FLAG65c2b9b5e [2018-10-24 11:53:44,792 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 11:53:44,793 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-24 11:53:44,799 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/63d930eae/481e8454243a4f209c7181e67ccf9396/FLAG65c2b9b5e [2018-10-24 11:53:44,814 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/63d930eae/481e8454243a4f209c7181e67ccf9396 [2018-10-24 11:53:44,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 11:53:44,826 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 11:53:44,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 11:53:44,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 11:53:44,831 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 11:53:44,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:44" (1/1) ... [2018-10-24 11:53:44,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a967ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:44, skipping insertion in model container [2018-10-24 11:53:44,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:44" (1/1) ... [2018-10-24 11:53:44,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 11:53:44,867 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 11:53:45,046 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 11:53:45,050 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 11:53:45,074 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 11:53:45,090 INFO L193 MainTranslator]: Completed translation [2018-10-24 11:53:45,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45 WrapperNode [2018-10-24 11:53:45,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 11:53:45,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 11:53:45,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 11:53:45,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 11:53:45,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (1/1) ... [2018-10-24 11:53:45,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (1/1) ... [2018-10-24 11:53:45,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 11:53:45,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 11:53:45,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 11:53:45,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 11:53:45,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (1/1) ... [2018-10-24 11:53:45,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (1/1) ... [2018-10-24 11:53:45,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (1/1) ... [2018-10-24 11:53:45,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (1/1) ... [2018-10-24 11:53:45,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (1/1) ... [2018-10-24 11:53:45,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (1/1) ... [2018-10-24 11:53:45,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (1/1) ... [2018-10-24 11:53:45,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 11:53:45,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 11:53:45,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 11:53:45,186 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 11:53:45,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 11:53:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 11:53:45,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 11:53:45,816 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 11:53:45,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:45 BoogieIcfgContainer [2018-10-24 11:53:45,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 11:53:45,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 11:53:45,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 11:53:45,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 11:53:45,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:53:44" (1/3) ... [2018-10-24 11:53:45,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3b98cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:45, skipping insertion in model container [2018-10-24 11:53:45,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:45" (2/3) ... [2018-10-24 11:53:45,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3b98cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:45, skipping insertion in model container [2018-10-24 11:53:45,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:45" (3/3) ... [2018-10-24 11:53:45,830 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-10-24 11:53:45,840 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 11:53:45,848 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 11:53:45,865 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 11:53:45,896 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 11:53:45,897 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 11:53:45,897 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 11:53:45,897 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 11:53:45,897 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 11:53:45,898 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 11:53:45,898 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 11:53:45,898 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 11:53:45,898 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 11:53:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-24 11:53:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-24 11:53:45,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:53:45,920 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-24 11:53:45,923 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:53:45,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:53:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash 891630823, now seen corresponding path program 1 times [2018-10-24 11:53:45,931 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:53:45,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:53:45,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:53:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:53:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:53:46,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:53:46,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 11:53:46,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 11:53:46,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 11:53:46,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 11:53:46,059 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-10-24 11:53:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:53:46,074 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-10-24 11:53:46,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 11:53:46,075 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2018-10-24 11:53:46,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:53:46,085 INFO L225 Difference]: With dead ends: 30 [2018-10-24 11:53:46,086 INFO L226 Difference]: Without dead ends: 18 [2018-10-24 11:53:46,089 INFO L605 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 [2018-10-24 11:53:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-24 11:53:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-24 11:53:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-24 11:53:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-10-24 11:53:46,126 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 6 [2018-10-24 11:53:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:53:46,126 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-10-24 11:53:46,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 11:53:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2018-10-24 11:53:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-24 11:53:46,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:53:46,127 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:53:46,128 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:53:46,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:53:46,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1805983239, now seen corresponding path program 1 times [2018-10-24 11:53:46,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:53:46,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:53:46,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:46,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:53:46,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:53:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:53:46,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:53:46,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 11:53:46,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 11:53:46,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 11:53:46,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 11:53:46,236 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 3 states. [2018-10-24 11:53:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:53:46,428 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2018-10-24 11:53:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 11:53:46,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-24 11:53:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:53:46,432 INFO L225 Difference]: With dead ends: 25 [2018-10-24 11:53:46,432 INFO L226 Difference]: Without dead ends: 21 [2018-10-24 11:53:46,433 INFO L605 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 [2018-10-24 11:53:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-24 11:53:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-10-24 11:53:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-24 11:53:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-10-24 11:53:46,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 7 [2018-10-24 11:53:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:53:46,440 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-10-24 11:53:46,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 11:53:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2018-10-24 11:53:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 11:53:46,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:53:46,441 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:53:46,441 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:53:46,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:53:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1155156665, now seen corresponding path program 1 times [2018-10-24 11:53:46,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:53:46,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:53:46,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:46,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:53:46,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:53:48,545 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse1 (= c_ULTIMATE.start_main_~y~0 .cse3))) (and (or (<= .cse0 c_ULTIMATE.start_main_~y~0) .cse1 (not (= (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse2 (- 2)) 4294967296)) .cse3 2) c_ULTIMATE.start_main_~y~0))) (or (not (= (+ .cse3 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse2) 4294967296))) c_ULTIMATE.start_main_~y~0)) (and (< c_ULTIMATE.start_main_~y~0 .cse0) (not .cse1))))))) is different from false [2018-10-24 11:53:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:53:48,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:53:48,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 11:53:48,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 11:53:48,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 11:53:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-24 11:53:48,563 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 3 states. [2018-10-24 11:53:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:53:48,567 INFO L93 Difference]: Finished difference Result 40 states and 64 transitions. [2018-10-24 11:53:48,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 11:53:48,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-24 11:53:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:53:48,570 INFO L225 Difference]: With dead ends: 40 [2018-10-24 11:53:48,570 INFO L226 Difference]: Without dead ends: 24 [2018-10-24 11:53:48,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-24 11:53:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-24 11:53:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-24 11:53:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-24 11:53:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-10-24 11:53:48,578 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 19 [2018-10-24 11:53:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:53:48,579 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-10-24 11:53:48,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 11:53:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-24 11:53:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 11:53:48,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:53:48,581 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:53:48,581 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:53:48,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:53:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash -454092087, now seen corresponding path program 1 times [2018-10-24 11:53:48,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:53:48,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:53:48,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:48,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:53:48,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:53:50,676 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse1 (= c_ULTIMATE.start_main_~y~0 .cse3))) (and (or (<= .cse0 c_ULTIMATE.start_main_~y~0) .cse1 (not (= (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse2 (- 2)) 4294967296)) .cse3 2) c_ULTIMATE.start_main_~y~0))) (or (not (= (+ .cse3 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse2) 4294967296))) c_ULTIMATE.start_main_~y~0)) (and (< c_ULTIMATE.start_main_~y~0 .cse0) (not .cse1))))))) is different from false [2018-10-24 11:53:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:53:50,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:53:50,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 11:53:50,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 11:53:50,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 11:53:50,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-24 11:53:50,684 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 3 states. [2018-10-24 11:53:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:53:50,688 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. [2018-10-24 11:53:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 11:53:50,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-24 11:53:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:53:50,689 INFO L225 Difference]: With dead ends: 45 [2018-10-24 11:53:50,689 INFO L226 Difference]: Without dead ends: 25 [2018-10-24 11:53:50,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-24 11:53:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-24 11:53:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-24 11:53:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-24 11:53:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2018-10-24 11:53:50,694 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 19 [2018-10-24 11:53:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:53:50,694 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-10-24 11:53:50,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 11:53:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2018-10-24 11:53:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 11:53:50,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:53:50,696 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:53:50,696 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:53:50,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:53:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash -847119097, now seen corresponding path program 1 times [2018-10-24 11:53:50,696 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:53:50,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:53:50,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:50,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:53:50,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:53:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:53:50,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:53:50,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 11:53:50,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 11:53:50,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 11:53:50,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 11:53:50,782 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 3 states. [2018-10-24 11:53:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:53:51,066 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2018-10-24 11:53:51,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 11:53:51,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-24 11:53:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:53:51,067 INFO L225 Difference]: With dead ends: 60 [2018-10-24 11:53:51,067 INFO L226 Difference]: Without dead ends: 36 [2018-10-24 11:53:51,068 INFO L605 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 [2018-10-24 11:53:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-24 11:53:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-10-24 11:53:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-24 11:53:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-10-24 11:53:51,074 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 19 [2018-10-24 11:53:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:53:51,074 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-10-24 11:53:51,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 11:53:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-10-24 11:53:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 11:53:51,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:53:51,075 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:53:51,076 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:53:51,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:53:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash 353686019, now seen corresponding path program 1 times [2018-10-24 11:53:51,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:53:51,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:53:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:51,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:53:51,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:53:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:53:51,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:53:51,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 11:53:51,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 11:53:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 11:53:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 11:53:51,179 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 3 states. [2018-10-24 11:53:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:53:51,450 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-10-24 11:53:51,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 11:53:51,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-24 11:53:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:53:51,454 INFO L225 Difference]: With dead ends: 53 [2018-10-24 11:53:51,454 INFO L226 Difference]: Without dead ends: 37 [2018-10-24 11:53:51,455 INFO L605 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 [2018-10-24 11:53:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-24 11:53:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-10-24 11:53:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-24 11:53:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-10-24 11:53:51,461 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2018-10-24 11:53:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:53:51,462 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-10-24 11:53:51,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 11:53:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-10-24 11:53:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 11:53:51,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:53:51,463 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:53:51,463 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:53:51,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:53:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2036060419, now seen corresponding path program 1 times [2018-10-24 11:53:51,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:53:51,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:53:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:53:51,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:53:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:54:00,001 WARN L179 SmtUtils]: Spent 6.23 s on a formula simplification. DAG size of input: 55 DAG size of output: 19 [2018-10-24 11:54:06,130 WARN L179 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 17 [2018-10-24 11:54:08,156 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse12 c_ULTIMATE.start_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse7 (= .cse3 c_ULTIMATE.start_main_~y~0))) (let ((.cse10 (+ c_ULTIMATE.start_main_~x~0 3)) (.cse0 (not .cse7)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse12)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_ULTIMATE.start_main_~y~0 .cse11) 4294967296)) (.cse5 (or .cse6 .cse7))) (and (let ((.cse2 (* 4294967296 .cse9)) (.cse4 (* 4294967296 .cse8))) (or (and .cse0 .cse1 (<= (+ .cse2 .cse3 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse3 .cse4 1) c_ULTIMATE.start_main_~y~0) .cse5) (and (or .cse6 (< (+ .cse2 .cse3 2) c_ULTIMATE.start_main_~y~0) .cse7) (or (and .cse0 .cse1) (< (+ .cse3 .cse4) c_ULTIMATE.start_main_~y~0))))) (<= 0 .cse10) (<= .cse10 0) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 3)) .cse0 .cse1) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 1)) .cse5)) (or (and .cse0 .cse1 (<= 0 .cse9)) (and (<= 0 .cse8) .cse5))))))) is different from false [2018-10-24 11:54:10,186 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse11 c_ULTIMATE.start_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse7 (= .cse3 c_ULTIMATE.start_main_~y~0))) (let ((.cse0 (not .cse7)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse11)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_ULTIMATE.start_main_~y~0 .cse10) 4294967296)) (.cse5 (or .cse6 .cse7))) (and (<= c_ULTIMATE.start_main_~x~0 3) (let ((.cse2 (* 4294967296 .cse9)) (.cse4 (* 4294967296 .cse8))) (or (and .cse0 .cse1 (<= (+ .cse2 .cse3 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse3 .cse4 1) c_ULTIMATE.start_main_~y~0) .cse5) (and (or .cse6 (< (+ .cse2 .cse3 2) c_ULTIMATE.start_main_~y~0) .cse7) (or (and .cse0 .cse1) (< (+ .cse3 .cse4) c_ULTIMATE.start_main_~y~0))))) (<= 3 c_ULTIMATE.start_main_~x~0) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 3)) .cse0 .cse1) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 1)) .cse5)) (or (and .cse0 .cse1 (<= 0 .cse9)) (and (<= 0 .cse8) .cse5))))))) is different from false [2018-10-24 11:54:20,363 WARN L179 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 56 DAG size of output: 19 [2018-10-24 11:54:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:54:22,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:54:22,630 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:54:22,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:54:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:54:22,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:54:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:54:23,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:54:23,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2018-10-24 11:54:23,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 11:54:23,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 11:54:23,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=5, NotChecked=38, Total=156 [2018-10-24 11:54:23,381 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 13 states. [2018-10-24 11:54:25,544 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_ULTIMATE.start_main_~y~0 .cse12) 4294967296)) (.cse3 (* 2 .cse14)) (.cse13 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse13 c_ULTIMATE.start_main_~y~0)) (.cse7 (= .cse3 c_ULTIMATE.start_main_~y~0)) (.cse4 (* 4294967296 .cse11))) (let ((.cse8 (< (+ .cse3 .cse4) c_ULTIMATE.start_main_~y~0)) (.cse10 (+ c_ULTIMATE.start_main_~x~0 3)) (.cse0 (not .cse7)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse13)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse12 (- 2)) 4294967296)) (.cse5 (or .cse6 .cse7))) (and (let ((.cse2 (* 4294967296 .cse9))) (or (and .cse0 .cse1 (<= (+ .cse2 .cse3 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse3 .cse4 1) c_ULTIMATE.start_main_~y~0) .cse5) (and (or .cse6 (< (+ .cse2 .cse3 2) c_ULTIMATE.start_main_~y~0) .cse7) (or (and .cse0 .cse1) .cse8)))) .cse8 (<= 0 .cse10) (<= .cse10 0) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 3)) .cse0 .cse1) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 1)) .cse5)) (or (and .cse0 .cse1 (<= 0 .cse9)) (and (<= 0 .cse11) .cse5)))))))) is different from false [2018-10-24 11:54:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:54:27,856 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-10-24 11:54:27,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 11:54:27,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-10-24 11:54:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:54:27,859 INFO L225 Difference]: With dead ends: 50 [2018-10-24 11:54:27,859 INFO L226 Difference]: Without dead ends: 21 [2018-10-24 11:54:27,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=31, Invalid=107, Unknown=6, NotChecked=66, Total=210 [2018-10-24 11:54:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-24 11:54:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-10-24 11:54:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-24 11:54:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-24 11:54:27,863 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2018-10-24 11:54:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:54:27,864 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-24 11:54:27,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 11:54:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-24 11:54:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 11:54:27,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:54:27,865 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:54:27,865 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:54:27,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:54:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1650300349, now seen corresponding path program 1 times [2018-10-24 11:54:27,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:54:27,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:54:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:54:27,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:54:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:54:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:54:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:54:28,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:54:28,258 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 11:54:28,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:54:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:54:28,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:54:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:54:28,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:54:28,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-24 11:54:28,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 11:54:28,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 11:54:28,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-24 11:54:28,365 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2018-10-24 11:54:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:54:28,702 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-24 11:54:28,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 11:54:28,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-10-24 11:54:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:54:28,706 INFO L225 Difference]: With dead ends: 37 [2018-10-24 11:54:28,706 INFO L226 Difference]: Without dead ends: 33 [2018-10-24 11:54:28,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-24 11:54:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-24 11:54:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-10-24 11:54:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-24 11:54:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-24 11:54:28,714 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 19 [2018-10-24 11:54:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:54:28,716 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-24 11:54:28,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 11:54:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-24 11:54:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 11:54:28,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:54:28,717 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-24 11:54:28,717 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:54:28,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:54:28,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2000470913, now seen corresponding path program 2 times [2018-10-24 11:54:28,719 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:54:28,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:54:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:54:28,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:54:28,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:54:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:54:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:54:29,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:54:29,513 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 11:54:29,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:54:29,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:54:29,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:54:29,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:54:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:54:29,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:54:29,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-24 11:54:29,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 11:54:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 11:54:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-24 11:54:29,690 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 23 states. [2018-10-24 11:54:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:54:30,247 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-24 11:54:30,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-24 11:54:30,256 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-10-24 11:54:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:54:30,257 INFO L225 Difference]: With dead ends: 49 [2018-10-24 11:54:30,257 INFO L226 Difference]: Without dead ends: 45 [2018-10-24 11:54:30,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-24 11:54:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-24 11:54:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-24 11:54:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-24 11:54:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-24 11:54:30,269 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 31 [2018-10-24 11:54:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:54:30,269 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-24 11:54:30,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 11:54:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-24 11:54:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-24 11:54:30,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:54:30,271 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-24 11:54:30,271 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:54:30,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:54:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash 636392635, now seen corresponding path program 3 times [2018-10-24 11:54:30,275 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:54:30,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:54:30,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:54:30,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:54:30,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:54:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:54:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:54:31,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:54:31,611 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:54:31,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:54:31,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 11:54:31,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:54:31,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:54:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:54:31,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:54:31,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-24 11:54:31,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 11:54:31,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 11:54:31,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 11:54:31,756 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 33 states. [2018-10-24 11:54:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:54:32,993 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-24 11:54:32,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-24 11:54:32,994 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2018-10-24 11:54:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:54:33,009 INFO L225 Difference]: With dead ends: 61 [2018-10-24 11:54:33,009 INFO L226 Difference]: Without dead ends: 57 [2018-10-24 11:54:33,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 11:54:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-24 11:54:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-24 11:54:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-24 11:54:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-24 11:54:33,023 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 43 [2018-10-24 11:54:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:54:33,024 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-24 11:54:33,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 11:54:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-24 11:54:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-24 11:54:33,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:54:33,026 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-10-24 11:54:33,026 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:54:33,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:54:33,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1267430135, now seen corresponding path program 4 times [2018-10-24 11:54:33,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:54:33,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:54:33,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:54:33,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:54:33,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:54:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:54:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:54:34,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:54:34,554 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 11:54:34,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:54:34,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:54:34,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:54:34,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:54:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:54:34,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:54:34,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-24 11:54:34,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-24 11:54:34,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-24 11:54:34,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-24 11:54:34,647 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 43 states. [2018-10-24 11:54:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:54:36,550 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-24 11:54:36,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-24 11:54:36,551 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 55 [2018-10-24 11:54:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:54:36,553 INFO L225 Difference]: With dead ends: 73 [2018-10-24 11:54:36,553 INFO L226 Difference]: Without dead ends: 69 [2018-10-24 11:54:36,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-24 11:54:36,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-24 11:54:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-10-24 11:54:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-24 11:54:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-24 11:54:36,561 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 55 [2018-10-24 11:54:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:54:36,561 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-24 11:54:36,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-24 11:54:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-24 11:54:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-24 11:54:36,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:54:36,563 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-10-24 11:54:36,563 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:54:36,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:54:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1837160243, now seen corresponding path program 5 times [2018-10-24 11:54:36,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:54:36,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:54:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:54:36,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:54:36,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:54:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:54:38,926 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-10-24 11:54:44,999 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:54:47,062 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:54:49,195 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:54:51,399 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:54:53,538 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:54:55,639 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:54:57,716 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:54:59,804 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:01,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse1 (* 2 .cse9))) (let ((.cse8 (* (- 2) .cse9)) (.cse6 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse7 (= .cse1 c_ULTIMATE.start_main_~y~0))) (let ((.cse2 (not .cse7)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse6)) (.cse0 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse8 (- 2)) 4294967296))) (.cse4 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse8) 4294967296))) (.cse5 (or (<= .cse6 c_ULTIMATE.start_main_~y~0) .cse7))) (and (or (and (<= (+ .cse0 .cse1 c_ULTIMATE.start_main_~x~0) (+ c_ULTIMATE.start_main_~y~0 24)) .cse2 .cse3) (and (<= (+ .cse1 c_ULTIMATE.start_main_~x~0 .cse4) (+ c_ULTIMATE.start_main_~y~0 26)) .cse5)) (<= 26 c_ULTIMATE.start_main_~x~0) (or (and .cse2 .cse3 (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 2))) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse1 .cse4)) .cse5))))))) is different from true [2018-10-24 11:55:03,932 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:08,119 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:14,424 WARN L179 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:16,550 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:18,663 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:20,860 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:23,025 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:25,134 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:29,256 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:31,524 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:33,923 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:38,252 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:40,385 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:42,996 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:45,191 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:47,532 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:50,220 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse1 (* 2 .cse9))) (let ((.cse8 (* (- 2) .cse9)) (.cse6 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse7 (= .cse1 c_ULTIMATE.start_main_~y~0))) (let ((.cse2 (not .cse7)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse6)) (.cse0 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse8 (- 2)) 4294967296))) (.cse4 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse8) 4294967296))) (.cse5 (or (<= .cse6 c_ULTIMATE.start_main_~y~0) .cse7))) (and (or (and (<= (+ .cse0 .cse1 c_ULTIMATE.start_main_~x~0) (+ c_ULTIMATE.start_main_~y~0 82)) .cse2 .cse3) (and (<= (+ .cse1 c_ULTIMATE.start_main_~x~0 .cse4) (+ c_ULTIMATE.start_main_~y~0 84)) .cse5)) (<= 84 c_ULTIMATE.start_main_~x~0) (or (and .cse2 .cse3 (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 2))) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse1 .cse4)) .cse5))))))) is different from true [2018-10-24 11:55:52,374 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:54,573 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:56,927 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:55:59,135 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:56:01,695 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-24 11:56:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-10-24 11:56:01,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:56:01,938 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 11:56:01,948 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:56:02,247 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-24 11:56:02,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:56:02,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:56:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:56:03,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:56:03,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 66 [2018-10-24 11:56:03,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-24 11:56:03,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-24 11:56:03,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=3898, Unknown=3, NotChecked=250, Total=4290 [2018-10-24 11:56:03,689 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 66 states. [2018-10-24 11:56:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:56:06,845 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-10-24 11:56:06,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-24 11:56:06,845 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 67 [2018-10-24 11:56:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:56:06,846 INFO L225 Difference]: With dead ends: 82 [2018-10-24 11:56:06,846 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 11:56:06,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 86.4s TimeCoverageRelationStatistics Valid=143, Invalid=4022, Unknown=3, NotChecked=254, Total=4422 [2018-10-24 11:56:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 11:56:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 11:56:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 11:56:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 11:56:06,849 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-10-24 11:56:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:56:06,849 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 11:56:06,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-24 11:56:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 11:56:06,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 11:56:06,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 11:56:07,070 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-10-24 11:56:07,074 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-24 11:56:07,075 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse6 (div ULTIMATE.start_main_~y~0 2))) (let ((.cse4 (* 2 .cse6)) (.cse5 (* 4294967296 (div (+ ULTIMATE.start_main_~y~0 (* (- 2) .cse6)) 4294967296)))) (let ((.cse3 (+ .cse4 .cse5))) (let ((.cse0 (+ .cse4 ULTIMATE.start_main_~x~0 .cse5)) (.cse1 (= .cse3 ULTIMATE.start_main_~y~0))) (or (and (<= .cse0 (+ ULTIMATE.start_main_~y~0 80)) (<= 80 ULTIMATE.start_main_~x~0) .cse1) (and (<= .cse0 (+ ULTIMATE.start_main_~y~0 100)) (<= 100 ULTIMATE.start_main_~x~0) .cse1) (and (<= ULTIMATE.start_main_~x~0 0) (<= 0 ULTIMATE.start_main_~x~0)) (and (<= .cse0 (+ ULTIMATE.start_main_~y~0 20)) (<= 20 ULTIMATE.start_main_~x~0) .cse1) (and (<= 60 ULTIMATE.start_main_~x~0) (<= .cse0 (+ ULTIMATE.start_main_~y~0 60)) .cse1) (let ((.cse2 (+ ULTIMATE.start_main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (< .cse3 ULTIMATE.start_main_~y~0))) (and (<= 40 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 40) .cse1)))))) [2018-10-24 11:56:07,075 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,075 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,075 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,075 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,076 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 11:56:07,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 11:56:07,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 11:56:07,076 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,076 INFO L425 ceAbstractionStarter]: For program point L12-3(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,076 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-24 11:56:07,076 INFO L428 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2018-10-24 11:56:07,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 11:56:07,077 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,077 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,077 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,077 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,077 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-10-24 11:56:07,077 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-10-24 11:56:07,077 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 35) no Hoare annotation was computed. [2018-10-24 11:56:07,077 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-24 11:56:07,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:56:07 BoogieIcfgContainer [2018-10-24 11:56:07,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 11:56:07,096 INFO L168 Benchmark]: Toolchain (without parser) took 142271.53 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:56:07,097 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:56:07,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 11:56:07,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:56:07,099 INFO L168 Benchmark]: Boogie Preprocessor took 38.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:56:07,100 INFO L168 Benchmark]: RCFGBuilder took 631.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.3 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2018-10-24 11:56:07,101 INFO L168 Benchmark]: TraceAbstraction took 141277.80 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 294.6 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -271.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2018-10-24 11:56:07,105 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 264.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 631.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.3 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141277.80 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 294.6 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -271.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 80 && 80 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 100 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || (x <= 0 && 0 <= x)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 20 && 20 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((60 <= x && 2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 60) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) < y)) || ((40 <= x && x <= 40) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 141.1s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 215 SDtfs, 33 SDslu, 1147 SDs, 0 SdLazy, 7181 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 231 SyntacticMatches, 20 SemanticMatches, 187 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 129.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, 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, 12 MinimizatonAttempts, 14 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 245 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 146 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 127.0s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 539 ConstructedInterpolants, 0 QuantifiedInterpolants, 450337 SizeOfPredicates, 12 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 8/552 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...