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_Bitvector.epf -i ../../../trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:54:14,165 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:54:14,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:54:14,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:54:14,189 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:54:14,190 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:54:14,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:54:14,194 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:54:14,197 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:54:14,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:54:14,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:54:14,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:54:14,201 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:54:14,202 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:54:14,203 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:54:14,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:54:14,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:54:14,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:54:14,211 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:54:14,213 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:54:14,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:54:14,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:54:14,224 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:54:14,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:54:14,224 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:54:14,225 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:54:14,231 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:54:14,232 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:54:14,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:54:14,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:54:14,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:54:14,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:54:14,240 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:54:14,240 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:54:14,241 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:54:14,242 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:54:14,242 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:54:14,270 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:54:14,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:54:14,273 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:54:14,273 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:54:14,274 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:54:14,274 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:54:14,274 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:54:14,274 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:54:14,274 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:54:14,276 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:54:14,276 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:54:14,276 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:54:14,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:54:14,277 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:54:14,277 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:54:14,277 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:54:14,277 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:54:14,277 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:54:14,278 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:54:14,278 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:54:14,278 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:54:14,278 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:54:14,278 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:54:14,279 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:54:14,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:14,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:54:14,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:54:14,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:54:14,280 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:54:14,281 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:54:14,282 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:54:14,282 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:54:14,282 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:54:14,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:54:14,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:54:14,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:54:14,377 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:54:14,377 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:54:14,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:14,435 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4a74b7c/f79543574c65446280c903a5717cccb1/FLAGf96ff2f69 [2018-11-23 10:54:14,874 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:54:14,874 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:14,883 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4a74b7c/f79543574c65446280c903a5717cccb1/FLAGf96ff2f69 [2018-11-23 10:54:15,229 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4a74b7c/f79543574c65446280c903a5717cccb1 [2018-11-23 10:54:15,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:54:15,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:54:15,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:15,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:54:15,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:54:15,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a7cd36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15, skipping insertion in model container [2018-11-23 10:54:15,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:54:15,291 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:54:15,588 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:15,597 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:54:15,640 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:15,663 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:54:15,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15 WrapperNode [2018-11-23 10:54:15,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:15,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:15,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:54:15,665 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:54:15,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:15,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:54:15,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:54:15,688 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:54:15,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (1/1) ... [2018-11-23 10:54:15,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:54:15,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:54:15,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:54:15,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:54:15,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (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 10:54:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:54:15,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:54:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:54:15,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:54:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:54:15,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:54:16,918 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:54:16,918 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:54:16,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:16 BoogieIcfgContainer [2018-11-23 10:54:16,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:54:16,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:54:16,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:54:16,923 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:54:16,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:54:15" (1/3) ... [2018-11-23 10:54:16,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5868392e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:16, skipping insertion in model container [2018-11-23 10:54:16,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:15" (2/3) ... [2018-11-23 10:54:16,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5868392e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:16, skipping insertion in model container [2018-11-23 10:54:16,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:16" (3/3) ... [2018-11-23 10:54:16,927 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:16,936 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:54:16,944 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:54:16,959 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:54:16,992 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:54:16,993 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:54:16,993 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:54:16,994 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:54:16,995 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:54:16,995 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:54:16,995 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:54:16,995 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:54:16,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:54:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-23 10:54:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:54:17,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:17,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:17,027 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:17,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:17,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2018-11-23 10:54:17,036 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:17,037 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:17,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:17,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:17,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2018-11-23 10:54:17,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 10:54:17,467 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {56#true} {56#true} #248#return; {56#true} is VALID [2018-11-23 10:54:17,467 INFO L256 TraceCheckUtils]: 3: Hoare triple {56#true} call #t~ret14 := main(); {56#true} is VALID [2018-11-23 10:54:17,468 INFO L273 TraceCheckUtils]: 4: Hoare triple {56#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {56#true} is VALID [2018-11-23 10:54:17,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {56#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {56#true} is VALID [2018-11-23 10:54:17,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {56#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {56#true} is VALID [2018-11-23 10:54:17,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,479 INFO L273 TraceCheckUtils]: 12: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,481 INFO L273 TraceCheckUtils]: 15: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,494 INFO L273 TraceCheckUtils]: 20: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,504 INFO L273 TraceCheckUtils]: 21: Hoare triple {82#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {57#false} is VALID [2018-11-23 10:54:17,505 INFO L273 TraceCheckUtils]: 22: Hoare triple {57#false} assume !false; {57#false} is VALID [2018-11-23 10:54:17,511 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 10:54:17,512 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:17,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:17,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:17,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:54:17,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:17,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:17,615 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 10:54:17,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:17,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:17,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:17,629 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-11-23 10:54:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:18,779 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2018-11-23 10:54:18,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:18,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:54:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 10:54:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 10:54:18,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2018-11-23 10:54:19,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:19,366 INFO L225 Difference]: With dead ends: 105 [2018-11-23 10:54:19,366 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 10:54:19,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 10:54:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2018-11-23 10:54:19,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:19,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 62 states. [2018-11-23 10:54:19,426 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 62 states. [2018-11-23 10:54:19,426 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 62 states. [2018-11-23 10:54:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:19,436 INFO L93 Difference]: Finished difference Result 90 states and 164 transitions. [2018-11-23 10:54:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 164 transitions. [2018-11-23 10:54:19,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:19,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:19,438 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 90 states. [2018-11-23 10:54:19,438 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 90 states. [2018-11-23 10:54:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:19,448 INFO L93 Difference]: Finished difference Result 90 states and 164 transitions. [2018-11-23 10:54:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 164 transitions. [2018-11-23 10:54:19,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:19,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:19,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:19,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 10:54:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2018-11-23 10:54:19,458 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2018-11-23 10:54:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:19,458 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2018-11-23 10:54:19,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2018-11-23 10:54:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:54:19,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:19,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:19,460 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:19,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:19,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2018-11-23 10:54:19,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:19,462 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:19,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:19,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:19,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {492#true} is VALID [2018-11-23 10:54:19,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {492#true} assume true; {492#true} is VALID [2018-11-23 10:54:19,621 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {492#true} {492#true} #248#return; {492#true} is VALID [2018-11-23 10:54:19,622 INFO L256 TraceCheckUtils]: 3: Hoare triple {492#true} call #t~ret14 := main(); {492#true} is VALID [2018-11-23 10:54:19,622 INFO L273 TraceCheckUtils]: 4: Hoare triple {492#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {492#true} is VALID [2018-11-23 10:54:19,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {492#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {492#true} is VALID [2018-11-23 10:54:19,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {492#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {492#true} is VALID [2018-11-23 10:54:19,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {492#true} assume !(0bv32 != ~p1~0); {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,627 INFO L273 TraceCheckUtils]: 10: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume !(0bv32 != ~p8~0); {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,635 INFO L273 TraceCheckUtils]: 17: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,636 INFO L273 TraceCheckUtils]: 18: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {518#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:19,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {518#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {493#false} is VALID [2018-11-23 10:54:19,638 INFO L273 TraceCheckUtils]: 21: Hoare triple {493#false} assume 1bv32 != ~lk1~0; {493#false} is VALID [2018-11-23 10:54:19,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {493#false} assume !false; {493#false} is VALID [2018-11-23 10:54:19,642 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 10:54:19,642 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:19,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:19,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:19,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:54:19,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:19,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:19,686 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 10:54:19,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:19,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:19,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:19,687 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2018-11-23 10:54:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:20,086 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2018-11-23 10:54:20,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:20,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:54:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-23 10:54:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-23 10:54:20,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2018-11-23 10:54:20,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:20,500 INFO L225 Difference]: With dead ends: 147 [2018-11-23 10:54:20,500 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 10:54:20,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 10:54:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 10:54:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 10:54:20,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:20,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2018-11-23 10:54:20,576 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2018-11-23 10:54:20,576 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2018-11-23 10:54:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:20,583 INFO L93 Difference]: Finished difference Result 90 states and 162 transitions. [2018-11-23 10:54:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 162 transitions. [2018-11-23 10:54:20,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:20,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:20,584 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2018-11-23 10:54:20,585 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2018-11-23 10:54:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:20,591 INFO L93 Difference]: Finished difference Result 90 states and 162 transitions. [2018-11-23 10:54:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 162 transitions. [2018-11-23 10:54:20,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:20,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:20,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:20,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 10:54:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2018-11-23 10:54:20,598 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2018-11-23 10:54:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:20,598 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2018-11-23 10:54:20,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-11-23 10:54:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:54:20,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:20,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:20,600 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:20,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2018-11-23 10:54:20,601 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:20,601 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:20,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:20,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:20,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {995#true} call ULTIMATE.init(); {995#true} is VALID [2018-11-23 10:54:20,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {995#true} assume true; {995#true} is VALID [2018-11-23 10:54:20,722 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {995#true} {995#true} #248#return; {995#true} is VALID [2018-11-23 10:54:20,722 INFO L256 TraceCheckUtils]: 3: Hoare triple {995#true} call #t~ret14 := main(); {995#true} is VALID [2018-11-23 10:54:20,722 INFO L273 TraceCheckUtils]: 4: Hoare triple {995#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {995#true} is VALID [2018-11-23 10:54:20,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {995#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {995#true} is VALID [2018-11-23 10:54:20,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {995#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {995#true} is VALID [2018-11-23 10:54:20,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {995#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p8~0); {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {1021#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:20,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {1021#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {996#false} is VALID [2018-11-23 10:54:20,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {996#false} assume 0bv32 != ~p2~0; {996#false} is VALID [2018-11-23 10:54:20,747 INFO L273 TraceCheckUtils]: 22: Hoare triple {996#false} assume 1bv32 != ~lk2~0; {996#false} is VALID [2018-11-23 10:54:20,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {996#false} assume !false; {996#false} is VALID [2018-11-23 10:54:20,748 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 10:54:20,748 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:20,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:20,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:20,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:20,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:20,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:20,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:20,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:20,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:20,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:20,815 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2018-11-23 10:54:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:21,141 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2018-11-23 10:54:21,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:21,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-23 10:54:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-23 10:54:21,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2018-11-23 10:54:21,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:21,425 INFO L225 Difference]: With dead ends: 135 [2018-11-23 10:54:21,425 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 10:54:21,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 10:54:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 10:54:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-23 10:54:21,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:21,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 91 states. [2018-11-23 10:54:21,452 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 91 states. [2018-11-23 10:54:21,452 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 91 states. [2018-11-23 10:54:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:21,457 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2018-11-23 10:54:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 164 transitions. [2018-11-23 10:54:21,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:21,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:21,459 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 93 states. [2018-11-23 10:54:21,459 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 93 states. [2018-11-23 10:54:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:21,464 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2018-11-23 10:54:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 164 transitions. [2018-11-23 10:54:21,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:21,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:21,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:21,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 10:54:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2018-11-23 10:54:21,470 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2018-11-23 10:54:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:21,470 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2018-11-23 10:54:21,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2018-11-23 10:54:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:54:21,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:21,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:21,472 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:21,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2018-11-23 10:54:21,473 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:21,473 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:21,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:21,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:21,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {1500#true} call ULTIMATE.init(); {1500#true} is VALID [2018-11-23 10:54:21,603 INFO L273 TraceCheckUtils]: 1: Hoare triple {1500#true} assume true; {1500#true} is VALID [2018-11-23 10:54:21,604 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1500#true} {1500#true} #248#return; {1500#true} is VALID [2018-11-23 10:54:21,604 INFO L256 TraceCheckUtils]: 3: Hoare triple {1500#true} call #t~ret14 := main(); {1500#true} is VALID [2018-11-23 10:54:21,604 INFO L273 TraceCheckUtils]: 4: Hoare triple {1500#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {1500#true} is VALID [2018-11-23 10:54:21,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {1500#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {1500#true} is VALID [2018-11-23 10:54:21,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {1500#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {1500#true} is VALID [2018-11-23 10:54:21,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {1500#true} assume !(0bv32 != ~p1~0); {1500#true} is VALID [2018-11-23 10:54:21,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {1500#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,613 INFO L273 TraceCheckUtils]: 17: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:21,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {1529#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {1501#false} is VALID [2018-11-23 10:54:21,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {1501#false} assume !false; {1501#false} is VALID [2018-11-23 10:54:21,619 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 10:54:21,619 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:21,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:21,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:21,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:21,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:21,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:21,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:21,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:21,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:21,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:21,660 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2018-11-23 10:54:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:21,926 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2018-11-23 10:54:21,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:21,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 10:54:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 10:54:21,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2018-11-23 10:54:22,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:22,167 INFO L225 Difference]: With dead ends: 172 [2018-11-23 10:54:22,167 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 10:54:22,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 10:54:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 10:54:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2018-11-23 10:54:22,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:22,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 120 states. [2018-11-23 10:54:22,197 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 120 states. [2018-11-23 10:54:22,197 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 120 states. [2018-11-23 10:54:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:22,205 INFO L93 Difference]: Finished difference Result 170 states and 309 transitions. [2018-11-23 10:54:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 309 transitions. [2018-11-23 10:54:22,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:22,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:22,206 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 170 states. [2018-11-23 10:54:22,206 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 170 states. [2018-11-23 10:54:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:22,215 INFO L93 Difference]: Finished difference Result 170 states and 309 transitions. [2018-11-23 10:54:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 309 transitions. [2018-11-23 10:54:22,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:22,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:22,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:22,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 10:54:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2018-11-23 10:54:22,221 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2018-11-23 10:54:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:22,222 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2018-11-23 10:54:22,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2018-11-23 10:54:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:54:22,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:22,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:22,223 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:22,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2018-11-23 10:54:22,224 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:22,224 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:22,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:22,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:22,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {2226#true} call ULTIMATE.init(); {2226#true} is VALID [2018-11-23 10:54:22,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {2226#true} assume true; {2226#true} is VALID [2018-11-23 10:54:22,338 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2226#true} {2226#true} #248#return; {2226#true} is VALID [2018-11-23 10:54:22,339 INFO L256 TraceCheckUtils]: 3: Hoare triple {2226#true} call #t~ret14 := main(); {2226#true} is VALID [2018-11-23 10:54:22,339 INFO L273 TraceCheckUtils]: 4: Hoare triple {2226#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {2226#true} is VALID [2018-11-23 10:54:22,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {2226#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {2226#true} is VALID [2018-11-23 10:54:22,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {2226#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {2226#true} is VALID [2018-11-23 10:54:22,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {2226#true} assume !(0bv32 != ~p1~0); {2226#true} is VALID [2018-11-23 10:54:22,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {2226#true} assume !(0bv32 != ~p2~0); {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p8~0); {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {2255#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:22,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {2255#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {2227#false} is VALID [2018-11-23 10:54:22,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {2227#false} assume 1bv32 != ~lk2~0; {2227#false} is VALID [2018-11-23 10:54:22,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {2227#false} assume !false; {2227#false} is VALID [2018-11-23 10:54:22,367 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 10:54:22,367 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:22,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:22,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:22,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:22,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:22,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:22,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:22,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:22,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:22,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:22,397 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2018-11-23 10:54:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:22,678 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2018-11-23 10:54:22,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:22,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2018-11-23 10:54:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2018-11-23 10:54:22,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 242 transitions. [2018-11-23 10:54:23,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:23,257 INFO L225 Difference]: With dead ends: 284 [2018-11-23 10:54:23,257 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 10:54:23,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 10:54:23,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 10:54:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-11-23 10:54:23,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:23,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 170 states. [2018-11-23 10:54:23,323 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 170 states. [2018-11-23 10:54:23,323 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 170 states. [2018-11-23 10:54:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:23,330 INFO L93 Difference]: Finished difference Result 172 states and 307 transitions. [2018-11-23 10:54:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 307 transitions. [2018-11-23 10:54:23,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:23,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:23,331 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 172 states. [2018-11-23 10:54:23,331 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 172 states. [2018-11-23 10:54:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:23,338 INFO L93 Difference]: Finished difference Result 172 states and 307 transitions. [2018-11-23 10:54:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 307 transitions. [2018-11-23 10:54:23,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:23,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:23,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:23,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-23 10:54:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2018-11-23 10:54:23,346 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2018-11-23 10:54:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:23,346 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2018-11-23 10:54:23,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2018-11-23 10:54:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:23,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:23,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:23,348 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:23,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:23,349 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2018-11-23 10:54:23,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:23,349 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:23,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:23,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:23,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {3122#true} call ULTIMATE.init(); {3122#true} is VALID [2018-11-23 10:54:23,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {3122#true} assume true; {3122#true} is VALID [2018-11-23 10:54:23,478 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3122#true} {3122#true} #248#return; {3122#true} is VALID [2018-11-23 10:54:23,479 INFO L256 TraceCheckUtils]: 3: Hoare triple {3122#true} call #t~ret14 := main(); {3122#true} is VALID [2018-11-23 10:54:23,479 INFO L273 TraceCheckUtils]: 4: Hoare triple {3122#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {3122#true} is VALID [2018-11-23 10:54:23,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {3122#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {3122#true} is VALID [2018-11-23 10:54:23,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {3122#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {3122#true} is VALID [2018-11-23 10:54:23,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {3122#true} assume !(0bv32 != ~p1~0); {3122#true} is VALID [2018-11-23 10:54:23,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {3122#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p8~0); {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,528 INFO L273 TraceCheckUtils]: 19: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {3151#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:23,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {3151#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {3123#false} is VALID [2018-11-23 10:54:23,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {3123#false} assume 0bv32 != ~p3~0; {3123#false} is VALID [2018-11-23 10:54:23,530 INFO L273 TraceCheckUtils]: 23: Hoare triple {3123#false} assume 1bv32 != ~lk3~0; {3123#false} is VALID [2018-11-23 10:54:23,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {3123#false} assume !false; {3123#false} is VALID [2018-11-23 10:54:23,532 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 10:54:23,532 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:23,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:23,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:23,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:23,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:23,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:23,567 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 10:54:23,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:23,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:23,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:23,569 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2018-11-23 10:54:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:23,855 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2018-11-23 10:54:23,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:23,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:23,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-23 10:54:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-23 10:54:23,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 237 transitions. [2018-11-23 10:54:24,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:24,570 INFO L225 Difference]: With dead ends: 255 [2018-11-23 10:54:24,570 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 10:54:24,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 10:54:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 10:54:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-23 10:54:24,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:24,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 172 states. [2018-11-23 10:54:24,631 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 172 states. [2018-11-23 10:54:24,631 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 172 states. [2018-11-23 10:54:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:24,638 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2018-11-23 10:54:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 307 transitions. [2018-11-23 10:54:24,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:24,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:24,639 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 174 states. [2018-11-23 10:54:24,639 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 174 states. [2018-11-23 10:54:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:24,646 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2018-11-23 10:54:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 307 transitions. [2018-11-23 10:54:24,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:24,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:24,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:24,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-23 10:54:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2018-11-23 10:54:24,654 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2018-11-23 10:54:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:24,655 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2018-11-23 10:54:24,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2018-11-23 10:54:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:24,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:24,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:24,657 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:24,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:24,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2018-11-23 10:54:24,657 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:24,657 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:24,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:24,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:24,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {3998#true} call ULTIMATE.init(); {3998#true} is VALID [2018-11-23 10:54:24,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {3998#true} assume true; {3998#true} is VALID [2018-11-23 10:54:24,808 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3998#true} {3998#true} #248#return; {3998#true} is VALID [2018-11-23 10:54:24,809 INFO L256 TraceCheckUtils]: 3: Hoare triple {3998#true} call #t~ret14 := main(); {3998#true} is VALID [2018-11-23 10:54:24,809 INFO L273 TraceCheckUtils]: 4: Hoare triple {3998#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {3998#true} is VALID [2018-11-23 10:54:24,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {3998#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {3998#true} is VALID [2018-11-23 10:54:24,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {3998#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {3998#true} is VALID [2018-11-23 10:54:24,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {3998#true} assume !(0bv32 != ~p1~0); {3998#true} is VALID [2018-11-23 10:54:24,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {3998#true} assume !(0bv32 != ~p2~0); {3998#true} is VALID [2018-11-23 10:54:24,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {3998#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:24,858 INFO L273 TraceCheckUtils]: 23: Hoare triple {4030#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {3999#false} is VALID [2018-11-23 10:54:24,859 INFO L273 TraceCheckUtils]: 24: Hoare triple {3999#false} assume !false; {3999#false} is VALID [2018-11-23 10:54:24,860 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 10:54:24,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:24,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:24,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:24,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:24,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:24,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:24,930 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 10:54:24,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:24,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:24,931 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2018-11-23 10:54:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:25,298 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2018-11-23 10:54:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:25,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 10:54:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 10:54:25,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2018-11-23 10:54:25,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:25,753 INFO L225 Difference]: With dead ends: 324 [2018-11-23 10:54:25,753 INFO L226 Difference]: Without dead ends: 322 [2018-11-23 10:54:25,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 10:54:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-23 10:54:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2018-11-23 10:54:25,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:25,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand 232 states. [2018-11-23 10:54:25,786 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand 232 states. [2018-11-23 10:54:25,786 INFO L87 Difference]: Start difference. First operand 322 states. Second operand 232 states. [2018-11-23 10:54:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:25,800 INFO L93 Difference]: Finished difference Result 322 states and 579 transitions. [2018-11-23 10:54:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 579 transitions. [2018-11-23 10:54:25,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:25,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:25,801 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 322 states. [2018-11-23 10:54:25,801 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 322 states. [2018-11-23 10:54:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:25,810 INFO L93 Difference]: Finished difference Result 322 states and 579 transitions. [2018-11-23 10:54:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 579 transitions. [2018-11-23 10:54:25,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:25,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:25,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:25,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 10:54:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2018-11-23 10:54:25,818 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2018-11-23 10:54:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:25,818 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2018-11-23 10:54:25,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2018-11-23 10:54:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:25,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:25,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:25,820 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:25,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:25,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2018-11-23 10:54:25,821 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:25,821 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:25,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:25,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:26,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {5301#true} call ULTIMATE.init(); {5301#true} is VALID [2018-11-23 10:54:26,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {5301#true} assume true; {5301#true} is VALID [2018-11-23 10:54:26,360 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5301#true} {5301#true} #248#return; {5301#true} is VALID [2018-11-23 10:54:26,361 INFO L256 TraceCheckUtils]: 3: Hoare triple {5301#true} call #t~ret14 := main(); {5301#true} is VALID [2018-11-23 10:54:26,361 INFO L273 TraceCheckUtils]: 4: Hoare triple {5301#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {5301#true} is VALID [2018-11-23 10:54:26,361 INFO L273 TraceCheckUtils]: 5: Hoare triple {5301#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {5301#true} is VALID [2018-11-23 10:54:26,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {5301#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {5301#true} is VALID [2018-11-23 10:54:26,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {5301#true} assume !(0bv32 != ~p1~0); {5301#true} is VALID [2018-11-23 10:54:26,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {5301#true} assume !(0bv32 != ~p2~0); {5301#true} is VALID [2018-11-23 10:54:26,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {5301#true} assume !(0bv32 != ~p3~0); {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p8~0); {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,365 INFO L273 TraceCheckUtils]: 18: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,369 INFO L273 TraceCheckUtils]: 21: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {5333#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:26,370 INFO L273 TraceCheckUtils]: 22: Hoare triple {5333#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {5302#false} is VALID [2018-11-23 10:54:26,370 INFO L273 TraceCheckUtils]: 23: Hoare triple {5302#false} assume 1bv32 != ~lk3~0; {5302#false} is VALID [2018-11-23 10:54:26,370 INFO L273 TraceCheckUtils]: 24: Hoare triple {5302#false} assume !false; {5302#false} is VALID [2018-11-23 10:54:26,371 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 10:54:26,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:26,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:26,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:26,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:26,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:26,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:26,397 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 10:54:26,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:26,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:26,399 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2018-11-23 10:54:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:26,900 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2018-11-23 10:54:26,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:26,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2018-11-23 10:54:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2018-11-23 10:54:26,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 239 transitions. [2018-11-23 10:54:27,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:27,568 INFO L225 Difference]: With dead ends: 552 [2018-11-23 10:54:27,568 INFO L226 Difference]: Without dead ends: 330 [2018-11-23 10:54:27,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-23 10:54:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-11-23 10:54:27,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:27,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand 328 states. [2018-11-23 10:54:27,618 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand 328 states. [2018-11-23 10:54:27,618 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 328 states. [2018-11-23 10:54:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:27,629 INFO L93 Difference]: Finished difference Result 330 states and 579 transitions. [2018-11-23 10:54:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 579 transitions. [2018-11-23 10:54:27,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:27,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:27,631 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand 330 states. [2018-11-23 10:54:27,631 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 330 states. [2018-11-23 10:54:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:27,641 INFO L93 Difference]: Finished difference Result 330 states and 579 transitions. [2018-11-23 10:54:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 579 transitions. [2018-11-23 10:54:27,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:27,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:27,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:27,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-23 10:54:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2018-11-23 10:54:27,652 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2018-11-23 10:54:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:27,653 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2018-11-23 10:54:27,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2018-11-23 10:54:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:27,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:27,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:27,654 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:27,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2018-11-23 10:54:27,655 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:27,655 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:27,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:27,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:28,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {6952#true} call ULTIMATE.init(); {6952#true} is VALID [2018-11-23 10:54:28,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {6952#true} assume true; {6952#true} is VALID [2018-11-23 10:54:28,274 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6952#true} {6952#true} #248#return; {6952#true} is VALID [2018-11-23 10:54:28,274 INFO L256 TraceCheckUtils]: 3: Hoare triple {6952#true} call #t~ret14 := main(); {6952#true} is VALID [2018-11-23 10:54:28,274 INFO L273 TraceCheckUtils]: 4: Hoare triple {6952#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {6952#true} is VALID [2018-11-23 10:54:28,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {6952#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {6952#true} is VALID [2018-11-23 10:54:28,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {6952#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {6952#true} is VALID [2018-11-23 10:54:28,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {6952#true} assume !(0bv32 != ~p1~0); {6952#true} is VALID [2018-11-23 10:54:28,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {6952#true} assume !(0bv32 != ~p2~0); {6952#true} is VALID [2018-11-23 10:54:28,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {6952#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p8~0); {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,290 INFO L273 TraceCheckUtils]: 15: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,291 INFO L273 TraceCheckUtils]: 17: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {6984#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:28,307 INFO L273 TraceCheckUtils]: 22: Hoare triple {6984#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {6953#false} is VALID [2018-11-23 10:54:28,307 INFO L273 TraceCheckUtils]: 23: Hoare triple {6953#false} assume 0bv32 != ~p4~0; {6953#false} is VALID [2018-11-23 10:54:28,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {6953#false} assume 1bv32 != ~lk4~0; {6953#false} is VALID [2018-11-23 10:54:28,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {6953#false} assume !false; {6953#false} is VALID [2018-11-23 10:54:28,308 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 10:54:28,309 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:28,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:28,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:28,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:28,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:28,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:28,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:28,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:28,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:28,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:28,338 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2018-11-23 10:54:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:28,705 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2018-11-23 10:54:28,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:28,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2018-11-23 10:54:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2018-11-23 10:54:28,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 234 transitions. [2018-11-23 10:54:28,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:28,931 INFO L225 Difference]: With dead ends: 492 [2018-11-23 10:54:28,931 INFO L226 Difference]: Without dead ends: 334 [2018-11-23 10:54:28,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-23 10:54:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-11-23 10:54:29,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:29,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand 332 states. [2018-11-23 10:54:29,249 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand 332 states. [2018-11-23 10:54:29,249 INFO L87 Difference]: Start difference. First operand 334 states. Second operand 332 states. [2018-11-23 10:54:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:29,258 INFO L93 Difference]: Finished difference Result 334 states and 579 transitions. [2018-11-23 10:54:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 579 transitions. [2018-11-23 10:54:29,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:29,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:29,259 INFO L74 IsIncluded]: Start isIncluded. First operand 332 states. Second operand 334 states. [2018-11-23 10:54:29,259 INFO L87 Difference]: Start difference. First operand 332 states. Second operand 334 states. [2018-11-23 10:54:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:29,268 INFO L93 Difference]: Finished difference Result 334 states and 579 transitions. [2018-11-23 10:54:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 579 transitions. [2018-11-23 10:54:29,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:29,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:29,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:29,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-23 10:54:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2018-11-23 10:54:29,276 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2018-11-23 10:54:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:29,276 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2018-11-23 10:54:29,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2018-11-23 10:54:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:29,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:29,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:29,278 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:29,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:29,278 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2018-11-23 10:54:29,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:29,278 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:29,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:29,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:29,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {8558#true} call ULTIMATE.init(); {8558#true} is VALID [2018-11-23 10:54:29,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {8558#true} assume true; {8558#true} is VALID [2018-11-23 10:54:29,397 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8558#true} {8558#true} #248#return; {8558#true} is VALID [2018-11-23 10:54:29,397 INFO L256 TraceCheckUtils]: 3: Hoare triple {8558#true} call #t~ret14 := main(); {8558#true} is VALID [2018-11-23 10:54:29,398 INFO L273 TraceCheckUtils]: 4: Hoare triple {8558#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {8558#true} is VALID [2018-11-23 10:54:29,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {8558#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {8558#true} is VALID [2018-11-23 10:54:29,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {8558#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {8558#true} is VALID [2018-11-23 10:54:29,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {8558#true} assume !(0bv32 != ~p1~0); {8558#true} is VALID [2018-11-23 10:54:29,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {8558#true} assume !(0bv32 != ~p2~0); {8558#true} is VALID [2018-11-23 10:54:29,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {8558#true} assume !(0bv32 != ~p3~0); {8558#true} is VALID [2018-11-23 10:54:29,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {8558#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,399 INFO L273 TraceCheckUtils]: 11: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,404 INFO L273 TraceCheckUtils]: 14: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:29,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {8593#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {8559#false} is VALID [2018-11-23 10:54:29,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {8559#false} assume !false; {8559#false} is VALID [2018-11-23 10:54:29,415 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 10:54:29,415 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:29,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:29,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:29,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:29,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:29,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:29,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:29,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:29,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:29,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:29,445 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2018-11-23 10:54:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:30,336 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2018-11-23 10:54:30,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:30,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2018-11-23 10:54:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2018-11-23 10:54:30,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2018-11-23 10:54:30,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:30,527 INFO L225 Difference]: With dead ends: 620 [2018-11-23 10:54:30,527 INFO L226 Difference]: Without dead ends: 618 [2018-11-23 10:54:30,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 10:54:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-23 10:54:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2018-11-23 10:54:30,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:30,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 618 states. Second operand 456 states. [2018-11-23 10:54:30,641 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand 456 states. [2018-11-23 10:54:30,641 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 456 states. [2018-11-23 10:54:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:30,660 INFO L93 Difference]: Finished difference Result 618 states and 1087 transitions. [2018-11-23 10:54:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1087 transitions. [2018-11-23 10:54:30,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:30,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:30,661 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 618 states. [2018-11-23 10:54:30,662 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 618 states. [2018-11-23 10:54:30,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:30,685 INFO L93 Difference]: Finished difference Result 618 states and 1087 transitions. [2018-11-23 10:54:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1087 transitions. [2018-11-23 10:54:30,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:30,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:30,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:30,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 10:54:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2018-11-23 10:54:30,702 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2018-11-23 10:54:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:30,702 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2018-11-23 10:54:30,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2018-11-23 10:54:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:30,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:30,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:30,704 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:30,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2018-11-23 10:54:30,704 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:30,705 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:30,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:30,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:30,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {10988#true} call ULTIMATE.init(); {10988#true} is VALID [2018-11-23 10:54:30,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {10988#true} assume true; {10988#true} is VALID [2018-11-23 10:54:30,832 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10988#true} {10988#true} #248#return; {10988#true} is VALID [2018-11-23 10:54:30,832 INFO L256 TraceCheckUtils]: 3: Hoare triple {10988#true} call #t~ret14 := main(); {10988#true} is VALID [2018-11-23 10:54:30,832 INFO L273 TraceCheckUtils]: 4: Hoare triple {10988#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {10988#true} is VALID [2018-11-23 10:54:30,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {10988#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {10988#true} is VALID [2018-11-23 10:54:30,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {10988#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {10988#true} is VALID [2018-11-23 10:54:30,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {10988#true} assume !(0bv32 != ~p1~0); {10988#true} is VALID [2018-11-23 10:54:30,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {10988#true} assume !(0bv32 != ~p2~0); {10988#true} is VALID [2018-11-23 10:54:30,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {10988#true} assume !(0bv32 != ~p3~0); {10988#true} is VALID [2018-11-23 10:54:30,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {10988#true} assume !(0bv32 != ~p4~0); {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p8~0); {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,849 INFO L273 TraceCheckUtils]: 15: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,851 INFO L273 TraceCheckUtils]: 18: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,851 INFO L273 TraceCheckUtils]: 19: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,852 INFO L273 TraceCheckUtils]: 20: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,852 INFO L273 TraceCheckUtils]: 21: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,852 INFO L273 TraceCheckUtils]: 22: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {11023#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:30,853 INFO L273 TraceCheckUtils]: 23: Hoare triple {11023#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {10989#false} is VALID [2018-11-23 10:54:30,853 INFO L273 TraceCheckUtils]: 24: Hoare triple {10989#false} assume 1bv32 != ~lk4~0; {10989#false} is VALID [2018-11-23 10:54:30,853 INFO L273 TraceCheckUtils]: 25: Hoare triple {10989#false} assume !false; {10989#false} is VALID [2018-11-23 10:54:30,854 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 10:54:30,855 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (12)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:54:30,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:30,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:30,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:30,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:30,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:30,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:30,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:30,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:30,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:30,931 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2018-11-23 10:54:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:31,302 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2018-11-23 10:54:31,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:31,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2018-11-23 10:54:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2018-11-23 10:54:31,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 236 transitions. [2018-11-23 10:54:31,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:31,568 INFO L225 Difference]: With dead ends: 1084 [2018-11-23 10:54:31,568 INFO L226 Difference]: Without dead ends: 642 [2018-11-23 10:54:31,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 10:54:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-11-23 10:54:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2018-11-23 10:54:31,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:31,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 642 states. Second operand 640 states. [2018-11-23 10:54:31,816 INFO L74 IsIncluded]: Start isIncluded. First operand 642 states. Second operand 640 states. [2018-11-23 10:54:31,817 INFO L87 Difference]: Start difference. First operand 642 states. Second operand 640 states. [2018-11-23 10:54:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:31,841 INFO L93 Difference]: Finished difference Result 642 states and 1095 transitions. [2018-11-23 10:54:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1095 transitions. [2018-11-23 10:54:31,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:31,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:31,843 INFO L74 IsIncluded]: Start isIncluded. First operand 640 states. Second operand 642 states. [2018-11-23 10:54:31,843 INFO L87 Difference]: Start difference. First operand 640 states. Second operand 642 states. [2018-11-23 10:54:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:31,865 INFO L93 Difference]: Finished difference Result 642 states and 1095 transitions. [2018-11-23 10:54:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1095 transitions. [2018-11-23 10:54:31,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:31,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:31,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:31,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-23 10:54:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2018-11-23 10:54:31,892 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2018-11-23 10:54:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:31,893 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2018-11-23 10:54:31,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2018-11-23 10:54:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:31,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:31,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:31,895 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:31,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:31,895 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2018-11-23 10:54:31,895 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:31,896 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:31,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:31,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:32,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {14130#true} call ULTIMATE.init(); {14130#true} is VALID [2018-11-23 10:54:32,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {14130#true} assume true; {14130#true} is VALID [2018-11-23 10:54:32,042 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14130#true} {14130#true} #248#return; {14130#true} is VALID [2018-11-23 10:54:32,042 INFO L256 TraceCheckUtils]: 3: Hoare triple {14130#true} call #t~ret14 := main(); {14130#true} is VALID [2018-11-23 10:54:32,042 INFO L273 TraceCheckUtils]: 4: Hoare triple {14130#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {14130#true} is VALID [2018-11-23 10:54:32,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {14130#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {14130#true} is VALID [2018-11-23 10:54:32,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {14130#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {14130#true} is VALID [2018-11-23 10:54:32,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {14130#true} assume !(0bv32 != ~p1~0); {14130#true} is VALID [2018-11-23 10:54:32,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {14130#true} assume !(0bv32 != ~p2~0); {14130#true} is VALID [2018-11-23 10:54:32,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {14130#true} assume !(0bv32 != ~p3~0); {14130#true} is VALID [2018-11-23 10:54:32,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {14130#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p8~0); {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,052 INFO L273 TraceCheckUtils]: 16: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,053 INFO L273 TraceCheckUtils]: 17: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,054 INFO L273 TraceCheckUtils]: 18: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,056 INFO L273 TraceCheckUtils]: 20: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {14165#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:32,062 INFO L273 TraceCheckUtils]: 23: Hoare triple {14165#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {14131#false} is VALID [2018-11-23 10:54:32,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {14131#false} assume 0bv32 != ~p5~0; {14131#false} is VALID [2018-11-23 10:54:32,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {14131#false} assume 1bv32 != ~lk5~0; {14131#false} is VALID [2018-11-23 10:54:32,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {14131#false} assume !false; {14131#false} is VALID [2018-11-23 10:54:32,065 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 10:54:32,065 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:32,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:32,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:32,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:32,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:32,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:32,142 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 10:54:32,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:32,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:32,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:32,143 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2018-11-23 10:54:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:32,714 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2018-11-23 10:54:32,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:32,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2018-11-23 10:54:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2018-11-23 10:54:32,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 231 transitions. [2018-11-23 10:54:32,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:33,007 INFO L225 Difference]: With dead ends: 960 [2018-11-23 10:54:33,007 INFO L226 Difference]: Without dead ends: 650 [2018-11-23 10:54:33,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 10:54:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-23 10:54:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-11-23 10:54:33,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:33,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand 648 states. [2018-11-23 10:54:33,232 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand 648 states. [2018-11-23 10:54:33,232 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 648 states. [2018-11-23 10:54:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:33,251 INFO L93 Difference]: Finished difference Result 650 states and 1095 transitions. [2018-11-23 10:54:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1095 transitions. [2018-11-23 10:54:33,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:33,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:33,252 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand 650 states. [2018-11-23 10:54:33,252 INFO L87 Difference]: Start difference. First operand 648 states. Second operand 650 states. [2018-11-23 10:54:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:33,275 INFO L93 Difference]: Finished difference Result 650 states and 1095 transitions. [2018-11-23 10:54:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1095 transitions. [2018-11-23 10:54:33,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:33,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:33,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:33,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-23 10:54:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2018-11-23 10:54:33,294 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2018-11-23 10:54:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:33,295 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2018-11-23 10:54:33,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2018-11-23 10:54:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:33,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:33,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:33,296 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:33,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:33,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2018-11-23 10:54:33,296 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:33,296 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:33,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:33,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:33,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {17175#true} call ULTIMATE.init(); {17175#true} is VALID [2018-11-23 10:54:33,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {17175#true} assume true; {17175#true} is VALID [2018-11-23 10:54:33,405 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17175#true} {17175#true} #248#return; {17175#true} is VALID [2018-11-23 10:54:33,405 INFO L256 TraceCheckUtils]: 3: Hoare triple {17175#true} call #t~ret14 := main(); {17175#true} is VALID [2018-11-23 10:54:33,405 INFO L273 TraceCheckUtils]: 4: Hoare triple {17175#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {17175#true} is VALID [2018-11-23 10:54:33,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {17175#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {17175#true} is VALID [2018-11-23 10:54:33,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {17175#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {17175#true} is VALID [2018-11-23 10:54:33,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {17175#true} assume !(0bv32 != ~p1~0); {17175#true} is VALID [2018-11-23 10:54:33,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {17175#true} assume !(0bv32 != ~p2~0); {17175#true} is VALID [2018-11-23 10:54:33,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {17175#true} assume !(0bv32 != ~p3~0); {17175#true} is VALID [2018-11-23 10:54:33,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {17175#true} assume !(0bv32 != ~p4~0); {17175#true} is VALID [2018-11-23 10:54:33,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {17175#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:33,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {17213#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {17176#false} is VALID [2018-11-23 10:54:33,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {17176#false} assume !false; {17176#false} is VALID [2018-11-23 10:54:33,416 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 10:54:33,416 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:33,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:33,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:33,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:33,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:33,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:33,445 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 10:54:33,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:33,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:33,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:33,446 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2018-11-23 10:54:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:33,838 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2018-11-23 10:54:33,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:33,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 10:54:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 10:54:33,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-23 10:54:33,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:34,048 INFO L225 Difference]: With dead ends: 1196 [2018-11-23 10:54:34,048 INFO L226 Difference]: Without dead ends: 1194 [2018-11-23 10:54:34,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 10:54:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-11-23 10:54:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2018-11-23 10:54:34,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:34,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1194 states. Second operand 904 states. [2018-11-23 10:54:34,498 INFO L74 IsIncluded]: Start isIncluded. First operand 1194 states. Second operand 904 states. [2018-11-23 10:54:34,498 INFO L87 Difference]: Start difference. First operand 1194 states. Second operand 904 states. [2018-11-23 10:54:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:34,549 INFO L93 Difference]: Finished difference Result 1194 states and 2039 transitions. [2018-11-23 10:54:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 2039 transitions. [2018-11-23 10:54:34,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:34,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:34,551 INFO L74 IsIncluded]: Start isIncluded. First operand 904 states. Second operand 1194 states. [2018-11-23 10:54:34,551 INFO L87 Difference]: Start difference. First operand 904 states. Second operand 1194 states. [2018-11-23 10:54:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:34,609 INFO L93 Difference]: Finished difference Result 1194 states and 2039 transitions. [2018-11-23 10:54:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 2039 transitions. [2018-11-23 10:54:34,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:34,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:34,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:34,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-23 10:54:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2018-11-23 10:54:34,640 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2018-11-23 10:54:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:34,640 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2018-11-23 10:54:34,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2018-11-23 10:54:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:34,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:34,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:34,641 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:34,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2018-11-23 10:54:34,642 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:34,642 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:34,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:34,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:34,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {21808#true} call ULTIMATE.init(); {21808#true} is VALID [2018-11-23 10:54:34,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {21808#true} assume true; {21808#true} is VALID [2018-11-23 10:54:34,788 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21808#true} {21808#true} #248#return; {21808#true} is VALID [2018-11-23 10:54:34,789 INFO L256 TraceCheckUtils]: 3: Hoare triple {21808#true} call #t~ret14 := main(); {21808#true} is VALID [2018-11-23 10:54:34,789 INFO L273 TraceCheckUtils]: 4: Hoare triple {21808#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {21808#true} is VALID [2018-11-23 10:54:34,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {21808#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {21808#true} is VALID [2018-11-23 10:54:34,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {21808#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {21808#true} is VALID [2018-11-23 10:54:34,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {21808#true} assume !(0bv32 != ~p1~0); {21808#true} is VALID [2018-11-23 10:54:34,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {21808#true} assume !(0bv32 != ~p2~0); {21808#true} is VALID [2018-11-23 10:54:34,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {21808#true} assume !(0bv32 != ~p3~0); {21808#true} is VALID [2018-11-23 10:54:34,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {21808#true} assume !(0bv32 != ~p4~0); {21808#true} is VALID [2018-11-23 10:54:34,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {21808#true} assume !(0bv32 != ~p5~0); {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p8~0); {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,794 INFO L273 TraceCheckUtils]: 23: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {21846#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:34,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {21846#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {21809#false} is VALID [2018-11-23 10:54:34,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {21809#false} assume 1bv32 != ~lk5~0; {21809#false} is VALID [2018-11-23 10:54:34,796 INFO L273 TraceCheckUtils]: 26: Hoare triple {21809#false} assume !false; {21809#false} is VALID [2018-11-23 10:54:34,797 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 10:54:34,797 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:34,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:34,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:34,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:34,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:34,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:34,823 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 10:54:34,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:34,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:34,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:34,825 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2018-11-23 10:54:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:35,501 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2018-11-23 10:54:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:35,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2018-11-23 10:54:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2018-11-23 10:54:35,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 233 transitions. [2018-11-23 10:54:35,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:35,812 INFO L225 Difference]: With dead ends: 2140 [2018-11-23 10:54:35,813 INFO L226 Difference]: Without dead ends: 1258 [2018-11-23 10:54:35,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 10:54:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-11-23 10:54:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2018-11-23 10:54:36,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:36,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1258 states. Second operand 1256 states. [2018-11-23 10:54:36,161 INFO L74 IsIncluded]: Start isIncluded. First operand 1258 states. Second operand 1256 states. [2018-11-23 10:54:36,161 INFO L87 Difference]: Start difference. First operand 1258 states. Second operand 1256 states. [2018-11-23 10:54:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:36,217 INFO L93 Difference]: Finished difference Result 1258 states and 2071 transitions. [2018-11-23 10:54:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 2071 transitions. [2018-11-23 10:54:36,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:36,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:36,218 INFO L74 IsIncluded]: Start isIncluded. First operand 1256 states. Second operand 1258 states. [2018-11-23 10:54:36,218 INFO L87 Difference]: Start difference. First operand 1256 states. Second operand 1258 states. [2018-11-23 10:54:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:36,278 INFO L93 Difference]: Finished difference Result 1258 states and 2071 transitions. [2018-11-23 10:54:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 2071 transitions. [2018-11-23 10:54:36,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:36,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:36,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:36,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-11-23 10:54:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2018-11-23 10:54:36,329 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2018-11-23 10:54:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:36,329 INFO L480 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2018-11-23 10:54:36,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2018-11-23 10:54:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:36,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:36,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:36,331 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:36,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:36,332 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2018-11-23 10:54:36,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:36,332 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:36,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:36,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:36,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {27897#true} call ULTIMATE.init(); {27897#true} is VALID [2018-11-23 10:54:36,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {27897#true} assume true; {27897#true} is VALID [2018-11-23 10:54:36,605 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27897#true} {27897#true} #248#return; {27897#true} is VALID [2018-11-23 10:54:36,605 INFO L256 TraceCheckUtils]: 3: Hoare triple {27897#true} call #t~ret14 := main(); {27897#true} is VALID [2018-11-23 10:54:36,606 INFO L273 TraceCheckUtils]: 4: Hoare triple {27897#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {27897#true} is VALID [2018-11-23 10:54:36,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {27897#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {27897#true} is VALID [2018-11-23 10:54:36,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {27897#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {27897#true} is VALID [2018-11-23 10:54:36,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {27897#true} assume !(0bv32 != ~p1~0); {27897#true} is VALID [2018-11-23 10:54:36,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {27897#true} assume !(0bv32 != ~p2~0); {27897#true} is VALID [2018-11-23 10:54:36,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {27897#true} assume !(0bv32 != ~p3~0); {27897#true} is VALID [2018-11-23 10:54:36,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {27897#true} assume !(0bv32 != ~p4~0); {27897#true} is VALID [2018-11-23 10:54:36,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {27897#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,612 INFO L273 TraceCheckUtils]: 12: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p8~0); {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p1~0); {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p2~0); {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,616 INFO L273 TraceCheckUtils]: 22: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p3~0); {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p4~0); {27935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:36,617 INFO L273 TraceCheckUtils]: 24: Hoare triple {27935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p5~0); {27898#false} is VALID [2018-11-23 10:54:36,618 INFO L273 TraceCheckUtils]: 25: Hoare triple {27898#false} assume 0bv32 != ~p6~0; {27898#false} is VALID [2018-11-23 10:54:36,618 INFO L273 TraceCheckUtils]: 26: Hoare triple {27898#false} assume 1bv32 != ~lk6~0; {27898#false} is VALID [2018-11-23 10:54:36,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {27898#false} assume !false; {27898#false} is VALID [2018-11-23 10:54:36,619 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 10:54:36,620 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:36,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:36,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:36,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:36,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:36,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:36,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:36,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:36,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:36,651 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2018-11-23 10:54:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,661 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2018-11-23 10:54:37,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:37,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:37,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2018-11-23 10:54:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2018-11-23 10:54:37,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 228 transitions. [2018-11-23 10:54:37,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:37,968 INFO L225 Difference]: With dead ends: 1884 [2018-11-23 10:54:37,968 INFO L226 Difference]: Without dead ends: 1274 [2018-11-23 10:54:37,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 10:54:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-11-23 10:54:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2018-11-23 10:54:38,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:38,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1274 states. Second operand 1272 states. [2018-11-23 10:54:38,744 INFO L74 IsIncluded]: Start isIncluded. First operand 1274 states. Second operand 1272 states. [2018-11-23 10:54:38,744 INFO L87 Difference]: Start difference. First operand 1274 states. Second operand 1272 states. [2018-11-23 10:54:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,804 INFO L93 Difference]: Finished difference Result 1274 states and 2071 transitions. [2018-11-23 10:54:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 2071 transitions. [2018-11-23 10:54:38,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:38,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:38,805 INFO L74 IsIncluded]: Start isIncluded. First operand 1272 states. Second operand 1274 states. [2018-11-23 10:54:38,805 INFO L87 Difference]: Start difference. First operand 1272 states. Second operand 1274 states. [2018-11-23 10:54:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,867 INFO L93 Difference]: Finished difference Result 1274 states and 2071 transitions. [2018-11-23 10:54:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 2071 transitions. [2018-11-23 10:54:38,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:38,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:38,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:38,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-11-23 10:54:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2018-11-23 10:54:38,918 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2018-11-23 10:54:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:38,918 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2018-11-23 10:54:38,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2018-11-23 10:54:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:38,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:38,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:38,920 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:38,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2018-11-23 10:54:38,921 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:38,921 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:38,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:38,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:39,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {33781#true} call ULTIMATE.init(); {33781#true} is VALID [2018-11-23 10:54:39,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {33781#true} assume true; {33781#true} is VALID [2018-11-23 10:54:39,043 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {33781#true} {33781#true} #248#return; {33781#true} is VALID [2018-11-23 10:54:39,044 INFO L256 TraceCheckUtils]: 3: Hoare triple {33781#true} call #t~ret14 := main(); {33781#true} is VALID [2018-11-23 10:54:39,044 INFO L273 TraceCheckUtils]: 4: Hoare triple {33781#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {33781#true} is VALID [2018-11-23 10:54:39,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {33781#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {33781#true} is VALID [2018-11-23 10:54:39,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {33781#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {33781#true} is VALID [2018-11-23 10:54:39,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {33781#true} assume !(0bv32 != ~p1~0); {33781#true} is VALID [2018-11-23 10:54:39,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {33781#true} assume !(0bv32 != ~p2~0); {33781#true} is VALID [2018-11-23 10:54:39,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {33781#true} assume !(0bv32 != ~p3~0); {33781#true} is VALID [2018-11-23 10:54:39,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {33781#true} assume !(0bv32 != ~p4~0); {33781#true} is VALID [2018-11-23 10:54:39,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {33781#true} assume !(0bv32 != ~p5~0); {33781#true} is VALID [2018-11-23 10:54:39,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {33781#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,053 INFO L273 TraceCheckUtils]: 17: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,055 INFO L273 TraceCheckUtils]: 19: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,057 INFO L273 TraceCheckUtils]: 21: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,057 INFO L273 TraceCheckUtils]: 22: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0; {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {33822#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk6~0; {33782#false} is VALID [2018-11-23 10:54:39,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {33782#false} assume !false; {33782#false} is VALID [2018-11-23 10:54:39,062 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 10:54:39,062 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:39,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:39,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:39,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:39,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:39,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:39,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:39,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:39,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:39,093 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2018-11-23 10:54:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,024 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2018-11-23 10:54:40,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:40,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 10:54:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 10:54:40,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2018-11-23 10:54:40,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,385 INFO L225 Difference]: With dead ends: 2316 [2018-11-23 10:54:40,385 INFO L226 Difference]: Without dead ends: 2314 [2018-11-23 10:54:40,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 10:54:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-23 10:54:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2018-11-23 10:54:40,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:40,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2314 states. Second operand 1800 states. [2018-11-23 10:54:40,910 INFO L74 IsIncluded]: Start isIncluded. First operand 2314 states. Second operand 1800 states. [2018-11-23 10:54:40,910 INFO L87 Difference]: Start difference. First operand 2314 states. Second operand 1800 states. [2018-11-23 10:54:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:41,070 INFO L93 Difference]: Finished difference Result 2314 states and 3815 transitions. [2018-11-23 10:54:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3815 transitions. [2018-11-23 10:54:41,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:41,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:41,074 INFO L74 IsIncluded]: Start isIncluded. First operand 1800 states. Second operand 2314 states. [2018-11-23 10:54:41,074 INFO L87 Difference]: Start difference. First operand 1800 states. Second operand 2314 states. [2018-11-23 10:54:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:41,267 INFO L93 Difference]: Finished difference Result 2314 states and 3815 transitions. [2018-11-23 10:54:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3815 transitions. [2018-11-23 10:54:41,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:41,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:41,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:41,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-11-23 10:54:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2018-11-23 10:54:41,379 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2018-11-23 10:54:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:41,379 INFO L480 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2018-11-23 10:54:41,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2018-11-23 10:54:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:41,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:41,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:41,381 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:41,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:41,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2018-11-23 10:54:41,382 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:41,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:41,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:41,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:41,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {42721#true} call ULTIMATE.init(); {42721#true} is VALID [2018-11-23 10:54:41,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {42721#true} assume true; {42721#true} is VALID [2018-11-23 10:54:41,596 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {42721#true} {42721#true} #248#return; {42721#true} is VALID [2018-11-23 10:54:41,596 INFO L256 TraceCheckUtils]: 3: Hoare triple {42721#true} call #t~ret14 := main(); {42721#true} is VALID [2018-11-23 10:54:41,596 INFO L273 TraceCheckUtils]: 4: Hoare triple {42721#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {42721#true} is VALID [2018-11-23 10:54:41,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {42721#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {42721#true} is VALID [2018-11-23 10:54:41,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {42721#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {42721#true} is VALID [2018-11-23 10:54:41,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {42721#true} assume !(0bv32 != ~p1~0); {42721#true} is VALID [2018-11-23 10:54:41,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {42721#true} assume !(0bv32 != ~p2~0); {42721#true} is VALID [2018-11-23 10:54:41,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {42721#true} assume !(0bv32 != ~p3~0); {42721#true} is VALID [2018-11-23 10:54:41,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {42721#true} assume !(0bv32 != ~p4~0); {42721#true} is VALID [2018-11-23 10:54:41,597 INFO L273 TraceCheckUtils]: 11: Hoare triple {42721#true} assume !(0bv32 != ~p5~0); {42721#true} is VALID [2018-11-23 10:54:41,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {42721#true} assume !(0bv32 != ~p6~0); {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p8~0); {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,599 INFO L273 TraceCheckUtils]: 16: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p1~0); {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p2~0); {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p3~0); {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,604 INFO L273 TraceCheckUtils]: 23: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p4~0); {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p5~0); {42762#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:41,605 INFO L273 TraceCheckUtils]: 25: Hoare triple {42762#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p6~0; {42722#false} is VALID [2018-11-23 10:54:41,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {42722#false} assume 1bv32 != ~lk6~0; {42722#false} is VALID [2018-11-23 10:54:41,605 INFO L273 TraceCheckUtils]: 27: Hoare triple {42722#false} assume !false; {42722#false} is VALID [2018-11-23 10:54:41,606 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 10:54:41,606 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:41,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:41,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:41,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:41,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:41,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:41,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:41,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:41,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:41,641 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2018-11-23 10:54:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:43,876 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2018-11-23 10:54:43,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:43,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-23 10:54:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-23 10:54:43,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2018-11-23 10:54:44,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:44,328 INFO L225 Difference]: With dead ends: 4236 [2018-11-23 10:54:44,328 INFO L226 Difference]: Without dead ends: 2474 [2018-11-23 10:54:44,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 10:54:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-11-23 10:54:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2018-11-23 10:54:44,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:44,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2474 states. Second operand 2472 states. [2018-11-23 10:54:44,826 INFO L74 IsIncluded]: Start isIncluded. First operand 2474 states. Second operand 2472 states. [2018-11-23 10:54:44,827 INFO L87 Difference]: Start difference. First operand 2474 states. Second operand 2472 states. [2018-11-23 10:54:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:45,020 INFO L93 Difference]: Finished difference Result 2474 states and 3911 transitions. [2018-11-23 10:54:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3911 transitions. [2018-11-23 10:54:45,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:45,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:45,024 INFO L74 IsIncluded]: Start isIncluded. First operand 2472 states. Second operand 2474 states. [2018-11-23 10:54:45,024 INFO L87 Difference]: Start difference. First operand 2472 states. Second operand 2474 states. [2018-11-23 10:54:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:45,208 INFO L93 Difference]: Finished difference Result 2474 states and 3911 transitions. [2018-11-23 10:54:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3911 transitions. [2018-11-23 10:54:45,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:45,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:45,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:45,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-11-23 10:54:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2018-11-23 10:54:45,397 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2018-11-23 10:54:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:45,397 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2018-11-23 10:54:45,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2018-11-23 10:54:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:54:45,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:45,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:45,399 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:45,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2018-11-23 10:54:45,399 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:45,400 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:45,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:45,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:45,498 INFO L256 TraceCheckUtils]: 0: Hoare triple {54637#true} call ULTIMATE.init(); {54637#true} is VALID [2018-11-23 10:54:45,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {54637#true} assume true; {54637#true} is VALID [2018-11-23 10:54:45,499 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {54637#true} {54637#true} #248#return; {54637#true} is VALID [2018-11-23 10:54:45,499 INFO L256 TraceCheckUtils]: 3: Hoare triple {54637#true} call #t~ret14 := main(); {54637#true} is VALID [2018-11-23 10:54:45,499 INFO L273 TraceCheckUtils]: 4: Hoare triple {54637#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {54637#true} is VALID [2018-11-23 10:54:45,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {54637#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {54637#true} is VALID [2018-11-23 10:54:45,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {54637#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {54637#true} is VALID [2018-11-23 10:54:45,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {54637#true} assume !(0bv32 != ~p1~0); {54637#true} is VALID [2018-11-23 10:54:45,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {54637#true} assume !(0bv32 != ~p2~0); {54637#true} is VALID [2018-11-23 10:54:45,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {54637#true} assume !(0bv32 != ~p3~0); {54637#true} is VALID [2018-11-23 10:54:45,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {54637#true} assume !(0bv32 != ~p4~0); {54637#true} is VALID [2018-11-23 10:54:45,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {54637#true} assume !(0bv32 != ~p5~0); {54637#true} is VALID [2018-11-23 10:54:45,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {54637#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p8~0); {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,504 INFO L273 TraceCheckUtils]: 20: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p1~0); {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,504 INFO L273 TraceCheckUtils]: 21: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p2~0); {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,505 INFO L273 TraceCheckUtils]: 22: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p3~0); {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,505 INFO L273 TraceCheckUtils]: 23: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p4~0); {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,506 INFO L273 TraceCheckUtils]: 24: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p5~0); {54678#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:45,519 INFO L273 TraceCheckUtils]: 25: Hoare triple {54678#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p6~0); {54638#false} is VALID [2018-11-23 10:54:45,520 INFO L273 TraceCheckUtils]: 26: Hoare triple {54638#false} assume 0bv32 != ~p7~0; {54638#false} is VALID [2018-11-23 10:54:45,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {54638#false} assume 1bv32 != ~lk7~0; {54638#false} is VALID [2018-11-23 10:54:45,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {54638#false} assume !false; {54638#false} is VALID [2018-11-23 10:54:45,521 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 10:54:45,521 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:45,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:45,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:45,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:45,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:45,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:45,554 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 10:54:45,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:45,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:45,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:45,555 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2018-11-23 10:54:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,295 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2018-11-23 10:54:47,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:47,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-23 10:54:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-23 10:54:47,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2018-11-23 10:54:47,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:47,836 INFO L225 Difference]: With dead ends: 3708 [2018-11-23 10:54:47,837 INFO L226 Difference]: Without dead ends: 2506 [2018-11-23 10:54:47,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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 10:54:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-23 10:54:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2018-11-23 10:54:48,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:48,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2506 states. Second operand 2504 states. [2018-11-23 10:54:48,613 INFO L74 IsIncluded]: Start isIncluded. First operand 2506 states. Second operand 2504 states. [2018-11-23 10:54:48,613 INFO L87 Difference]: Start difference. First operand 2506 states. Second operand 2504 states. [2018-11-23 10:54:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,842 INFO L93 Difference]: Finished difference Result 2506 states and 3911 transitions. [2018-11-23 10:54:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3911 transitions. [2018-11-23 10:54:48,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:48,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:48,844 INFO L74 IsIncluded]: Start isIncluded. First operand 2504 states. Second operand 2506 states. [2018-11-23 10:54:48,845 INFO L87 Difference]: Start difference. First operand 2504 states. Second operand 2506 states. [2018-11-23 10:54:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,074 INFO L93 Difference]: Finished difference Result 2506 states and 3911 transitions. [2018-11-23 10:54:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3911 transitions. [2018-11-23 10:54:49,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:49,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-11-23 10:54:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2018-11-23 10:54:49,318 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2018-11-23 10:54:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:49,318 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2018-11-23 10:54:49,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2018-11-23 10:54:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:54:49,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:49,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:49,320 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:49,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2018-11-23 10:54:49,321 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:49,321 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:49,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:49,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:49,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {66124#true} call ULTIMATE.init(); {66124#true} is VALID [2018-11-23 10:54:49,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {66124#true} assume true; {66124#true} is VALID [2018-11-23 10:54:49,424 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {66124#true} {66124#true} #248#return; {66124#true} is VALID [2018-11-23 10:54:49,424 INFO L256 TraceCheckUtils]: 3: Hoare triple {66124#true} call #t~ret14 := main(); {66124#true} is VALID [2018-11-23 10:54:49,424 INFO L273 TraceCheckUtils]: 4: Hoare triple {66124#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {66124#true} is VALID [2018-11-23 10:54:49,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {66124#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {66124#true} is VALID [2018-11-23 10:54:49,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {66124#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {66124#true} is VALID [2018-11-23 10:54:49,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {66124#true} assume !(0bv32 != ~p1~0); {66124#true} is VALID [2018-11-23 10:54:49,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {66124#true} assume !(0bv32 != ~p2~0); {66124#true} is VALID [2018-11-23 10:54:49,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {66124#true} assume !(0bv32 != ~p3~0); {66124#true} is VALID [2018-11-23 10:54:49,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {66124#true} assume !(0bv32 != ~p4~0); {66124#true} is VALID [2018-11-23 10:54:49,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {66124#true} assume !(0bv32 != ~p5~0); {66124#true} is VALID [2018-11-23 10:54:49,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {66124#true} assume !(0bv32 != ~p6~0); {66124#true} is VALID [2018-11-23 10:54:49,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {66124#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,430 INFO L273 TraceCheckUtils]: 16: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,434 INFO L273 TraceCheckUtils]: 25: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,434 INFO L273 TraceCheckUtils]: 26: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0; {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:49,435 INFO L273 TraceCheckUtils]: 27: Hoare triple {66168#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk7~0; {66125#false} is VALID [2018-11-23 10:54:49,435 INFO L273 TraceCheckUtils]: 28: Hoare triple {66125#false} assume !false; {66125#false} is VALID [2018-11-23 10:54:49,436 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 10:54:49,436 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:49,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:49,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:49,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:49,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:49,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:49,470 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 10:54:49,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:49,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:49,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:49,471 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2018-11-23 10:54:52,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:52,141 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2018-11-23 10:54:52,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:52,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2018-11-23 10:54:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2018-11-23 10:54:52,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 142 transitions. [2018-11-23 10:54:52,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:53,074 INFO L225 Difference]: With dead ends: 4492 [2018-11-23 10:54:53,074 INFO L226 Difference]: Without dead ends: 4490 [2018-11-23 10:54:53,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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 10:54:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-23 10:54:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2018-11-23 10:54:53,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:53,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4490 states. Second operand 3592 states. [2018-11-23 10:54:53,611 INFO L74 IsIncluded]: Start isIncluded. First operand 4490 states. Second operand 3592 states. [2018-11-23 10:54:53,611 INFO L87 Difference]: Start difference. First operand 4490 states. Second operand 3592 states. [2018-11-23 10:54:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,364 INFO L93 Difference]: Finished difference Result 4490 states and 7111 transitions. [2018-11-23 10:54:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 7111 transitions. [2018-11-23 10:54:54,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:54,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:54,369 INFO L74 IsIncluded]: Start isIncluded. First operand 3592 states. Second operand 4490 states. [2018-11-23 10:54:54,369 INFO L87 Difference]: Start difference. First operand 3592 states. Second operand 4490 states. [2018-11-23 10:54:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:55,118 INFO L93 Difference]: Finished difference Result 4490 states and 7111 transitions. [2018-11-23 10:54:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 7111 transitions. [2018-11-23 10:54:55,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:55,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:55,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:55,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-11-23 10:54:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2018-11-23 10:54:55,664 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2018-11-23 10:54:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:55,664 INFO L480 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2018-11-23 10:54:55,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2018-11-23 10:54:55,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:54:55,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:55,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:55,669 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:55,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:55,670 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2018-11-23 10:54:55,670 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:55,670 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:55,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:55,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:55,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {83483#true} call ULTIMATE.init(); {83483#true} is VALID [2018-11-23 10:54:55,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {83483#true} assume true; {83483#true} is VALID [2018-11-23 10:54:55,781 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {83483#true} {83483#true} #248#return; {83483#true} is VALID [2018-11-23 10:54:55,781 INFO L256 TraceCheckUtils]: 3: Hoare triple {83483#true} call #t~ret14 := main(); {83483#true} is VALID [2018-11-23 10:54:55,781 INFO L273 TraceCheckUtils]: 4: Hoare triple {83483#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {83483#true} is VALID [2018-11-23 10:54:55,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {83483#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {83483#true} is VALID [2018-11-23 10:54:55,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {83483#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {83483#true} is VALID [2018-11-23 10:54:55,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {83483#true} assume !(0bv32 != ~p1~0); {83483#true} is VALID [2018-11-23 10:54:55,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {83483#true} assume !(0bv32 != ~p2~0); {83483#true} is VALID [2018-11-23 10:54:55,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {83483#true} assume !(0bv32 != ~p3~0); {83483#true} is VALID [2018-11-23 10:54:55,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {83483#true} assume !(0bv32 != ~p4~0); {83483#true} is VALID [2018-11-23 10:54:55,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {83483#true} assume !(0bv32 != ~p5~0); {83483#true} is VALID [2018-11-23 10:54:55,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {83483#true} assume !(0bv32 != ~p6~0); {83483#true} is VALID [2018-11-23 10:54:55,783 INFO L273 TraceCheckUtils]: 13: Hoare triple {83483#true} assume !(0bv32 != ~p7~0); {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,783 INFO L273 TraceCheckUtils]: 14: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p8~0); {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,785 INFO L273 TraceCheckUtils]: 16: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,804 INFO L273 TraceCheckUtils]: 19: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p1~0); {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p2~0); {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p3~0); {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p4~0); {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,805 INFO L273 TraceCheckUtils]: 24: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p5~0); {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,806 INFO L273 TraceCheckUtils]: 25: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p6~0); {83527#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:55,807 INFO L273 TraceCheckUtils]: 26: Hoare triple {83527#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p7~0; {83484#false} is VALID [2018-11-23 10:54:55,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {83484#false} assume 1bv32 != ~lk7~0; {83484#false} is VALID [2018-11-23 10:54:55,807 INFO L273 TraceCheckUtils]: 28: Hoare triple {83484#false} assume !false; {83484#false} is VALID [2018-11-23 10:54:55,808 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 10:54:55,808 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:55,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:55,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:55,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:55,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:55,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:55,836 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 10:54:55,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:55,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:55,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:55,837 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2018-11-23 10:54:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,978 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2018-11-23 10:54:59,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:59,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-23 10:54:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-23 10:54:59,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2018-11-23 10:55:00,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:01,306 INFO L225 Difference]: With dead ends: 8396 [2018-11-23 10:55:01,306 INFO L226 Difference]: Without dead ends: 4874 [2018-11-23 10:55:01,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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 10:55:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-11-23 10:55:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2018-11-23 10:55:03,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:03,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4874 states. Second operand 4872 states. [2018-11-23 10:55:03,223 INFO L74 IsIncluded]: Start isIncluded. First operand 4874 states. Second operand 4872 states. [2018-11-23 10:55:03,223 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 4872 states. [2018-11-23 10:55:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:04,061 INFO L93 Difference]: Finished difference Result 4874 states and 7367 transitions. [2018-11-23 10:55:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7367 transitions. [2018-11-23 10:55:04,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:04,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:04,067 INFO L74 IsIncluded]: Start isIncluded. First operand 4872 states. Second operand 4874 states. [2018-11-23 10:55:04,068 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 4874 states. [2018-11-23 10:55:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:04,940 INFO L93 Difference]: Finished difference Result 4874 states and 7367 transitions. [2018-11-23 10:55:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7367 transitions. [2018-11-23 10:55:04,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:04,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:04,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:04,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2018-11-23 10:55:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2018-11-23 10:55:05,914 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2018-11-23 10:55:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:05,914 INFO L480 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2018-11-23 10:55:05,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2018-11-23 10:55:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:55:05,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:05,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:05,919 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:05,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:05,919 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2018-11-23 10:55:05,919 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:05,919 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:55:05,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:05,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:06,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {106922#true} call ULTIMATE.init(); {106922#true} is VALID [2018-11-23 10:55:06,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {106922#true} assume true; {106922#true} is VALID [2018-11-23 10:55:06,043 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106922#true} {106922#true} #248#return; {106922#true} is VALID [2018-11-23 10:55:06,043 INFO L256 TraceCheckUtils]: 3: Hoare triple {106922#true} call #t~ret14 := main(); {106922#true} is VALID [2018-11-23 10:55:06,043 INFO L273 TraceCheckUtils]: 4: Hoare triple {106922#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {106922#true} is VALID [2018-11-23 10:55:06,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {106922#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {106922#true} is VALID [2018-11-23 10:55:06,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {106922#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {106922#true} is VALID [2018-11-23 10:55:06,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {106922#true} assume !(0bv32 != ~p1~0); {106922#true} is VALID [2018-11-23 10:55:06,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {106922#true} assume !(0bv32 != ~p2~0); {106922#true} is VALID [2018-11-23 10:55:06,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {106922#true} assume !(0bv32 != ~p3~0); {106922#true} is VALID [2018-11-23 10:55:06,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {106922#true} assume !(0bv32 != ~p4~0); {106922#true} is VALID [2018-11-23 10:55:06,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {106922#true} assume !(0bv32 != ~p5~0); {106922#true} is VALID [2018-11-23 10:55:06,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {106922#true} assume !(0bv32 != ~p6~0); {106922#true} is VALID [2018-11-23 10:55:06,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {106922#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p8~0); {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p1~0); {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p2~0); {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p3~0); {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,050 INFO L273 TraceCheckUtils]: 23: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p4~0); {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p5~0); {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p6~0); {106966#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:06,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {106966#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p7~0); {106923#false} is VALID [2018-11-23 10:55:06,052 INFO L273 TraceCheckUtils]: 27: Hoare triple {106923#false} assume 0bv32 != ~p8~0; {106923#false} is VALID [2018-11-23 10:55:06,052 INFO L273 TraceCheckUtils]: 28: Hoare triple {106923#false} assume 1bv32 != ~lk8~0; {106923#false} is VALID [2018-11-23 10:55:06,053 INFO L273 TraceCheckUtils]: 29: Hoare triple {106923#false} assume !false; {106923#false} is VALID [2018-11-23 10:55:06,054 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 10:55:06,055 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:06,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:06,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:06,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:55:06,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:06,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:06,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:06,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:06,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:06,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:06,089 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2018-11-23 10:55:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:09,153 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2018-11-23 10:55:09,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:09,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:55:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-23 10:55:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-23 10:55:09,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 222 transitions. [2018-11-23 10:55:09,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:10,364 INFO L225 Difference]: With dead ends: 7308 [2018-11-23 10:55:10,365 INFO L226 Difference]: Without dead ends: 4938 [2018-11-23 10:55:10,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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 10:55:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2018-11-23 10:55:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2018-11-23 10:55:11,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:11,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4938 states. Second operand 4936 states. [2018-11-23 10:55:11,603 INFO L74 IsIncluded]: Start isIncluded. First operand 4938 states. Second operand 4936 states. [2018-11-23 10:55:11,603 INFO L87 Difference]: Start difference. First operand 4938 states. Second operand 4936 states. [2018-11-23 10:55:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:12,494 INFO L93 Difference]: Finished difference Result 4938 states and 7367 transitions. [2018-11-23 10:55:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 7367 transitions. [2018-11-23 10:55:12,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:12,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:12,500 INFO L74 IsIncluded]: Start isIncluded. First operand 4936 states. Second operand 4938 states. [2018-11-23 10:55:12,500 INFO L87 Difference]: Start difference. First operand 4936 states. Second operand 4938 states. [2018-11-23 10:55:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:13,243 INFO L93 Difference]: Finished difference Result 4938 states and 7367 transitions. [2018-11-23 10:55:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 7367 transitions. [2018-11-23 10:55:13,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:13,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:13,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:13,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2018-11-23 10:55:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2018-11-23 10:55:14,126 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2018-11-23 10:55:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:14,126 INFO L480 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2018-11-23 10:55:14,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2018-11-23 10:55:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:55:14,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:14,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:14,129 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:14,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:14,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2018-11-23 10:55:14,129 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:14,129 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:55:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:14,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:14,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {129468#true} call ULTIMATE.init(); {129468#true} is VALID [2018-11-23 10:55:14,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {129468#true} assume true; {129468#true} is VALID [2018-11-23 10:55:14,219 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {129468#true} {129468#true} #248#return; {129468#true} is VALID [2018-11-23 10:55:14,219 INFO L256 TraceCheckUtils]: 3: Hoare triple {129468#true} call #t~ret14 := main(); {129468#true} is VALID [2018-11-23 10:55:14,219 INFO L273 TraceCheckUtils]: 4: Hoare triple {129468#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {129468#true} is VALID [2018-11-23 10:55:14,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {129468#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {129468#true} is VALID [2018-11-23 10:55:14,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {129468#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {129468#true} is VALID [2018-11-23 10:55:14,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {129468#true} assume !(0bv32 != ~p1~0); {129468#true} is VALID [2018-11-23 10:55:14,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {129468#true} assume !(0bv32 != ~p2~0); {129468#true} is VALID [2018-11-23 10:55:14,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {129468#true} assume !(0bv32 != ~p3~0); {129468#true} is VALID [2018-11-23 10:55:14,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {129468#true} assume !(0bv32 != ~p4~0); {129468#true} is VALID [2018-11-23 10:55:14,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {129468#true} assume !(0bv32 != ~p5~0); {129468#true} is VALID [2018-11-23 10:55:14,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {129468#true} assume !(0bv32 != ~p6~0); {129468#true} is VALID [2018-11-23 10:55:14,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {129468#true} assume !(0bv32 != ~p7~0); {129468#true} is VALID [2018-11-23 10:55:14,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {129468#true} assume !(0bv32 != ~p8~0); {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p1~0); {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p2~0); {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,227 INFO L273 TraceCheckUtils]: 22: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p3~0); {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,227 INFO L273 TraceCheckUtils]: 23: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p4~0); {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,227 INFO L273 TraceCheckUtils]: 24: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p5~0); {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,228 INFO L273 TraceCheckUtils]: 25: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p6~0); {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,228 INFO L273 TraceCheckUtils]: 26: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p7~0); {129515#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:14,228 INFO L273 TraceCheckUtils]: 27: Hoare triple {129515#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p8~0; {129469#false} is VALID [2018-11-23 10:55:14,229 INFO L273 TraceCheckUtils]: 28: Hoare triple {129469#false} assume 1bv32 != ~lk8~0; {129469#false} is VALID [2018-11-23 10:55:14,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {129469#false} assume !false; {129469#false} is VALID [2018-11-23 10:55:14,229 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 10:55:14,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:14,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:14,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:14,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:55:14,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:14,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:14,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:14,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:14,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:14,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:14,261 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2018-11-23 10:55:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:26,818 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2018-11-23 10:55:26,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:26,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:55:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-23 10:55:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-23 10:55:26,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2018-11-23 10:55:27,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:30,865 INFO L225 Difference]: With dead ends: 14412 [2018-11-23 10:55:30,866 INFO L226 Difference]: Without dead ends: 9610 [2018-11-23 10:55:30,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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 10:55:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-11-23 10:55:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2018-11-23 10:55:33,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:33,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9610 states. Second operand 9608 states. [2018-11-23 10:55:33,637 INFO L74 IsIncluded]: Start isIncluded. First operand 9610 states. Second operand 9608 states. [2018-11-23 10:55:33,637 INFO L87 Difference]: Start difference. First operand 9610 states. Second operand 9608 states. [2018-11-23 10:55:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:36,939 INFO L93 Difference]: Finished difference Result 9610 states and 13959 transitions. [2018-11-23 10:55:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9610 states and 13959 transitions. [2018-11-23 10:55:36,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:36,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:36,946 INFO L74 IsIncluded]: Start isIncluded. First operand 9608 states. Second operand 9610 states. [2018-11-23 10:55:36,946 INFO L87 Difference]: Start difference. First operand 9608 states. Second operand 9610 states. [2018-11-23 10:55:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:40,430 INFO L93 Difference]: Finished difference Result 9610 states and 13959 transitions. [2018-11-23 10:55:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 9610 states and 13959 transitions. [2018-11-23 10:55:40,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:40,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:40,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:40,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-23 10:55:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2018-11-23 10:55:44,377 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2018-11-23 10:55:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:44,377 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2018-11-23 10:55:44,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2018-11-23 10:55:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:55:44,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:44,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:44,381 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:44,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2018-11-23 10:55:44,381 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:44,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:55:44,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:44,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:44,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {173454#true} call ULTIMATE.init(); {173454#true} is VALID [2018-11-23 10:55:44,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {173454#true} assume true; {173454#true} is VALID [2018-11-23 10:55:44,490 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {173454#true} {173454#true} #248#return; {173454#true} is VALID [2018-11-23 10:55:44,490 INFO L256 TraceCheckUtils]: 3: Hoare triple {173454#true} call #t~ret14 := main(); {173454#true} is VALID [2018-11-23 10:55:44,490 INFO L273 TraceCheckUtils]: 4: Hoare triple {173454#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {173454#true} is VALID [2018-11-23 10:55:44,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {173454#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {173454#true} is VALID [2018-11-23 10:55:44,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {173454#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {173454#true} is VALID [2018-11-23 10:55:44,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {173454#true} assume !(0bv32 != ~p1~0); {173454#true} is VALID [2018-11-23 10:55:44,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {173454#true} assume !(0bv32 != ~p2~0); {173454#true} is VALID [2018-11-23 10:55:44,491 INFO L273 TraceCheckUtils]: 9: Hoare triple {173454#true} assume !(0bv32 != ~p3~0); {173454#true} is VALID [2018-11-23 10:55:44,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {173454#true} assume !(0bv32 != ~p4~0); {173454#true} is VALID [2018-11-23 10:55:44,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {173454#true} assume !(0bv32 != ~p5~0); {173454#true} is VALID [2018-11-23 10:55:44,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {173454#true} assume !(0bv32 != ~p6~0); {173454#true} is VALID [2018-11-23 10:55:44,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {173454#true} assume !(0bv32 != ~p7~0); {173454#true} is VALID [2018-11-23 10:55:44,492 INFO L273 TraceCheckUtils]: 14: Hoare triple {173454#true} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,493 INFO L273 TraceCheckUtils]: 16: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,494 INFO L273 TraceCheckUtils]: 18: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,494 INFO L273 TraceCheckUtils]: 19: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,497 INFO L273 TraceCheckUtils]: 22: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0; {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:44,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {173501#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk8~0; {173455#false} is VALID [2018-11-23 10:55:44,499 INFO L273 TraceCheckUtils]: 29: Hoare triple {173455#false} assume !false; {173455#false} is VALID [2018-11-23 10:55:44,500 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 10:55:44,500 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:44,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:44,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:44,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:55:44,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:44,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:44,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:44,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:44,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:44,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:44,537 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2018-11-23 10:55:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:54,015 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2018-11-23 10:55:54,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:54,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:55:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-23 10:55:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-23 10:55:54,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2018-11-23 10:55:54,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:58,795 INFO L225 Difference]: With dead ends: 11148 [2018-11-23 10:55:58,796 INFO L226 Difference]: Without dead ends: 11146 [2018-11-23 10:55:58,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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 10:55:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-11-23 10:56:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2018-11-23 10:56:04,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:56:04,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11146 states. Second operand 9608 states. [2018-11-23 10:56:04,005 INFO L74 IsIncluded]: Start isIncluded. First operand 11146 states. Second operand 9608 states. [2018-11-23 10:56:04,006 INFO L87 Difference]: Start difference. First operand 11146 states. Second operand 9608 states. [2018-11-23 10:56:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:07,651 INFO L93 Difference]: Finished difference Result 11146 states and 16647 transitions. [2018-11-23 10:56:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 11146 states and 16647 transitions. [2018-11-23 10:56:07,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:07,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:07,660 INFO L74 IsIncluded]: Start isIncluded. First operand 9608 states. Second operand 11146 states. [2018-11-23 10:56:07,660 INFO L87 Difference]: Start difference. First operand 9608 states. Second operand 11146 states. [2018-11-23 10:56:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:11,460 INFO L93 Difference]: Finished difference Result 11146 states and 16647 transitions. [2018-11-23 10:56:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 11146 states and 16647 transitions. [2018-11-23 10:56:11,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:11,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:11,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:56:11,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:56:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-23 10:56:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2018-11-23 10:56:15,074 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2018-11-23 10:56:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:56:15,074 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2018-11-23 10:56:15,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:56:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2018-11-23 10:56:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 10:56:15,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:56:15,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:56:15,078 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:56:15,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:56:15,079 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2018-11-23 10:56:15,079 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:56:15,079 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:56:15,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:56:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:15,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:56:15,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {217248#true} call ULTIMATE.init(); {217248#true} is VALID [2018-11-23 10:56:15,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {217248#true} assume true; {217248#true} is VALID [2018-11-23 10:56:15,270 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {217248#true} {217248#true} #248#return; {217248#true} is VALID [2018-11-23 10:56:15,271 INFO L256 TraceCheckUtils]: 3: Hoare triple {217248#true} call #t~ret14 := main(); {217248#true} is VALID [2018-11-23 10:56:15,271 INFO L273 TraceCheckUtils]: 4: Hoare triple {217248#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {217248#true} is VALID [2018-11-23 10:56:15,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {217248#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {217248#true} is VALID [2018-11-23 10:56:15,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {217248#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {217248#true} is VALID [2018-11-23 10:56:15,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {217248#true} assume !(0bv32 != ~p1~0); {217248#true} is VALID [2018-11-23 10:56:15,272 INFO L273 TraceCheckUtils]: 8: Hoare triple {217248#true} assume !(0bv32 != ~p2~0); {217248#true} is VALID [2018-11-23 10:56:15,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {217248#true} assume !(0bv32 != ~p3~0); {217248#true} is VALID [2018-11-23 10:56:15,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {217248#true} assume !(0bv32 != ~p4~0); {217248#true} is VALID [2018-11-23 10:56:15,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {217248#true} assume !(0bv32 != ~p5~0); {217248#true} is VALID [2018-11-23 10:56:15,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {217248#true} assume !(0bv32 != ~p6~0); {217248#true} is VALID [2018-11-23 10:56:15,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {217248#true} assume !(0bv32 != ~p7~0); {217248#true} is VALID [2018-11-23 10:56:15,273 INFO L273 TraceCheckUtils]: 14: Hoare triple {217248#true} assume !(0bv32 != ~p8~0); {217248#true} is VALID [2018-11-23 10:56:15,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {217248#true} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,273 INFO L273 TraceCheckUtils]: 16: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,274 INFO L273 TraceCheckUtils]: 17: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,274 INFO L273 TraceCheckUtils]: 18: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,275 INFO L273 TraceCheckUtils]: 20: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,275 INFO L273 TraceCheckUtils]: 21: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,276 INFO L273 TraceCheckUtils]: 23: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0; {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:15,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {217298#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk9~0; {217249#false} is VALID [2018-11-23 10:56:15,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {217249#false} assume !false; {217249#false} is VALID [2018-11-23 10:56:15,280 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 10:56:15,280 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:56:15,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:56:15,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:56:15,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:56:15,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:56:15,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:56:15,456 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 10:56:15,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:56:15,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:56:15,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:56:15,457 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2018-11-23 10:56:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:40,970 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2018-11-23 10:56:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:56:40,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:56:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:56:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 10:56:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 10:56:40,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 10:56:41,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:56:53,904 INFO L225 Difference]: With dead ends: 16780 [2018-11-23 10:56:53,904 INFO L226 Difference]: Without dead ends: 16778 [2018-11-23 10:56:53,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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 10:56:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2018-11-23 10:56:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2018-11-23 10:56:58,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:56:58,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16778 states. Second operand 14216 states. [2018-11-23 10:56:58,788 INFO L74 IsIncluded]: Start isIncluded. First operand 16778 states. Second operand 14216 states. [2018-11-23 10:56:58,788 INFO L87 Difference]: Start difference. First operand 16778 states. Second operand 14216 states. [2018-11-23 10:57:13,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:57:13,723 INFO L93 Difference]: Finished difference Result 16778 states and 24455 transitions. [2018-11-23 10:57:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 16778 states and 24455 transitions. [2018-11-23 10:57:13,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:57:13,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:57:13,734 INFO L74 IsIncluded]: Start isIncluded. First operand 14216 states. Second operand 16778 states. [2018-11-23 10:57:13,735 INFO L87 Difference]: Start difference. First operand 14216 states. Second operand 16778 states. [2018-11-23 10:57:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:57:27,392 INFO L93 Difference]: Finished difference Result 16778 states and 24455 transitions. [2018-11-23 10:57:27,392 INFO L276 IsEmpty]: Start isEmpty. Operand 16778 states and 24455 transitions. [2018-11-23 10:57:27,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:57:27,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:57:27,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:57:27,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:57:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-11-23 10:57:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2018-11-23 10:57:40,450 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2018-11-23 10:57:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:57:40,450 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2018-11-23 10:57:40,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:57:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2018-11-23 10:57:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 10:57:40,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:57:40,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:57:40,458 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:57:40,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:57:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2018-11-23 10:57:40,458 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:57:40,458 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:57:40,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:57:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:57:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:57:40,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:57:40,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {282677#true} call ULTIMATE.init(); {282677#true} is VALID [2018-11-23 10:57:40,564 INFO L273 TraceCheckUtils]: 1: Hoare triple {282677#true} assume true; {282677#true} is VALID [2018-11-23 10:57:40,564 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {282677#true} {282677#true} #248#return; {282677#true} is VALID [2018-11-23 10:57:40,564 INFO L256 TraceCheckUtils]: 3: Hoare triple {282677#true} call #t~ret14 := main(); {282677#true} is VALID [2018-11-23 10:57:40,564 INFO L273 TraceCheckUtils]: 4: Hoare triple {282677#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {282677#true} is VALID [2018-11-23 10:57:40,564 INFO L273 TraceCheckUtils]: 5: Hoare triple {282677#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {282677#true} is VALID [2018-11-23 10:57:40,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {282677#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {282677#true} is VALID [2018-11-23 10:57:40,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {282677#true} assume !(0bv32 != ~p1~0); {282677#true} is VALID [2018-11-23 10:57:40,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {282677#true} assume !(0bv32 != ~p2~0); {282677#true} is VALID [2018-11-23 10:57:40,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {282677#true} assume !(0bv32 != ~p3~0); {282677#true} is VALID [2018-11-23 10:57:40,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {282677#true} assume !(0bv32 != ~p4~0); {282677#true} is VALID [2018-11-23 10:57:40,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {282677#true} assume !(0bv32 != ~p5~0); {282677#true} is VALID [2018-11-23 10:57:40,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {282677#true} assume !(0bv32 != ~p6~0); {282677#true} is VALID [2018-11-23 10:57:40,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {282677#true} assume !(0bv32 != ~p7~0); {282677#true} is VALID [2018-11-23 10:57:40,565 INFO L273 TraceCheckUtils]: 14: Hoare triple {282677#true} assume !(0bv32 != ~p8~0); {282677#true} is VALID [2018-11-23 10:57:40,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {282677#true} assume !(0bv32 != ~p9~0); {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,589 INFO L273 TraceCheckUtils]: 18: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,589 INFO L273 TraceCheckUtils]: 19: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,590 INFO L273 TraceCheckUtils]: 20: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p1~0); {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p2~0); {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,591 INFO L273 TraceCheckUtils]: 22: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p3~0); {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p4~0); {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p5~0); {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p6~0); {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p7~0); {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p8~0); {282727#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:40,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {282727#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p9~0; {282678#false} is VALID [2018-11-23 10:57:40,593 INFO L273 TraceCheckUtils]: 29: Hoare triple {282678#false} assume 1bv32 != ~lk9~0; {282678#false} is VALID [2018-11-23 10:57:40,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {282678#false} assume !false; {282678#false} is VALID [2018-11-23 10:57:40,594 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 10:57:40,594 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:57:40,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:57:40,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:57:40,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:57:40,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:57:40,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:57:40,624 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 10:57:40,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:57:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:57:40,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:57:40,625 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states.