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/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8c3fbe1 [2018-10-22 16:04:55,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 16:04:55,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 16:04:55,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 16:04:55,295 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 16:04:55,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 16:04:55,300 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 16:04:55,303 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 16:04:55,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 16:04:55,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 16:04:55,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 16:04:55,312 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 16:04:55,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 16:04:55,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 16:04:55,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 16:04:55,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 16:04:55,321 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 16:04:55,327 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 16:04:55,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 16:04:55,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 16:04:55,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 16:04:55,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 16:04:55,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 16:04:55,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 16:04:55,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 16:04:55,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 16:04:55,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 16:04:55,354 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 16:04:55,355 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 16:04:55,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 16:04:55,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 16:04:55,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 16:04:55,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 16:04:55,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 16:04:55,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 16:04:55,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 16:04:55,366 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-22 16:04:55,392 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 16:04:55,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 16:04:55,393 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 16:04:55,393 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 16:04:55,394 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 16:04:55,394 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 16:04:55,394 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 16:04:55,395 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 16:04:55,395 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-22 16:04:55,395 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 16:04:55,395 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 16:04:55,395 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 16:04:55,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 16:04:55,397 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 16:04:55,397 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 16:04:55,397 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 16:04:55,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 16:04:55,397 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 16:04:55,398 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 16:04:55,398 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 16:04:55,398 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 16:04:55,398 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 16:04:55,398 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 16:04:55,400 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 16:04:55,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 16:04:55,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 16:04:55,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 16:04:55,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 16:04:55,401 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 16:04:55,401 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 16:04:55,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 16:04:55,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 16:04:55,402 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-22 16:04:55,402 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-22 16:04:55,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 16:04:55,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 16:04:55,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 16:04:55,492 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 16:04:55,492 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 16:04:55,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-10-22 16:04:55,563 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c4490d127/cd338e714a8b40e99662ea351ca65d73/FLAG0e32879f1 [2018-10-22 16:04:56,062 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 16:04:56,063 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-10-22 16:04:56,069 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c4490d127/cd338e714a8b40e99662ea351ca65d73/FLAG0e32879f1 [2018-10-22 16:04:56,082 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c4490d127/cd338e714a8b40e99662ea351ca65d73 [2018-10-22 16:04:56,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 16:04:56,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-22 16:04:56,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 16:04:56,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 16:04:56,100 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 16:04:56,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d25b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56, skipping insertion in model container [2018-10-22 16:04:56,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 16:04:56,141 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 16:04:56,315 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 16:04:56,319 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 16:04:56,337 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 16:04:56,353 INFO L193 MainTranslator]: Completed translation [2018-10-22 16:04:56,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56 WrapperNode [2018-10-22 16:04:56,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 16:04:56,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 16:04:56,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 16:04:56,355 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 16:04:56,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 16:04:56,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 16:04:56,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 16:04:56,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 16:04:56,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (1/1) ... [2018-10-22 16:04:56,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 16:04:56,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 16:04:56,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 16:04:56,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 16:04:56,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (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-22 16:04:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 16:04:56,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 16:04:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 16:04:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 16:04:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 16:04:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 16:04:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 16:04:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 16:04:56,804 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 16:04:56,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 04:04:56 BoogieIcfgContainer [2018-10-22 16:04:56,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 16:04:56,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 16:04:56,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 16:04:56,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 16:04:56,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 04:04:56" (1/3) ... [2018-10-22 16:04:56,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e78dade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 04:04:56, skipping insertion in model container [2018-10-22 16:04:56,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:04:56" (2/3) ... [2018-10-22 16:04:56,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e78dade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 04:04:56, skipping insertion in model container [2018-10-22 16:04:56,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 04:04:56" (3/3) ... [2018-10-22 16:04:56,812 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call1.i [2018-10-22 16:04:56,820 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 16:04:56,828 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 16:04:56,846 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 16:04:56,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 16:04:56,886 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 16:04:56,886 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 16:04:56,886 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 16:04:56,887 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 16:04:56,887 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 16:04:56,887 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 16:04:56,887 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 16:04:56,887 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 16:04:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-22 16:04:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-22 16:04:56,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:04:56,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:04:56,917 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:04:56,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:04:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash -283544510, now seen corresponding path program 1 times [2018-10-22 16:04:56,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:04:56,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:04:56,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:04:56,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:04:56,979 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:04:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:04:57,035 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-22 16:04:57,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 16:04:57,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 16:04:57,037 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:04:57,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 16:04:57,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 16:04:57,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 16:04:57,060 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-10-22 16:04:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:04:57,085 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-10-22 16:04:57,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 16:04:57,086 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-10-22 16:04:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:04:57,096 INFO L225 Difference]: With dead ends: 37 [2018-10-22 16:04:57,096 INFO L226 Difference]: Without dead ends: 15 [2018-10-22 16:04:57,100 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-22 16:04:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-22 16:04:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-22 16:04:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-22 16:04:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-10-22 16:04:57,140 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-10-22 16:04:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:04:57,141 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-10-22 16:04:57,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 16:04:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-22 16:04:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-22 16:04:57,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:04:57,142 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:04:57,143 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:04:57,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:04:57,143 INFO L82 PathProgramCache]: Analyzing trace with hash -863512858, now seen corresponding path program 1 times [2018-10-22 16:04:57,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:04:57,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:04:57,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:04:57,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:04:57,145 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:04:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:04:57,253 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-22 16:04:57,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 16:04:57,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 16:04:57,254 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:04:57,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 16:04:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 16:04:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 16:04:57,256 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-10-22 16:04:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:04:57,363 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-10-22 16:04:57,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 16:04:57,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-22 16:04:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:04:57,365 INFO L225 Difference]: With dead ends: 25 [2018-10-22 16:04:57,365 INFO L226 Difference]: Without dead ends: 20 [2018-10-22 16:04:57,366 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-22 16:04:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-22 16:04:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-10-22 16:04:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-22 16:04:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-10-22 16:04:57,372 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-10-22 16:04:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:04:57,373 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-10-22 16:04:57,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 16:04:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-22 16:04:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-22 16:04:57,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:04:57,374 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:04:57,376 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:04:57,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:04:57,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1427803270, now seen corresponding path program 1 times [2018-10-22 16:04:57,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:04:57,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:04:57,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:04:57,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:04:57,380 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:04:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:04:57,470 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-22 16:04:57,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 16:04:57,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 16:04:57,471 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:04:57,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 16:04:57,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 16:04:57,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 16:04:57,472 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2018-10-22 16:04:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:04:57,514 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-10-22 16:04:57,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 16:04:57,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-22 16:04:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:04:57,517 INFO L225 Difference]: With dead ends: 29 [2018-10-22 16:04:57,517 INFO L226 Difference]: Without dead ends: 19 [2018-10-22 16:04:57,518 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-22 16:04:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-22 16:04:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-22 16:04:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-22 16:04:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-10-22 16:04:57,523 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-10-22 16:04:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:04:57,524 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-22 16:04:57,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 16:04:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-22 16:04:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-22 16:04:57,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:04:57,525 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:04:57,525 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:04:57,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:04:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179828, now seen corresponding path program 1 times [2018-10-22 16:04:57,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:04:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:04:57,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:04:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:04:57,527 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:04:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:04:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:04:57,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:04:57,670 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:04:57,671 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-10-22 16:04:57,673 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [22], [24], [28], [34], [37], [39], [45], [46], [47], [49] [2018-10-22 16:04:57,722 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:04:57,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:04:57,841 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-22 16:04:58,852 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 16:04:58,854 INFO L272 AbstractInterpreter]: Visited 16 different actions 315 times. Merged at 7 different actions 171 times. Widened at 3 different actions 50 times. Found 33 fixpoints after 4 different actions. Largest state had 4 variables. [2018-10-22 16:04:58,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:04:58,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 16:04:58,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:04:58,903 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-22 16:04:58,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:04:58,920 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 16:04:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:04:58,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 16:04:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:04:59,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 16:04:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-22 16:04:59,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:04:59,782 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 16:04:59,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:04:59,815 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 16:04:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:04:59,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 16:05:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-22 16:05:00,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 16:05:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-22 16:05:00,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 16:05:00,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4, 6, 6] total 15 [2018-10-22 16:05:00,475 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 16:05:00,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-22 16:05:00,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-22 16:05:00,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-10-22 16:05:00,477 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 7 states. [2018-10-22 16:05:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:05:00,661 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-10-22 16:05:00,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 16:05:00,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-22 16:05:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:05:00,664 INFO L225 Difference]: With dead ends: 49 [2018-10-22 16:05:00,664 INFO L226 Difference]: Without dead ends: 37 [2018-10-22 16:05:00,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-10-22 16:05:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-22 16:05:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-10-22 16:05:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-22 16:05:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-10-22 16:05:00,673 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2018-10-22 16:05:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:05:00,673 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-10-22 16:05:00,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-22 16:05:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-10-22 16:05:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-22 16:05:00,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:05:00,675 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:05:00,675 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:05:00,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:05:00,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1070919706, now seen corresponding path program 2 times [2018-10-22 16:05:00,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:05:00,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:05:00,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:05:00,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:05:00,677 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:05:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:05:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-22 16:05:00,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:05:00,825 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:05:00,825 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 16:05:00,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 16:05:00,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:05:00,826 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-22 16:05:00,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 16:05:00,842 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 16:05:00,865 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 16:05:00,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 16:05:00,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 16:05:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-22 16:05:01,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 16:05:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-22 16:05:01,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:05:01,374 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 16:05:01,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 16:05:01,390 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 16:05:01,420 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 16:05:01,420 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 16:05:01,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 16:05:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-22 16:05:01,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 16:05:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-22 16:05:01,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 16:05:01,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 11 [2018-10-22 16:05:01,454 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 16:05:01,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-22 16:05:01,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-22 16:05:01,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-22 16:05:01,456 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2018-10-22 16:05:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:05:01,801 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-10-22 16:05:01,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-22 16:05:01,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-10-22 16:05:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:05:01,805 INFO L225 Difference]: With dead ends: 71 [2018-10-22 16:05:01,805 INFO L226 Difference]: Without dead ends: 54 [2018-10-22 16:05:01,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-10-22 16:05:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-22 16:05:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-10-22 16:05:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-22 16:05:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-10-22 16:05:01,817 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 29 [2018-10-22 16:05:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:05:01,817 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-10-22 16:05:01,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-22 16:05:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-10-22 16:05:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-22 16:05:01,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:05:01,819 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:05:01,819 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:05:01,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:05:01,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1068904040, now seen corresponding path program 3 times [2018-10-22 16:05:01,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:05:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:05:01,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 16:05:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:05:01,822 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:05:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:05:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-22 16:05:01,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:05:01,962 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:05:01,963 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 16:05:01,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 16:05:01,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:05:01,963 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-22 16:05:01,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 16:05:01,980 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-22 16:05:02,024 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-22 16:05:02,024 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 16:05:02,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 16:05:04,248 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 Int)) (let ((.cse0 (mod v_prenex_4 2)) (.cse1 (mod v_prenex_4 4294967296))) (and (= .cse0 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (< 2147483647 .cse0) (<= 0 .cse1) (<= 268435455 .cse1) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 2))) (let ((.cse3 (mod v_prenex_1 4294967296)) (.cse4 (mod (+ .cse2 4294967294) 4294967296))) (and (not (= 0 .cse2)) (<= 268435455 .cse3) (< 2147483647 .cse4) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (< .cse3 0) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse4))))) (exists ((v_prenex_2 Int)) (let ((.cse5 (mod v_prenex_2 4294967296)) (.cse6 (mod v_prenex_2 2))) (and (<= 0 .cse5) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= .cse6 2147483647) (<= 268435455 .cse5) (= |c___VERIFIER_assert_#in~cond| .cse6)))) (exists ((v_main_~x~0_BEFORE_CALL_2 Int)) (let ((.cse7 (mod v_main_~x~0_BEFORE_CALL_2 2))) (and (= |c___VERIFIER_assert_#in~cond| .cse7) (<= .cse7 2147483647) (= 0 .cse7) (< (mod (+ v_main_~x~0_BEFORE_CALL_2 4294967295) 4294967296) 268435455) (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_2 4294967296))))) (exists ((v_prenex_3 Int)) (let ((.cse8 (mod v_prenex_3 2))) (and (= 0 .cse8) (<= 268435455 (mod v_prenex_3 4294967296)) (< 2147483647 .cse8) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (= .cse8 (+ |c___VERIFIER_assert_#in~cond| 4294967296))))) (exists ((v_prenex_5 Int)) (let ((.cse11 (mod v_prenex_5 2))) (let ((.cse9 (mod (+ .cse11 4294967294) 4294967296)) (.cse10 (mod v_prenex_5 4294967296))) (and (<= .cse9 2147483647) (<= 268435455 .cse10) (= |c___VERIFIER_assert_#in~cond| .cse9) (< .cse10 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= 0 .cse11))))))) is different from false [2018-10-22 16:05:06,259 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 Int)) (let ((.cse0 (mod v_prenex_4 2)) (.cse1 (mod v_prenex_4 4294967296))) (and (= .cse0 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (< 2147483647 .cse0) (<= 0 .cse1) (<= 268435455 .cse1) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 2))) (let ((.cse3 (mod v_prenex_1 4294967296)) (.cse4 (mod (+ .cse2 4294967294) 4294967296))) (and (not (= 0 .cse2)) (<= 268435455 .cse3) (< 2147483647 .cse4) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (< .cse3 0) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse4))))) (exists ((v_prenex_2 Int)) (let ((.cse5 (mod v_prenex_2 4294967296)) (.cse6 (mod v_prenex_2 2))) (and (<= 0 .cse5) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= .cse6 2147483647) (<= 268435455 .cse5) (= |c___VERIFIER_assert_#in~cond| .cse6)))) (exists ((v_main_~x~0_BEFORE_CALL_2 Int)) (let ((.cse7 (mod v_main_~x~0_BEFORE_CALL_2 2))) (and (= |c___VERIFIER_assert_#in~cond| .cse7) (<= .cse7 2147483647) (= 0 .cse7) (< (mod (+ v_main_~x~0_BEFORE_CALL_2 4294967295) 4294967296) 268435455) (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_2 4294967296))))) (exists ((v_prenex_3 Int)) (let ((.cse8 (mod v_prenex_3 2))) (and (= 0 .cse8) (<= 268435455 (mod v_prenex_3 4294967296)) (< 2147483647 .cse8) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (= .cse8 (+ |c___VERIFIER_assert_#in~cond| 4294967296))))) (exists ((v_prenex_5 Int)) (let ((.cse11 (mod v_prenex_5 2))) (let ((.cse9 (mod (+ .cse11 4294967294) 4294967296)) (.cse10 (mod v_prenex_5 4294967296))) (and (<= .cse9 2147483647) (<= 268435455 .cse10) (= |c___VERIFIER_assert_#in~cond| .cse9) (< .cse10 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= 0 .cse11))))))) is different from true [2018-10-22 16:05:08,300 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_2 Int)) (let ((.cse0 (mod v_prenex_2 2)) (.cse1 (mod v_prenex_2 4294967296))) (and (= .cse0 c___VERIFIER_assert_~cond) (<= 0 .cse1) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= .cse0 2147483647) (<= 268435455 .cse1)))) (exists ((v_prenex_3 Int)) (let ((.cse2 (mod v_prenex_3 2))) (and (= (+ c___VERIFIER_assert_~cond 4294967296) .cse2) (= 0 .cse2) (<= 268435455 (mod v_prenex_3 4294967296)) (< 2147483647 .cse2) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 2))) (let ((.cse4 (mod v_prenex_1 4294967296)) (.cse5 (mod (+ .cse3 4294967294) 4294967296))) (and (not (= 0 .cse3)) (<= 268435455 .cse4) (< 2147483647 .cse5) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (< .cse4 0) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse5))))) (exists ((v_main_~x~0_BEFORE_CALL_2 Int)) (let ((.cse6 (mod v_main_~x~0_BEFORE_CALL_2 2))) (and (<= .cse6 2147483647) (= .cse6 c___VERIFIER_assert_~cond) (= 0 .cse6) (< (mod (+ v_main_~x~0_BEFORE_CALL_2 4294967295) 4294967296) 268435455) (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_2 4294967296))))) (exists ((v_prenex_4 Int)) (let ((.cse7 (mod v_prenex_4 2)) (.cse8 (mod v_prenex_4 4294967296))) (and (= (+ c___VERIFIER_assert_~cond 4294967296) .cse7) (< 2147483647 .cse7) (<= 0 .cse8) (<= 268435455 .cse8) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_5 Int)) (let ((.cse11 (mod v_prenex_5 2))) (let ((.cse9 (mod (+ .cse11 4294967294) 4294967296)) (.cse10 (mod v_prenex_5 4294967296))) (and (<= .cse9 2147483647) (= .cse9 c___VERIFIER_assert_~cond) (<= 268435455 .cse10) (< .cse10 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= 0 .cse11))))))) is different from true [2018-10-22 16:05:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-22 16:05:08,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 16:05:14,756 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 13 [2018-10-22 16:05:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-22 16:05:16,812 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:05:16,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [6] total 16 [2018-10-22 16:05:16,812 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:05:16,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-22 16:05:16,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-22 16:05:16,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=150, Unknown=5, NotChecked=50, Total=240 [2018-10-22 16:05:16,813 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-10-22 16:05:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:05:16,895 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-22 16:05:16,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-22 16:05:16,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-10-22 16:05:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:05:16,896 INFO L225 Difference]: With dead ends: 45 [2018-10-22 16:05:16,896 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 16:05:16,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=41, Invalid=172, Unknown=5, NotChecked=54, Total=272 [2018-10-22 16:05:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 16:05:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 16:05:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 16:05:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 16:05:16,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-10-22 16:05:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:05:16,899 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 16:05:16,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-22 16:05:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 16:05:16,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 16:05:16,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 16:05:17,069 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-22 16:05:17,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 16:05:17,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 16:05:17,070 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 16:05:17,070 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 16:05:17,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 16:05:17,070 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 19) no Hoare annotation was computed. [2018-10-22 16:05:17,070 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 19) no Hoare annotation was computed. [2018-10-22 16:05:17,071 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2018-10-22 16:05:17,071 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 17) no Hoare annotation was computed. [2018-10-22 16:05:17,071 INFO L421 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (= main_~x~0 0) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455))) [2018-10-22 16:05:17,071 INFO L425 ceAbstractionStarter]: For program point L13-4(lines 13 15) no Hoare annotation was computed. [2018-10-22 16:05:17,071 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 17) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (and (<= 0 main_~y~0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) [2018-10-22 16:05:17,071 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 17) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~x~0 4294967296))) [2018-10-22 16:05:17,071 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 19) the Hoare annotation is: true [2018-10-22 16:05:17,071 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-10-22 16:05:17,072 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-10-22 16:05:17,072 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-10-22 16:05:17,072 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-10-22 16:05:17,072 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-10-22 16:05:17,072 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-10-22 16:05:17,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 04:05:17 BoogieIcfgContainer [2018-10-22 16:05:17,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 16:05:17,088 INFO L168 Benchmark]: Toolchain (without parser) took 20993.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -466.1 MB). Peak memory consumption was 295.7 MB. Max. memory is 7.1 GB. [2018-10-22 16:05:17,090 INFO L168 Benchmark]: CDTParser took 0.20 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-22 16:05:17,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.78 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-22 16:05:17,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.10 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-22 16:05:17,092 INFO L168 Benchmark]: Boogie Preprocessor took 29.67 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-22 16:05:17,092 INFO L168 Benchmark]: RCFGBuilder took 396.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-10-22 16:05:17,093 INFO L168 Benchmark]: TraceAbstraction took 20281.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 337.1 MB). Peak memory consumption was 337.1 MB. Max. memory is 7.1 GB. [2018-10-22 16:05:17,098 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.20 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 258.78 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 23.10 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 29.67 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 396.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20281.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 337.1 MB). Peak memory consumption was 337.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 11]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 268435455 || (((0 <= y && x <= 0) && 0 <= x) && y <= 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x == 0 || ((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 20.1s OverallTime, 6 OverallIterations, 12 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 108 SDtfs, 28 SDslu, 199 SDs, 0 SdLazy, 156 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 30 NumberOfFragments, 56 HoareAnnotationTreeSize, 13 FomulaSimplifications, 353 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 462 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 266 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 388 ConstructedInterpolants, 2 QuantifiedInterpolants, 54416 SizeOfPredicates, 9 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 518/648 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...