java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/ddlm2013_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:21,230 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:21,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:21,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:21,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:21,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:21,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:21,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:21,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:21,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:21,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:21,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:21,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:21,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:21,260 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:21,260 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:21,261 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:21,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:21,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:21,270 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:21,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:21,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:21,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:21,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:21,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:21,282 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:21,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:21,289 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:21,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:21,291 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:21,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:21,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:21,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:21,295 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:21,296 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:21,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:21,298 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:12:21,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:21,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:21,330 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:21,330 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:21,331 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:21,331 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:21,331 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:21,331 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:21,331 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:21,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:21,333 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:21,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:21,333 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:21,333 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:21,333 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:21,334 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:21,334 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:21,334 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:21,334 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:21,334 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:21,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:21,335 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:21,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:21,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:21,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:21,336 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:21,336 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:21,336 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:21,336 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:21,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:21,336 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:21,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:21,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:21,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:21,418 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:21,423 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:21,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/ddlm2013_true-unreach-call.i [2018-11-23 13:12:21,479 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c3e1427/3736e82e345143f48a801bbd90b251d4/FLAG2277ead51 [2018-11-23 13:12:21,928 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:21,929 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013_true-unreach-call.i [2018-11-23 13:12:21,944 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c3e1427/3736e82e345143f48a801bbd90b251d4/FLAG2277ead51 [2018-11-23 13:12:22,296 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c3e1427/3736e82e345143f48a801bbd90b251d4 [2018-11-23 13:12:22,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:22,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:22,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:22,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:22,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:22,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33adb195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22, skipping insertion in model container [2018-11-23 13:12:22,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:22,360 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:22,600 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:22,605 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:22,627 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:22,644 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:22,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22 WrapperNode [2018-11-23 13:12:22,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:22,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:22,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:22,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:22,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:22,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:22,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:22,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:22,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (1/1) ... [2018-11-23 13:12:22,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:22,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:22,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:22,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:22,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:22,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:22,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:22,867 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:22,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:23,371 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:23,371 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:23,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:23 BoogieIcfgContainer [2018-11-23 13:12:23,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:23,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:23,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:23,377 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:23,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:22" (1/3) ... [2018-11-23 13:12:23,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6042d962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:23, skipping insertion in model container [2018-11-23 13:12:23,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:22" (2/3) ... [2018-11-23 13:12:23,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6042d962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:23, skipping insertion in model container [2018-11-23 13:12:23,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:23" (3/3) ... [2018-11-23 13:12:23,381 INFO L112 eAbstractionObserver]: Analyzing ICFG ddlm2013_true-unreach-call.i [2018-11-23 13:12:23,391 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:23,400 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:23,418 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:23,451 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:23,452 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:23,452 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:23,452 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:23,452 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:23,452 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:23,453 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:23,453 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:23,453 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 13:12:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:12:23,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:23,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:23,483 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:23,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:23,489 INFO L82 PathProgramCache]: Analyzing trace with hash -382823925, now seen corresponding path program 1 times [2018-11-23 13:12:23,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:23,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:23,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:23,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:23,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 13:12:23,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 13:12:23,653 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #50#return; {25#true} is VALID [2018-11-23 13:12:23,653 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2018-11-23 13:12:23,654 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {25#true} is VALID [2018-11-23 13:12:23,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} assume 0 != ~flag~0;~i~0 := 0; {25#true} is VALID [2018-11-23 13:12:23,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-23 13:12:23,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} assume 0 != ~flag~0; {26#false} is VALID [2018-11-23 13:12:23,669 INFO L256 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {26#false} is VALID [2018-11-23 13:12:23,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-23 13:12:23,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2018-11-23 13:12:23,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 13:12:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:23,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:23,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:23,682 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:12:23,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:23,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:12:23,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:23,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:12:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:23,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:23,794 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 13:12:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:23,914 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 13:12:23,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:23,915 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:12:23,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2018-11-23 13:12:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2018-11-23 13:12:23,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2018-11-23 13:12:24,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:24,290 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:12:24,291 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:12:24,294 INFO L631 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-11-23 13:12:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:12:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:12:24,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:24,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:24,329 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:24,329 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,333 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 13:12:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:12:24,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,334 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:24,334 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,339 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 13:12:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:12:24,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:24,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:12:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 13:12:24,344 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-11-23 13:12:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:24,344 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 13:12:24,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:12:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:12:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:12:24,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:24,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:24,346 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:24,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1944032635, now seen corresponding path program 1 times [2018-11-23 13:12:24,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:24,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:24,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:24,739 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 5 [2018-11-23 13:12:24,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {123#true} call ULTIMATE.init(); {123#true} is VALID [2018-11-23 13:12:24,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {123#true} assume true; {123#true} is VALID [2018-11-23 13:12:24,892 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} #50#return; {123#true} is VALID [2018-11-23 13:12:24,892 INFO L256 TraceCheckUtils]: 3: Hoare triple {123#true} call #t~ret5 := main(); {123#true} is VALID [2018-11-23 13:12:24,902 INFO L273 TraceCheckUtils]: 4: Hoare triple {123#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {125#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:24,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {125#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume 0 != ~flag~0;~i~0 := 0; {125#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:24,926 INFO L273 TraceCheckUtils]: 6: Hoare triple {125#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {125#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:24,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {125#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {125#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:24,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {125#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume 0 != ~flag~0; {125#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:24,937 INFO L256 TraceCheckUtils]: 9: Hoare triple {125#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {126#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:24,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {126#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {127#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:24,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {127#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {124#false} is VALID [2018-11-23 13:12:24,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {124#false} assume !false; {124#false} is VALID [2018-11-23 13:12:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:24,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:24,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:12:24,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:12:24,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:24,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:12:24,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:24,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:12:24,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:12:24,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:12:24,997 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2018-11-23 13:12:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:25,255 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 13:12:25,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:12:25,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:12:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-23 13:12:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-23 13:12:25,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2018-11-23 13:12:25,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:25,566 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:12:25,566 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:12:25,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:12:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:12:25,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:25,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 13:12:25,600 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:12:25,601 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:12:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:25,604 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 13:12:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 13:12:25,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:25,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:25,604 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:12:25,605 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:12:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:25,608 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 13:12:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 13:12:25,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:25,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:25,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:25,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:12:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 13:12:25,611 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2018-11-23 13:12:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:25,612 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 13:12:25,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:12:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 13:12:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:12:25,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:25,614 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:25,615 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:25,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1646139566, now seen corresponding path program 1 times [2018-11-23 13:12:25,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:25,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:25,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:25,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:25,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:26,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-23 13:12:26,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-23 13:12:26,357 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #50#return; {220#true} is VALID [2018-11-23 13:12:26,358 INFO L256 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret5 := main(); {220#true} is VALID [2018-11-23 13:12:26,359 INFO L273 TraceCheckUtils]: 4: Hoare triple {220#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {222#(and (<= 1 (+ main_~j~0 main_~b~0)) (<= (+ main_~j~0 main_~b~0) (+ main_~a~0 1)) (<= (+ main_~j~0 main_~b~0) 1) (<= (+ main_~a~0 1) (+ main_~j~0 main_~b~0)))} is VALID [2018-11-23 13:12:26,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#(and (<= 1 (+ main_~j~0 main_~b~0)) (<= (+ main_~j~0 main_~b~0) (+ main_~a~0 1)) (<= (+ main_~j~0 main_~b~0) 1) (<= (+ main_~a~0 1) (+ main_~j~0 main_~b~0)))} assume 0 != ~flag~0;~i~0 := 0; {223#(and (<= (+ main_~j~0 main_~b~0) (+ main_~a~0 1)) (<= (+ main_~a~0 1) (+ main_~j~0 main_~b~0)) (= main_~i~0 0))} is VALID [2018-11-23 13:12:26,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {223#(and (<= (+ main_~j~0 main_~b~0) (+ main_~a~0 1)) (<= (+ main_~a~0 1) (+ main_~j~0 main_~b~0)) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {223#(and (<= (+ main_~j~0 main_~b~0) (+ main_~a~0 1)) (<= (+ main_~a~0 1) (+ main_~j~0 main_~b~0)) (= main_~i~0 0))} is VALID [2018-11-23 13:12:26,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {223#(and (<= (+ main_~j~0 main_~b~0) (+ main_~a~0 1)) (<= (+ main_~a~0 1) (+ main_~j~0 main_~b~0)) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {224#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:26,364 INFO L273 TraceCheckUtils]: 8: Hoare triple {224#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {224#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:26,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {224#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {224#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:26,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {224#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {224#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:26,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {224#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume 0 != ~flag~0; {224#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:26,369 INFO L256 TraceCheckUtils]: 12: Hoare triple {224#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:26,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {225#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {226#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:12:26,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {226#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {221#false} is VALID [2018-11-23 13:12:26,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-23 13:12:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:26,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:26,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:26,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:26,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:26,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-23 13:12:26,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-23 13:12:26,679 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #50#return; {220#true} is VALID [2018-11-23 13:12:26,679 INFO L256 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret5 := main(); {220#true} is VALID [2018-11-23 13:12:26,681 INFO L273 TraceCheckUtils]: 4: Hoare triple {220#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {242#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1))} is VALID [2018-11-23 13:12:26,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {242#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1))} assume 0 != ~flag~0;~i~0 := 0; {246#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:12:26,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {246#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {246#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:12:26,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {246#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {253#(and (= main_~b~0 1) (= main_~a~0 1))} is VALID [2018-11-23 13:12:26,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {253#(and (= main_~b~0 1) (= main_~a~0 1))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {253#(and (= main_~b~0 1) (= main_~a~0 1))} is VALID [2018-11-23 13:12:26,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {253#(and (= main_~b~0 1) (= main_~a~0 1))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {253#(and (= main_~b~0 1) (= main_~a~0 1))} is VALID [2018-11-23 13:12:26,691 INFO L273 TraceCheckUtils]: 10: Hoare triple {253#(and (= main_~b~0 1) (= main_~a~0 1))} assume !(0 != #t~nondet2);havoc #t~nondet2; {253#(and (= main_~b~0 1) (= main_~a~0 1))} is VALID [2018-11-23 13:12:26,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {253#(and (= main_~b~0 1) (= main_~a~0 1))} assume 0 != ~flag~0; {253#(and (= main_~b~0 1) (= main_~a~0 1))} is VALID [2018-11-23 13:12:26,699 INFO L256 TraceCheckUtils]: 12: Hoare triple {253#(and (= main_~b~0 1) (= main_~a~0 1))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {269#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:26,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {269#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {273#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:12:26,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {273#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {221#false} is VALID [2018-11-23 13:12:26,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-23 13:12:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:26,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:26,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 13:12:26,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-11-23 13:12:26,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:26,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:12:26,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:26,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:12:26,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:12:26,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:12:26,835 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 12 states. [2018-11-23 13:12:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:27,161 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 13:12:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:27,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-11-23 13:12:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-23 13:12:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-23 13:12:27,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2018-11-23 13:12:27,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:27,213 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:12:27,213 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:12:27,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:12:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:12:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 13:12:27,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:27,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2018-11-23 13:12:27,229 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2018-11-23 13:12:27,229 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2018-11-23 13:12:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:27,232 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 13:12:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 13:12:27,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:27,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:27,233 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2018-11-23 13:12:27,233 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2018-11-23 13:12:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:27,235 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 13:12:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 13:12:27,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:27,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:27,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:27,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:12:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 13:12:27,239 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2018-11-23 13:12:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:27,239 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 13:12:27,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:12:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 13:12:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:12:27,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:27,240 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:27,241 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:27,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash -945074988, now seen corresponding path program 1 times [2018-11-23 13:12:27,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:27,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:27,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:27,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:27,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:27,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {387#true} call ULTIMATE.init(); {387#true} is VALID [2018-11-23 13:12:27,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {387#true} assume true; {387#true} is VALID [2018-11-23 13:12:27,405 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {387#true} {387#true} #50#return; {387#true} is VALID [2018-11-23 13:12:27,405 INFO L256 TraceCheckUtils]: 3: Hoare triple {387#true} call #t~ret5 := main(); {387#true} is VALID [2018-11-23 13:12:27,405 INFO L273 TraceCheckUtils]: 4: Hoare triple {387#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {387#true} is VALID [2018-11-23 13:12:27,411 INFO L273 TraceCheckUtils]: 5: Hoare triple {387#true} assume !(0 != ~flag~0);~i~0 := 1; {389#(= 0 main_~flag~0)} is VALID [2018-11-23 13:12:27,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {389#(= 0 main_~flag~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {389#(= 0 main_~flag~0)} is VALID [2018-11-23 13:12:27,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {389#(= 0 main_~flag~0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {389#(= 0 main_~flag~0)} is VALID [2018-11-23 13:12:27,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {389#(= 0 main_~flag~0)} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {389#(= 0 main_~flag~0)} is VALID [2018-11-23 13:12:27,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#(= 0 main_~flag~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {389#(= 0 main_~flag~0)} is VALID [2018-11-23 13:12:27,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {389#(= 0 main_~flag~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {389#(= 0 main_~flag~0)} is VALID [2018-11-23 13:12:27,416 INFO L273 TraceCheckUtils]: 11: Hoare triple {389#(= 0 main_~flag~0)} assume 0 != ~flag~0; {388#false} is VALID [2018-11-23 13:12:27,416 INFO L256 TraceCheckUtils]: 12: Hoare triple {388#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {388#false} is VALID [2018-11-23 13:12:27,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {388#false} ~cond := #in~cond; {388#false} is VALID [2018-11-23 13:12:27,417 INFO L273 TraceCheckUtils]: 14: Hoare triple {388#false} assume 0 == ~cond; {388#false} is VALID [2018-11-23 13:12:27,417 INFO L273 TraceCheckUtils]: 15: Hoare triple {388#false} assume !false; {388#false} is VALID [2018-11-23 13:12:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:12:27,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:27,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:12:27,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 13:12:27,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:27,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:12:27,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:27,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:12:27,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:12:27,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:27,439 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 3 states. [2018-11-23 13:12:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:27,489 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:12:27,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:12:27,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 13:12:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-23 13:12:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-23 13:12:27,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2018-11-23 13:12:27,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:27,548 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:12:27,549 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:12:27,550 INFO L631 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-11-23 13:12:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:12:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:12:27,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:27,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:27,557 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:27,557 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:27,559 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 13:12:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 13:12:27,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:27,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:27,560 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:27,560 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:27,563 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 13:12:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 13:12:27,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:27,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:27,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:27,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:12:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 13:12:27,566 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2018-11-23 13:12:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:27,566 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 13:12:27,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:12:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 13:12:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:12:27,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:27,568 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:27,568 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:27,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1104392731, now seen corresponding path program 2 times [2018-11-23 13:12:27,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:27,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:27,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:27,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:27,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:28,398 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-11-23 13:12:28,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {497#true} is VALID [2018-11-23 13:12:28,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {497#true} assume true; {497#true} is VALID [2018-11-23 13:12:28,798 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {497#true} {497#true} #50#return; {497#true} is VALID [2018-11-23 13:12:28,799 INFO L256 TraceCheckUtils]: 3: Hoare triple {497#true} call #t~ret5 := main(); {497#true} is VALID [2018-11-23 13:12:28,806 INFO L273 TraceCheckUtils]: 4: Hoare triple {497#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {499#(and (<= (+ (* 2 main_~j~0) main_~b~0) (+ main_~a~0 2)) (<= (+ main_~a~0 2) (+ (* 2 main_~j~0) main_~b~0)))} is VALID [2018-11-23 13:12:28,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {499#(and (<= (+ (* 2 main_~j~0) main_~b~0) (+ main_~a~0 2)) (<= (+ main_~a~0 2) (+ (* 2 main_~j~0) main_~b~0)))} assume 0 != ~flag~0;~i~0 := 0; {500#(and (<= (+ (* 2 main_~j~0) main_~b~0) (+ main_~a~0 2)) (<= (+ main_~a~0 2) (+ (* 2 main_~j~0) main_~b~0)) (= main_~i~0 0))} is VALID [2018-11-23 13:12:28,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {500#(and (<= (+ (* 2 main_~j~0) main_~b~0) (+ main_~a~0 2)) (<= (+ main_~a~0 2) (+ (* 2 main_~j~0) main_~b~0)) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {500#(and (<= (+ (* 2 main_~j~0) main_~b~0) (+ main_~a~0 2)) (<= (+ main_~a~0 2) (+ (* 2 main_~j~0) main_~b~0)) (= main_~i~0 0))} is VALID [2018-11-23 13:12:28,810 INFO L273 TraceCheckUtils]: 7: Hoare triple {500#(and (<= (+ (* 2 main_~j~0) main_~b~0) (+ main_~a~0 2)) (<= (+ main_~a~0 2) (+ (* 2 main_~j~0) main_~b~0)) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {501#(and (<= (+ main_~j~0 main_~b~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~i~0 main_~a~0) (+ main_~j~0 main_~b~0 1)))} is VALID [2018-11-23 13:12:28,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {501#(and (<= (+ main_~j~0 main_~b~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~i~0 main_~a~0) (+ main_~j~0 main_~b~0 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {502#(and (<= (+ main_~j~0 main_~b~0) (+ main_~i~0 main_~a~0 1)) (<= (+ main_~i~0 main_~a~0 1) (+ main_~j~0 main_~b~0)))} is VALID [2018-11-23 13:12:28,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {502#(and (<= (+ main_~j~0 main_~b~0) (+ main_~i~0 main_~a~0 1)) (<= (+ main_~i~0 main_~a~0 1) (+ main_~j~0 main_~b~0)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {502#(and (<= (+ main_~j~0 main_~b~0) (+ main_~i~0 main_~a~0 1)) (<= (+ main_~i~0 main_~a~0 1) (+ main_~j~0 main_~b~0)))} is VALID [2018-11-23 13:12:28,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {502#(and (<= (+ main_~j~0 main_~b~0) (+ main_~i~0 main_~a~0 1)) (<= (+ main_~i~0 main_~a~0 1) (+ main_~j~0 main_~b~0)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {503#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:28,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {503#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {503#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:28,817 INFO L273 TraceCheckUtils]: 12: Hoare triple {503#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {503#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:28,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {503#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:28,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {503#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} assume 0 != ~flag~0; {503#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} is VALID [2018-11-23 13:12:28,824 INFO L256 TraceCheckUtils]: 15: Hoare triple {503#(and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {504#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:28,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {504#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {505#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:12:28,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {505#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {498#false} is VALID [2018-11-23 13:12:28,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {498#false} assume !false; {498#false} is VALID [2018-11-23 13:12:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:28,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:28,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:28,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:28,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:28,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:28,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:29,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {497#true} is VALID [2018-11-23 13:12:29,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {497#true} assume true; {497#true} is VALID [2018-11-23 13:12:29,380 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {497#true} {497#true} #50#return; {497#true} is VALID [2018-11-23 13:12:29,380 INFO L256 TraceCheckUtils]: 3: Hoare triple {497#true} call #t~ret5 := main(); {497#true} is VALID [2018-11-23 13:12:29,382 INFO L273 TraceCheckUtils]: 4: Hoare triple {497#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {521#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1))} is VALID [2018-11-23 13:12:29,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {521#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1))} assume 0 != ~flag~0;~i~0 := 0; {525#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:12:29,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {525#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {525#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:12:29,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {525#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~j~0 1) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {532#(and (= main_~i~0 2) (= main_~a~0 1) (= main_~j~0 1) (= main_~b~0 main_~j~0))} is VALID [2018-11-23 13:12:29,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {532#(and (= main_~i~0 2) (= main_~a~0 1) (= main_~j~0 1) (= main_~b~0 main_~j~0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {536#(and (= main_~i~0 2) (= main_~b~0 1) (= main_~a~0 1) (= (+ main_~b~0 2) main_~j~0))} is VALID [2018-11-23 13:12:29,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {536#(and (= main_~i~0 2) (= main_~b~0 1) (= main_~a~0 1) (= (+ main_~b~0 2) main_~j~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {536#(and (= main_~i~0 2) (= main_~b~0 1) (= main_~a~0 1) (= (+ main_~b~0 2) main_~j~0))} is VALID [2018-11-23 13:12:29,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {536#(and (= main_~i~0 2) (= main_~b~0 1) (= main_~a~0 1) (= (+ main_~b~0 2) main_~j~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {543#(and (= main_~a~0 2) (= main_~b~0 2))} is VALID [2018-11-23 13:12:29,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {543#(and (= main_~a~0 2) (= main_~b~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {543#(and (= main_~a~0 2) (= main_~b~0 2))} is VALID [2018-11-23 13:12:29,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {543#(and (= main_~a~0 2) (= main_~b~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {543#(and (= main_~a~0 2) (= main_~b~0 2))} is VALID [2018-11-23 13:12:29,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {543#(and (= main_~a~0 2) (= main_~b~0 2))} assume !(0 != #t~nondet2);havoc #t~nondet2; {543#(and (= main_~a~0 2) (= main_~b~0 2))} is VALID [2018-11-23 13:12:29,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {543#(and (= main_~a~0 2) (= main_~b~0 2))} assume 0 != ~flag~0; {543#(and (= main_~a~0 2) (= main_~b~0 2))} is VALID [2018-11-23 13:12:29,396 INFO L256 TraceCheckUtils]: 15: Hoare triple {543#(and (= main_~a~0 2) (= main_~b~0 2))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {559#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:29,397 INFO L273 TraceCheckUtils]: 16: Hoare triple {559#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {563#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:12:29,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {563#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {498#false} is VALID [2018-11-23 13:12:29,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {498#false} assume !false; {498#false} is VALID [2018-11-23 13:12:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:29,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:29,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 13:12:29,422 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-23 13:12:29,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:29,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:12:29,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:29,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:12:29,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:12:29,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:12:29,515 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 16 states. [2018-11-23 13:12:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:30,131 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-23 13:12:30,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:12:30,131 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-23 13:12:30,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:12:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2018-11-23 13:12:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:12:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2018-11-23 13:12:30,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2018-11-23 13:12:30,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:30,256 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:12:30,257 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:12:30,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:12:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:12:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2018-11-23 13:12:30,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:30,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 23 states. [2018-11-23 13:12:30,289 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 23 states. [2018-11-23 13:12:30,290 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 23 states. [2018-11-23 13:12:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:30,291 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 13:12:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 13:12:30,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:30,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:30,292 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 30 states. [2018-11-23 13:12:30,293 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 30 states. [2018-11-23 13:12:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:30,295 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 13:12:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 13:12:30,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:30,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:30,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:30,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:12:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 13:12:30,298 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2018-11-23 13:12:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:30,298 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:12:30,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:12:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:12:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:12:30,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:30,300 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:30,300 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:30,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash -767923148, now seen corresponding path program 1 times [2018-11-23 13:12:30,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:30,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:30,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:30,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:30,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:32,651 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 43 DAG size of output: 15 [2018-11-23 13:12:32,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2018-11-23 13:12:32,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-23 13:12:32,759 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #50#return; {732#true} is VALID [2018-11-23 13:12:32,760 INFO L256 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret5 := main(); {732#true} is VALID [2018-11-23 13:12:32,760 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {732#true} is VALID [2018-11-23 13:12:32,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {732#true} assume 0 != ~flag~0;~i~0 := 0; {734#(= main_~i~0 0)} is VALID [2018-11-23 13:12:32,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {734#(= main_~i~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {734#(= main_~i~0 0)} is VALID [2018-11-23 13:12:32,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {734#(= main_~i~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:12:32,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:12:32,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:12:32,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {736#(and (<= 4 main_~i~0) (<= main_~i~0 (+ (* 2 (div main_~i~0 2)) (* 4294967296 (div (+ main_~i~0 (* (- 2) (div main_~i~0 2))) 4294967296)))))} is VALID [2018-11-23 13:12:32,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {736#(and (<= 4 main_~i~0) (<= main_~i~0 (+ (* 2 (div main_~i~0 2)) (* 4294967296 (div (+ main_~i~0 (* (- 2) (div main_~i~0 2))) 4294967296)))))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {733#false} is VALID [2018-11-23 13:12:32,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {733#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {733#false} is VALID [2018-11-23 13:12:32,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {733#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {733#false} is VALID [2018-11-23 13:12:32,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {733#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {733#false} is VALID [2018-11-23 13:12:32,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {733#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {733#false} is VALID [2018-11-23 13:12:32,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {733#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {733#false} is VALID [2018-11-23 13:12:32,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {733#false} assume 0 != ~flag~0; {733#false} is VALID [2018-11-23 13:12:32,782 INFO L256 TraceCheckUtils]: 18: Hoare triple {733#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {733#false} is VALID [2018-11-23 13:12:32,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {733#false} ~cond := #in~cond; {733#false} is VALID [2018-11-23 13:12:32,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {733#false} assume 0 == ~cond; {733#false} is VALID [2018-11-23 13:12:32,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {733#false} assume !false; {733#false} is VALID [2018-11-23 13:12:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:12:32,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:32,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:32,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:32,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:32,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2018-11-23 13:12:32,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-23 13:12:32,910 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #50#return; {732#true} is VALID [2018-11-23 13:12:32,911 INFO L256 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret5 := main(); {732#true} is VALID [2018-11-23 13:12:32,911 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {732#true} is VALID [2018-11-23 13:12:32,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {732#true} assume 0 != ~flag~0;~i~0 := 0; {734#(= main_~i~0 0)} is VALID [2018-11-23 13:12:32,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {734#(= main_~i~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {734#(= main_~i~0 0)} is VALID [2018-11-23 13:12:32,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {734#(= main_~i~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:12:32,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:12:32,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:12:32,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {735#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {770#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:12:32,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {770#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {733#false} is VALID [2018-11-23 13:12:32,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {733#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {733#false} is VALID [2018-11-23 13:12:32,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {733#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {733#false} is VALID [2018-11-23 13:12:32,919 INFO L273 TraceCheckUtils]: 14: Hoare triple {733#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {733#false} is VALID [2018-11-23 13:12:32,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {733#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {733#false} is VALID [2018-11-23 13:12:32,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {733#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {733#false} is VALID [2018-11-23 13:12:32,920 INFO L273 TraceCheckUtils]: 17: Hoare triple {733#false} assume 0 != ~flag~0; {733#false} is VALID [2018-11-23 13:12:32,920 INFO L256 TraceCheckUtils]: 18: Hoare triple {733#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {733#false} is VALID [2018-11-23 13:12:32,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {733#false} ~cond := #in~cond; {733#false} is VALID [2018-11-23 13:12:32,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {733#false} assume 0 == ~cond; {733#false} is VALID [2018-11-23 13:12:32,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {733#false} assume !false; {733#false} is VALID [2018-11-23 13:12:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:12:32,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:32,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:12:32,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 13:12:32,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:32,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:32,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:32,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:32,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:32,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:32,985 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-11-23 13:12:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:33,200 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 13:12:33,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:12:33,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 13:12:33,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 13:12:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 13:12:33,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 13:12:33,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:33,243 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:12:33,244 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:33,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:33,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:33,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:33,245 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:33,246 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:33,246 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:33,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:33,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:33,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:33,247 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:33,247 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:33,247 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:33,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:33,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:33,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:33,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:33,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-11-23 13:12:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:33,248 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:33,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:33,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:33,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:33,344 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:33,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:33,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:33,345 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:33,345 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:33,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:33,345 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2018-11-23 13:12:33,346 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-11-23 13:12:33,346 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 35) no Hoare annotation was computed. [2018-11-23 13:12:33,346 INFO L448 ceAbstractionStarter]: For program point L25-2(lines 10 35) no Hoare annotation was computed. [2018-11-23 13:12:33,346 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 30) no Hoare annotation was computed. [2018-11-23 13:12:33,346 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 10 35) no Hoare annotation was computed. [2018-11-23 13:12:33,346 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 35) no Hoare annotation was computed. [2018-11-23 13:12:33,347 INFO L444 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0)) [2018-11-23 13:12:33,347 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 35) the Hoare annotation is: true [2018-11-23 13:12:33,347 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-11-23 13:12:33,347 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:33,347 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:33,347 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:33,348 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:33,348 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:33,348 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:33,350 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:33,350 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:12:33,351 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:33,351 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:33,351 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:33,351 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:12:33,351 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:12:33,351 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:33,351 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:33,352 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:33,352 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2018-11-23 13:12:33,352 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2018-11-23 13:12:33,352 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:33,352 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:33,352 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:33,352 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 13:12:33,353 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 13:12:33,353 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:12:33,353 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:12:33,353 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:33,353 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-23 13:12:33,353 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-23 13:12:33,353 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:12:33,354 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:12:33,354 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:33,354 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:33,354 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:33,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:33 BoogieIcfgContainer [2018-11-23 13:12:33,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:33,357 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:33,357 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:33,357 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:33,358 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:23" (3/4) ... [2018-11-23 13:12:33,362 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:33,370 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:33,370 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:33,371 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:33,375 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 13:12:33,376 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 13:12:33,376 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:33,376 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:33,431 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/ddlm2013_true-unreach-call.i-witness.graphml [2018-11-23 13:12:33,431 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:33,433 INFO L168 Benchmark]: Toolchain (without parser) took 11122.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -265.1 MB). Peak memory consumption was 454.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:33,434 INFO L168 Benchmark]: CDTParser took 0.27 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-11-23 13:12:33,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.15 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-11-23 13:12:33,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.26 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-11-23 13:12:33,435 INFO L168 Benchmark]: Boogie Preprocessor took 36.03 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-11-23 13:12:33,436 INFO L168 Benchmark]: RCFGBuilder took 663.91 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:33,437 INFO L168 Benchmark]: TraceAbstraction took 9983.34 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 478.8 MB). Peak memory consumption was 478.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:33,437 INFO L168 Benchmark]: Witness Printer took 74.35 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:33,442 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 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 332.15 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 26.26 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 36.03 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 663.91 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9983.34 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 478.8 MB). Peak memory consumption was 478.8 MB. Max. memory is 7.1 GB. * Witness Printer took 74.35 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 9.9s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 SDtfs, 26 SDslu, 275 SDs, 0 SdLazy, 151 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=5, 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 15 PreInvPairs, 20 NumberOfFragments, 12 HoareAnnotationTreeSize, 15 FomulaSimplifications, 46 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 11503 SizeOfPredicates, 7 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 26/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...