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_11_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:53:45,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:53:45,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:53:45,033 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:53:45,033 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:53:45,034 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:53:45,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:53:45,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:53:45,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:53:45,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:53:45,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:53:45,041 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:53:45,042 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:53:45,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:53:45,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:53:45,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:53:45,046 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:53:45,048 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:53:45,050 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:53:45,052 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:53:45,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:53:45,054 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:53:45,057 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:53:45,057 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:53:45,057 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:53:45,058 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:53:45,060 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:53:45,060 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:53:45,061 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:53:45,062 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:53:45,063 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:53:45,063 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:53:45,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:53:45,064 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:53:45,065 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:53:45,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:53:45,066 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:53:45,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:53:45,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:53:45,083 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:53:45,083 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:53:45,084 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:53:45,084 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:53:45,084 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:53:45,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:53:45,085 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:53:45,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:53:45,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:53:45,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:53:45,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:53:45,086 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:53:45,086 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:53:45,086 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:53:45,086 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:53:45,086 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:53:45,087 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:53:45,087 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:53:45,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:53:45,087 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:53:45,087 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:53:45,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:53:45,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:53:45,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:53:45,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:53:45,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:53:45,089 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:53:45,089 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:53:45,089 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:53:45,089 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:53:45,089 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:53:45,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:53:45,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:53:45,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:53:45,159 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:53:45,159 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:53:45,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:53:45,222 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65ba4aa6/033000fd1c4e4055a57989ec1590ff39/FLAGbad4a3b0f [2018-11-23 10:53:45,733 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:53:45,734 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:53:45,743 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65ba4aa6/033000fd1c4e4055a57989ec1590ff39/FLAGbad4a3b0f [2018-11-23 10:53:46,070 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65ba4aa6/033000fd1c4e4055a57989ec1590ff39 [2018-11-23 10:53:46,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:53:46,083 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:53:46,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:53:46,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:53:46,088 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:53:46,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:53:46" (1/1) ... [2018-11-23 10:53:46,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50669a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46, skipping insertion in model container [2018-11-23 10:53:46,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:53:46" (1/1) ... [2018-11-23 10:53:46,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:53:46,133 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:53:46,392 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:53:46,398 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:53:46,435 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:53:46,452 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:53:46,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46 WrapperNode [2018-11-23 10:53:46,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:53:46,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:53:46,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:53:46,454 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:53:46,464 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:53:46" (1/1) ... [2018-11-23 10:53:46,473 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:53:46" (1/1) ... [2018-11-23 10:53:46,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:53:46,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:53:46,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:53:46,482 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:53:46,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46" (1/1) ... [2018-11-23 10:53:46,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46" (1/1) ... [2018-11-23 10:53:46,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46" (1/1) ... [2018-11-23 10:53:46,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46" (1/1) ... [2018-11-23 10:53:46,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46" (1/1) ... [2018-11-23 10:53:46,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46" (1/1) ... [2018-11-23 10:53:46,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46" (1/1) ... [2018-11-23 10:53:46,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:53:46,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:53:46,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:53:46,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:53:46,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46" (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:53:46,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:53:46,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:53:46,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:53:46,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:53:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:53:46,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:53:47,664 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:53:47,664 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:53:47,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:53:47 BoogieIcfgContainer [2018-11-23 10:53:47,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:53:47,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:53:47,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:53:47,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:53:47,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:53:46" (1/3) ... [2018-11-23 10:53:47,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771e86b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:53:47, skipping insertion in model container [2018-11-23 10:53:47,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:46" (2/3) ... [2018-11-23 10:53:47,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771e86b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:53:47, skipping insertion in model container [2018-11-23 10:53:47,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:53:47" (3/3) ... [2018-11-23 10:53:47,673 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:53:47,684 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:53:47,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:53:47,708 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:53:47,742 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:53:47,743 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:53:47,743 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:53:47,743 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:53:47,744 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:53:47,744 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:53:47,744 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:53:47,744 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:53:47,745 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:53:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-23 10:53:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:53:47,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:47,772 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] [2018-11-23 10:53:47,775 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:47,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:47,781 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2018-11-23 10:53:47,785 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:47,786 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:53:47,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:47,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:48,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {50#true} is VALID [2018-11-23 10:53:48,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {50#true} assume true; {50#true} is VALID [2018-11-23 10:53:48,323 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {50#true} {50#true} #214#return; {50#true} is VALID [2018-11-23 10:53:48,323 INFO L256 TraceCheckUtils]: 3: Hoare triple {50#true} call #t~ret12 := main(); {50#true} is VALID [2018-11-23 10:53:48,323 INFO L273 TraceCheckUtils]: 4: Hoare triple {50#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;havoc ~cond~0; {50#true} is VALID [2018-11-23 10:53:48,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {50#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {50#true} is VALID [2018-11-23 10:53:48,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {50#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; {50#true} is VALID [2018-11-23 10:53:48,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {50#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,344 INFO L273 TraceCheckUtils]: 17: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,345 INFO L273 TraceCheckUtils]: 18: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:48,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {76#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {51#false} is VALID [2018-11-23 10:53:48,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {51#false} assume !false; {51#false} is VALID [2018-11-23 10:53:48,363 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:53:48,363 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:48,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:48,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:48,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:53:48,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:48,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:48,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:48,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:48,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:48,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:48,576 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-11-23 10:53:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:49,527 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2018-11-23 10:53:49,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:49,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:53:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 10:53:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 10:53:49,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2018-11-23 10:53:50,017 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:53:50,038 INFO L225 Difference]: With dead ends: 93 [2018-11-23 10:53:50,039 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 10:53:50,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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:53:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 10:53:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-11-23 10:53:50,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:50,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 54 states. [2018-11-23 10:53:50,088 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 54 states. [2018-11-23 10:53:50,089 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 54 states. [2018-11-23 10:53:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:50,099 INFO L93 Difference]: Finished difference Result 78 states and 140 transitions. [2018-11-23 10:53:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 140 transitions. [2018-11-23 10:53:50,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:50,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:50,101 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 78 states. [2018-11-23 10:53:50,102 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 78 states. [2018-11-23 10:53:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:50,110 INFO L93 Difference]: Finished difference Result 78 states and 140 transitions. [2018-11-23 10:53:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 140 transitions. [2018-11-23 10:53:50,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:50,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:50,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:50,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 10:53:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-11-23 10:53:50,121 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2018-11-23 10:53:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:50,121 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2018-11-23 10:53:50,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2018-11-23 10:53:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:53:50,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:50,124 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] [2018-11-23 10:53:50,126 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:50,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:50,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2018-11-23 10:53:50,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:50,127 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:53:50,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:50,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:50,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {436#true} call ULTIMATE.init(); {436#true} is VALID [2018-11-23 10:53:50,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {436#true} assume true; {436#true} is VALID [2018-11-23 10:53:50,372 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {436#true} {436#true} #214#return; {436#true} is VALID [2018-11-23 10:53:50,372 INFO L256 TraceCheckUtils]: 3: Hoare triple {436#true} call #t~ret12 := main(); {436#true} is VALID [2018-11-23 10:53:50,372 INFO L273 TraceCheckUtils]: 4: Hoare triple {436#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;havoc ~cond~0; {436#true} is VALID [2018-11-23 10:53:50,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {436#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {436#true} is VALID [2018-11-23 10:53:50,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {436#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; {436#true} is VALID [2018-11-23 10:53:50,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {436#true} assume !(0bv32 != ~p1~0); {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,376 INFO L273 TraceCheckUtils]: 9: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,376 INFO L273 TraceCheckUtils]: 10: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume !(0bv32 != ~p8~0); {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {462#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:50,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {462#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {437#false} is VALID [2018-11-23 10:53:50,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {437#false} assume 1bv32 != ~lk1~0; {437#false} is VALID [2018-11-23 10:53:50,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {437#false} assume !false; {437#false} is VALID [2018-11-23 10:53:50,398 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:53:50,398 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:50,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:50,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:50,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:53:50,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:50,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:50,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:50,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:50,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:50,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:50,462 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2018-11-23 10:53:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:50,869 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2018-11-23 10:53:50,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:50,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:53:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2018-11-23 10:53:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2018-11-23 10:53:50,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 209 transitions. [2018-11-23 10:53:51,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:51,288 INFO L225 Difference]: With dead ends: 127 [2018-11-23 10:53:51,289 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 10:53:51,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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:53:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 10:53:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-23 10:53:51,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:51,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-23 10:53:51,336 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-23 10:53:51,336 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-23 10:53:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:51,342 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2018-11-23 10:53:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 138 transitions. [2018-11-23 10:53:51,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:51,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:51,343 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-23 10:53:51,344 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-23 10:53:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:51,349 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2018-11-23 10:53:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 138 transitions. [2018-11-23 10:53:51,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:51,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:51,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:51,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 10:53:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2018-11-23 10:53:51,356 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2018-11-23 10:53:51,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:51,357 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2018-11-23 10:53:51,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2018-11-23 10:53:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:53:51,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:51,358 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] [2018-11-23 10:53:51,359 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:51,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2018-11-23 10:53:51,360 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:51,360 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:53:51,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:51,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:51,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2018-11-23 10:53:51,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {877#true} assume true; {877#true} is VALID [2018-11-23 10:53:51,495 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {877#true} {877#true} #214#return; {877#true} is VALID [2018-11-23 10:53:51,495 INFO L256 TraceCheckUtils]: 3: Hoare triple {877#true} call #t~ret12 := main(); {877#true} is VALID [2018-11-23 10:53:51,496 INFO L273 TraceCheckUtils]: 4: Hoare triple {877#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;havoc ~cond~0; {877#true} is VALID [2018-11-23 10:53:51,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {877#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {877#true} is VALID [2018-11-23 10:53:51,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {877#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; {877#true} is VALID [2018-11-23 10:53:51,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {877#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p8~0); {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {903#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:51,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {903#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {878#false} is VALID [2018-11-23 10:53:51,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {878#false} assume 0bv32 != ~p2~0; {878#false} is VALID [2018-11-23 10:53:51,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {878#false} assume 1bv32 != ~lk2~0; {878#false} is VALID [2018-11-23 10:53:51,512 INFO L273 TraceCheckUtils]: 21: Hoare triple {878#false} assume !false; {878#false} is VALID [2018-11-23 10:53:51,515 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:53:51,515 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:51,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:51,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:51,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:51,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:51,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:51,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:51,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:51,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:51,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:51,579 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2018-11-23 10:53:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:51,878 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2018-11-23 10:53:51,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:51,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2018-11-23 10:53:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2018-11-23 10:53:51,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2018-11-23 10:53:52,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:52,214 INFO L225 Difference]: With dead ends: 117 [2018-11-23 10:53:52,215 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 10:53:52,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:53:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 10:53:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-23 10:53:52,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:52,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 79 states. [2018-11-23 10:53:52,237 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 79 states. [2018-11-23 10:53:52,237 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 79 states. [2018-11-23 10:53:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:52,242 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2018-11-23 10:53:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 140 transitions. [2018-11-23 10:53:52,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:52,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:52,244 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 81 states. [2018-11-23 10:53:52,244 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 81 states. [2018-11-23 10:53:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:52,249 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2018-11-23 10:53:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 140 transitions. [2018-11-23 10:53:52,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:52,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:52,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:52,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 10:53:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2018-11-23 10:53:52,260 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2018-11-23 10:53:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:52,261 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2018-11-23 10:53:52,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2018-11-23 10:53:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:53:52,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:52,262 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] [2018-11-23 10:53:52,262 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:52,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:52,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2018-11-23 10:53:52,265 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:52,265 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:53:52,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:52,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:52,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {1322#true} call ULTIMATE.init(); {1322#true} is VALID [2018-11-23 10:53:52,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {1322#true} assume true; {1322#true} is VALID [2018-11-23 10:53:52,404 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1322#true} {1322#true} #214#return; {1322#true} is VALID [2018-11-23 10:53:52,404 INFO L256 TraceCheckUtils]: 3: Hoare triple {1322#true} call #t~ret12 := main(); {1322#true} is VALID [2018-11-23 10:53:52,405 INFO L273 TraceCheckUtils]: 4: Hoare triple {1322#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;havoc ~cond~0; {1322#true} is VALID [2018-11-23 10:53:52,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {1322#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {1322#true} is VALID [2018-11-23 10:53:52,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {1322#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; {1322#true} is VALID [2018-11-23 10:53:52,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {1322#true} assume !(0bv32 != ~p1~0); {1322#true} is VALID [2018-11-23 10:53:52,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {1322#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,411 INFO L273 TraceCheckUtils]: 17: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:52,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {1351#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {1323#false} is VALID [2018-11-23 10:53:52,414 INFO L273 TraceCheckUtils]: 21: Hoare triple {1323#false} assume !false; {1323#false} is VALID [2018-11-23 10:53:52,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:53:52,416 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:52,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:52,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:52,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:52,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:52,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:52,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:52,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:52,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:52,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:52,451 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2018-11-23 10:53:52,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:52,685 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2018-11-23 10:53:52,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:52,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 10:53:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 10:53:52,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2018-11-23 10:53:52,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:52,919 INFO L225 Difference]: With dead ends: 148 [2018-11-23 10:53:52,920 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 10:53:52,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:53:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 10:53:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-11-23 10:53:52,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:52,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 104 states. [2018-11-23 10:53:52,944 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 104 states. [2018-11-23 10:53:52,944 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 104 states. [2018-11-23 10:53:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:52,951 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2018-11-23 10:53:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 261 transitions. [2018-11-23 10:53:52,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:52,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:52,953 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 146 states. [2018-11-23 10:53:52,953 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 146 states. [2018-11-23 10:53:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:52,961 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2018-11-23 10:53:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 261 transitions. [2018-11-23 10:53:52,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:52,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:52,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:52,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 10:53:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2018-11-23 10:53:52,968 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2018-11-23 10:53:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:52,968 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2018-11-23 10:53:52,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2018-11-23 10:53:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:53:52,970 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:52,970 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] [2018-11-23 10:53:52,970 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:52,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2018-11-23 10:53:52,971 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:52,971 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:53:52,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:53,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:53,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {1954#true} call ULTIMATE.init(); {1954#true} is VALID [2018-11-23 10:53:53,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {1954#true} assume true; {1954#true} is VALID [2018-11-23 10:53:53,084 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1954#true} {1954#true} #214#return; {1954#true} is VALID [2018-11-23 10:53:53,085 INFO L256 TraceCheckUtils]: 3: Hoare triple {1954#true} call #t~ret12 := main(); {1954#true} is VALID [2018-11-23 10:53:53,085 INFO L273 TraceCheckUtils]: 4: Hoare triple {1954#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;havoc ~cond~0; {1954#true} is VALID [2018-11-23 10:53:53,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {1954#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {1954#true} is VALID [2018-11-23 10:53:53,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {1954#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; {1954#true} is VALID [2018-11-23 10:53:53,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {1954#true} assume !(0bv32 != ~p1~0); {1954#true} is VALID [2018-11-23 10:53:53,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {1954#true} assume !(0bv32 != ~p2~0); {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,093 INFO L273 TraceCheckUtils]: 12: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p8~0); {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,099 INFO L273 TraceCheckUtils]: 15: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {1983#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:53,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {1983#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {1955#false} is VALID [2018-11-23 10:53:53,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {1955#false} assume 1bv32 != ~lk2~0; {1955#false} is VALID [2018-11-23 10:53:53,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {1955#false} assume !false; {1955#false} is VALID [2018-11-23 10:53:53,103 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:53:53,103 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:53,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:53,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:53,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:53,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:53,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:53,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:53,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:53,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:53,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:53,147 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2018-11-23 10:53:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:53,391 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2018-11-23 10:53:53,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:53,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:53,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2018-11-23 10:53:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2018-11-23 10:53:53,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 206 transitions. [2018-11-23 10:53:53,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:53,885 INFO L225 Difference]: With dead ends: 244 [2018-11-23 10:53:53,885 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 10:53:53,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:53:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 10:53:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-23 10:53:53,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:53,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2018-11-23 10:53:53,934 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2018-11-23 10:53:53,934 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2018-11-23 10:53:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:53,941 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2018-11-23 10:53:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 259 transitions. [2018-11-23 10:53:53,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:53,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:53,943 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2018-11-23 10:53:53,943 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2018-11-23 10:53:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:53,949 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2018-11-23 10:53:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 259 transitions. [2018-11-23 10:53:53,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:53,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:53,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:53,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 10:53:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2018-11-23 10:53:53,956 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2018-11-23 10:53:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:53,957 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2018-11-23 10:53:53,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2018-11-23 10:53:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:53:53,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:53,958 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:53:53,958 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:53,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2018-11-23 10:53:53,959 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:53,959 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:53:53,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:54,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:54,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {2732#true} call ULTIMATE.init(); {2732#true} is VALID [2018-11-23 10:53:54,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {2732#true} assume true; {2732#true} is VALID [2018-11-23 10:53:54,077 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2732#true} {2732#true} #214#return; {2732#true} is VALID [2018-11-23 10:53:54,077 INFO L256 TraceCheckUtils]: 3: Hoare triple {2732#true} call #t~ret12 := main(); {2732#true} is VALID [2018-11-23 10:53:54,077 INFO L273 TraceCheckUtils]: 4: Hoare triple {2732#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;havoc ~cond~0; {2732#true} is VALID [2018-11-23 10:53:54,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {2732#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {2732#true} is VALID [2018-11-23 10:53:54,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {2732#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; {2732#true} is VALID [2018-11-23 10:53:54,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {2732#true} assume !(0bv32 != ~p1~0); {2732#true} is VALID [2018-11-23 10:53:54,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {2732#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,099 INFO L273 TraceCheckUtils]: 14: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p8~0); {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,101 INFO L273 TraceCheckUtils]: 16: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,102 INFO L273 TraceCheckUtils]: 17: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,102 INFO L273 TraceCheckUtils]: 18: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {2761#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:54,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {2761#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {2733#false} is VALID [2018-11-23 10:53:54,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {2733#false} assume 0bv32 != ~p3~0; {2733#false} is VALID [2018-11-23 10:53:54,108 INFO L273 TraceCheckUtils]: 21: Hoare triple {2733#false} assume 1bv32 != ~lk3~0; {2733#false} is VALID [2018-11-23 10:53:54,108 INFO L273 TraceCheckUtils]: 22: Hoare triple {2733#false} assume !false; {2733#false} is VALID [2018-11-23 10:53:54,110 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:53:54,110 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:54,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:54,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:54,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:54,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:54,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:54,140 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:53:54,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:54,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:54,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:54,141 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2018-11-23 10:53:54,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:54,437 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2018-11-23 10:53:54,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:54,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:54,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2018-11-23 10:53:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2018-11-23 10:53:54,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2018-11-23 10:53:54,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:54,835 INFO L225 Difference]: With dead ends: 219 [2018-11-23 10:53:54,835 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 10:53:54,836 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:53:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 10:53:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-23 10:53:54,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:54,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 148 states. [2018-11-23 10:53:54,860 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 148 states. [2018-11-23 10:53:54,860 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 148 states. [2018-11-23 10:53:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:54,866 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2018-11-23 10:53:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 259 transitions. [2018-11-23 10:53:54,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:54,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:54,867 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 150 states. [2018-11-23 10:53:54,867 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 150 states. [2018-11-23 10:53:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:54,873 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2018-11-23 10:53:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 259 transitions. [2018-11-23 10:53:54,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:54,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:54,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:54,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 10:53:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2018-11-23 10:53:54,880 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2018-11-23 10:53:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:54,881 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2018-11-23 10:53:54,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2018-11-23 10:53:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:53:54,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:54,882 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:53:54,882 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:54,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2018-11-23 10:53:54,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:54,883 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:53:54,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:54,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:55,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {3494#true} call ULTIMATE.init(); {3494#true} is VALID [2018-11-23 10:53:55,504 INFO L273 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2018-11-23 10:53:55,505 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #214#return; {3494#true} is VALID [2018-11-23 10:53:55,505 INFO L256 TraceCheckUtils]: 3: Hoare triple {3494#true} call #t~ret12 := main(); {3494#true} is VALID [2018-11-23 10:53:55,505 INFO L273 TraceCheckUtils]: 4: Hoare triple {3494#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;havoc ~cond~0; {3494#true} is VALID [2018-11-23 10:53:55,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {3494#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {3494#true} is VALID [2018-11-23 10:53:55,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {3494#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; {3494#true} is VALID [2018-11-23 10:53:55,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {3494#true} assume !(0bv32 != ~p1~0); {3494#true} is VALID [2018-11-23 10:53:55,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {3494#true} assume !(0bv32 != ~p2~0); {3494#true} is VALID [2018-11-23 10:53:55,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {3494#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,514 INFO L273 TraceCheckUtils]: 18: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,515 INFO L273 TraceCheckUtils]: 19: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:55,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {3526#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {3495#false} is VALID [2018-11-23 10:53:55,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2018-11-23 10:53:55,519 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:53:55,520 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:55,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:55,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:55,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:55,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:55,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:55,550 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:53:55,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:55,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:55,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:55,552 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2018-11-23 10:53:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:55,885 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2018-11-23 10:53:55,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:55,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:55,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 10:53:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 10:53:55,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 10:53:56,072 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:53:56,078 INFO L225 Difference]: With dead ends: 276 [2018-11-23 10:53:56,078 INFO L226 Difference]: Without dead ends: 274 [2018-11-23 10:53:56,079 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:53:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-23 10:53:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2018-11-23 10:53:56,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:56,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand 200 states. [2018-11-23 10:53:56,150 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 200 states. [2018-11-23 10:53:56,151 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 200 states. [2018-11-23 10:53:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:56,161 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2018-11-23 10:53:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 483 transitions. [2018-11-23 10:53:56,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:56,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:56,162 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 274 states. [2018-11-23 10:53:56,162 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 274 states. [2018-11-23 10:53:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:56,172 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2018-11-23 10:53:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 483 transitions. [2018-11-23 10:53:56,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:56,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:56,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:56,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 10:53:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2018-11-23 10:53:56,181 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2018-11-23 10:53:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:56,181 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2018-11-23 10:53:56,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2018-11-23 10:53:56,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:53:56,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:56,182 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:53:56,182 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:56,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:56,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2018-11-23 10:53:56,183 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:56,183 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:53:56,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:56,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:56,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {4615#true} call ULTIMATE.init(); {4615#true} is VALID [2018-11-23 10:53:56,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {4615#true} assume true; {4615#true} is VALID [2018-11-23 10:53:56,341 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4615#true} {4615#true} #214#return; {4615#true} is VALID [2018-11-23 10:53:56,342 INFO L256 TraceCheckUtils]: 3: Hoare triple {4615#true} call #t~ret12 := main(); {4615#true} is VALID [2018-11-23 10:53:56,342 INFO L273 TraceCheckUtils]: 4: Hoare triple {4615#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;havoc ~cond~0; {4615#true} is VALID [2018-11-23 10:53:56,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {4615#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {4615#true} is VALID [2018-11-23 10:53:56,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {4615#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; {4615#true} is VALID [2018-11-23 10:53:56,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {4615#true} assume !(0bv32 != ~p1~0); {4615#true} is VALID [2018-11-23 10:53:56,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {4615#true} assume !(0bv32 != ~p2~0); {4615#true} is VALID [2018-11-23 10:53:56,345 INFO L273 TraceCheckUtils]: 9: Hoare triple {4615#true} assume !(0bv32 != ~p3~0); {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p8~0); {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,349 INFO L273 TraceCheckUtils]: 17: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,350 INFO L273 TraceCheckUtils]: 19: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {4647#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:56,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {4647#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {4616#false} is VALID [2018-11-23 10:53:56,351 INFO L273 TraceCheckUtils]: 21: Hoare triple {4616#false} assume 1bv32 != ~lk3~0; {4616#false} is VALID [2018-11-23 10:53:56,351 INFO L273 TraceCheckUtils]: 22: Hoare triple {4616#false} assume !false; {4616#false} is VALID [2018-11-23 10:53:56,352 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:53:56,352 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:56,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:56,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:56,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:56,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:56,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:56,384 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:53:56,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:56,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:56,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:56,385 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2018-11-23 10:53:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:56,593 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2018-11-23 10:53:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:56,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2018-11-23 10:53:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2018-11-23 10:53:56,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 203 transitions. [2018-11-23 10:53:56,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:56,915 INFO L225 Difference]: With dead ends: 472 [2018-11-23 10:53:56,915 INFO L226 Difference]: Without dead ends: 282 [2018-11-23 10:53:56,916 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:53:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-23 10:53:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-11-23 10:53:57,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:57,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 280 states. [2018-11-23 10:53:57,094 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 280 states. [2018-11-23 10:53:57,094 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 280 states. [2018-11-23 10:53:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:57,104 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2018-11-23 10:53:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2018-11-23 10:53:57,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:57,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:57,106 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand 282 states. [2018-11-23 10:53:57,106 INFO L87 Difference]: Start difference. First operand 280 states. Second operand 282 states. [2018-11-23 10:53:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:57,113 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2018-11-23 10:53:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2018-11-23 10:53:57,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:57,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:57,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:57,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-23 10:53:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2018-11-23 10:53:57,122 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2018-11-23 10:53:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:57,123 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2018-11-23 10:53:57,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2018-11-23 10:53:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:53:57,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:57,124 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:53:57,125 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:57,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2018-11-23 10:53:57,125 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:57,125 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:53:57,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:57,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:57,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {6036#true} call ULTIMATE.init(); {6036#true} is VALID [2018-11-23 10:53:57,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {6036#true} assume true; {6036#true} is VALID [2018-11-23 10:53:57,546 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6036#true} {6036#true} #214#return; {6036#true} is VALID [2018-11-23 10:53:57,547 INFO L256 TraceCheckUtils]: 3: Hoare triple {6036#true} call #t~ret12 := main(); {6036#true} is VALID [2018-11-23 10:53:57,547 INFO L273 TraceCheckUtils]: 4: Hoare triple {6036#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;havoc ~cond~0; {6036#true} is VALID [2018-11-23 10:53:57,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {6036#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {6036#true} is VALID [2018-11-23 10:53:57,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {6036#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; {6036#true} is VALID [2018-11-23 10:53:57,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {6036#true} assume !(0bv32 != ~p1~0); {6036#true} is VALID [2018-11-23 10:53:57,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {6036#true} assume !(0bv32 != ~p2~0); {6036#true} is VALID [2018-11-23 10:53:57,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {6036#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,550 INFO L273 TraceCheckUtils]: 12: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p8~0); {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {6068#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:57,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {6068#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {6037#false} is VALID [2018-11-23 10:53:57,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {6037#false} assume 0bv32 != ~p4~0; {6037#false} is VALID [2018-11-23 10:53:57,555 INFO L273 TraceCheckUtils]: 22: Hoare triple {6037#false} assume 1bv32 != ~lk4~0; {6037#false} is VALID [2018-11-23 10:53:57,555 INFO L273 TraceCheckUtils]: 23: Hoare triple {6037#false} assume !false; {6037#false} is VALID [2018-11-23 10:53:57,556 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:53:57,557 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:57,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:57,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:57,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:53:57,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:57,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:57,583 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:53:57,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:57,584 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2018-11-23 10:53:58,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:58,363 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2018-11-23 10:53:58,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:58,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:53:58,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2018-11-23 10:53:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2018-11-23 10:53:58,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2018-11-23 10:53:59,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:59,058 INFO L225 Difference]: With dead ends: 420 [2018-11-23 10:53:59,059 INFO L226 Difference]: Without dead ends: 286 [2018-11-23 10:53:59,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:53:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-23 10:53:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-11-23 10:53:59,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:59,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand 284 states. [2018-11-23 10:53:59,118 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand 284 states. [2018-11-23 10:53:59,119 INFO L87 Difference]: Start difference. First operand 286 states. Second operand 284 states. [2018-11-23 10:53:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:59,127 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2018-11-23 10:53:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 483 transitions. [2018-11-23 10:53:59,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:59,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:59,129 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand 286 states. [2018-11-23 10:53:59,129 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 286 states. [2018-11-23 10:53:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:59,137 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2018-11-23 10:53:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 483 transitions. [2018-11-23 10:53:59,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:59,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:59,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:59,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-23 10:53:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2018-11-23 10:53:59,146 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2018-11-23 10:53:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:59,146 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2018-11-23 10:53:59,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2018-11-23 10:53:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:53:59,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:59,148 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:53:59,148 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:59,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2018-11-23 10:53:59,148 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:59,149 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:53:59,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:59,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:59,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {7420#true} call ULTIMATE.init(); {7420#true} is VALID [2018-11-23 10:53:59,695 INFO L273 TraceCheckUtils]: 1: Hoare triple {7420#true} assume true; {7420#true} is VALID [2018-11-23 10:53:59,695 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7420#true} {7420#true} #214#return; {7420#true} is VALID [2018-11-23 10:53:59,696 INFO L256 TraceCheckUtils]: 3: Hoare triple {7420#true} call #t~ret12 := main(); {7420#true} is VALID [2018-11-23 10:53:59,696 INFO L273 TraceCheckUtils]: 4: Hoare triple {7420#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;havoc ~cond~0; {7420#true} is VALID [2018-11-23 10:53:59,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {7420#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {7420#true} is VALID [2018-11-23 10:53:59,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {7420#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; {7420#true} is VALID [2018-11-23 10:53:59,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {7420#true} assume !(0bv32 != ~p1~0); {7420#true} is VALID [2018-11-23 10:53:59,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {7420#true} assume !(0bv32 != ~p2~0); {7420#true} is VALID [2018-11-23 10:53:59,697 INFO L273 TraceCheckUtils]: 9: Hoare triple {7420#true} assume !(0bv32 != ~p3~0); {7420#true} is VALID [2018-11-23 10:53:59,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {7420#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,711 INFO L273 TraceCheckUtils]: 14: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,718 INFO L273 TraceCheckUtils]: 18: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,718 INFO L273 TraceCheckUtils]: 19: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:59,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {7455#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {7421#false} is VALID [2018-11-23 10:53:59,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {7421#false} assume !false; {7421#false} is VALID [2018-11-23 10:53:59,720 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:53:59,720 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:59,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:59,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:59,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:53:59,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:59,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:59,746 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:53:59,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:59,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:59,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:59,747 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2018-11-23 10:54:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:00,229 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-11-23 10:54:00,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:00,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2018-11-23 10:54:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2018-11-23 10:54:00,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2018-11-23 10:54:00,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:00,759 INFO L225 Difference]: With dead ends: 524 [2018-11-23 10:54:00,760 INFO L226 Difference]: Without dead ends: 522 [2018-11-23 10:54:00,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-23 10:54:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2018-11-23 10:54:00,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:00,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand 392 states. [2018-11-23 10:54:00,879 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand 392 states. [2018-11-23 10:54:00,879 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 392 states. [2018-11-23 10:54:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:00,897 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2018-11-23 10:54:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 895 transitions. [2018-11-23 10:54:00,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:00,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:00,899 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand 522 states. [2018-11-23 10:54:00,899 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 522 states. [2018-11-23 10:54:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:00,920 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2018-11-23 10:54:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 895 transitions. [2018-11-23 10:54:00,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:00,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:00,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:00,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-23 10:54:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2018-11-23 10:54:00,933 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2018-11-23 10:54:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:00,934 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2018-11-23 10:54:00,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2018-11-23 10:54:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:54:00,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:00,935 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:00,936 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:00,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2018-11-23 10:54:00,936 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:00,936 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:00,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:01,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:01,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {9492#true} call ULTIMATE.init(); {9492#true} is VALID [2018-11-23 10:54:01,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {9492#true} assume true; {9492#true} is VALID [2018-11-23 10:54:01,291 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9492#true} {9492#true} #214#return; {9492#true} is VALID [2018-11-23 10:54:01,291 INFO L256 TraceCheckUtils]: 3: Hoare triple {9492#true} call #t~ret12 := main(); {9492#true} is VALID [2018-11-23 10:54:01,291 INFO L273 TraceCheckUtils]: 4: Hoare triple {9492#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;havoc ~cond~0; {9492#true} is VALID [2018-11-23 10:54:01,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {9492#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {9492#true} is VALID [2018-11-23 10:54:01,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {9492#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; {9492#true} is VALID [2018-11-23 10:54:01,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {9492#true} assume !(0bv32 != ~p1~0); {9492#true} is VALID [2018-11-23 10:54:01,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {9492#true} assume !(0bv32 != ~p2~0); {9492#true} is VALID [2018-11-23 10:54:01,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {9492#true} assume !(0bv32 != ~p3~0); {9492#true} is VALID [2018-11-23 10:54:01,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {9492#true} assume !(0bv32 != ~p4~0); {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p8~0); {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {9527#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:01,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {9527#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {9493#false} is VALID [2018-11-23 10:54:01,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {9493#false} assume 1bv32 != ~lk4~0; {9493#false} is VALID [2018-11-23 10:54:01,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {9493#false} assume !false; {9493#false} is VALID [2018-11-23 10:54:01,298 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:01,300 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:01,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:01,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:01,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:01,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:01,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:01,331 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:01,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:01,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:01,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:01,332 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2018-11-23 10:54:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:02,348 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2018-11-23 10:54:02,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:02,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2018-11-23 10:54:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2018-11-23 10:54:02,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 200 transitions. [2018-11-23 10:54:02,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:02,991 INFO L225 Difference]: With dead ends: 924 [2018-11-23 10:54:02,991 INFO L226 Difference]: Without dead ends: 546 [2018-11-23 10:54:02,992 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:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-23 10:54:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2018-11-23 10:54:03,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:03,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 546 states. Second operand 544 states. [2018-11-23 10:54:03,139 INFO L74 IsIncluded]: Start isIncluded. First operand 546 states. Second operand 544 states. [2018-11-23 10:54:03,139 INFO L87 Difference]: Start difference. First operand 546 states. Second operand 544 states. [2018-11-23 10:54:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:03,157 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2018-11-23 10:54:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 903 transitions. [2018-11-23 10:54:03,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:03,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:03,159 INFO L74 IsIncluded]: Start isIncluded. First operand 544 states. Second operand 546 states. [2018-11-23 10:54:03,159 INFO L87 Difference]: Start difference. First operand 544 states. Second operand 546 states. [2018-11-23 10:54:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:03,177 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2018-11-23 10:54:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 903 transitions. [2018-11-23 10:54:03,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:03,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:03,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:03,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-11-23 10:54:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2018-11-23 10:54:03,197 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2018-11-23 10:54:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:03,197 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2018-11-23 10:54:03,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2018-11-23 10:54:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:03,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:03,199 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:03,199 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:03,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2018-11-23 10:54:03,199 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:03,200 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:03,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:03,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:03,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {12180#true} call ULTIMATE.init(); {12180#true} is VALID [2018-11-23 10:54:03,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {12180#true} assume true; {12180#true} is VALID [2018-11-23 10:54:03,344 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12180#true} {12180#true} #214#return; {12180#true} is VALID [2018-11-23 10:54:03,345 INFO L256 TraceCheckUtils]: 3: Hoare triple {12180#true} call #t~ret12 := main(); {12180#true} is VALID [2018-11-23 10:54:03,345 INFO L273 TraceCheckUtils]: 4: Hoare triple {12180#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;havoc ~cond~0; {12180#true} is VALID [2018-11-23 10:54:03,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {12180#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {12180#true} is VALID [2018-11-23 10:54:03,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {12180#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; {12180#true} is VALID [2018-11-23 10:54:03,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {12180#true} assume !(0bv32 != ~p1~0); {12180#true} is VALID [2018-11-23 10:54:03,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {12180#true} assume !(0bv32 != ~p2~0); {12180#true} is VALID [2018-11-23 10:54:03,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {12180#true} assume !(0bv32 != ~p3~0); {12180#true} is VALID [2018-11-23 10:54:03,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {12180#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,348 INFO L273 TraceCheckUtils]: 12: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p8~0); {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {12215#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:03,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {12215#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {12181#false} is VALID [2018-11-23 10:54:03,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {12181#false} assume 0bv32 != ~p5~0; {12181#false} is VALID [2018-11-23 10:54:03,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {12181#false} assume 1bv32 != ~lk5~0; {12181#false} is VALID [2018-11-23 10:54:03,355 INFO L273 TraceCheckUtils]: 24: Hoare triple {12181#false} assume !false; {12181#false} is VALID [2018-11-23 10:54:03,356 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:03,356 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:03,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:03,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:03,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:03,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:03,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:03,412 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:03,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:03,413 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2018-11-23 10:54:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:03,776 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2018-11-23 10:54:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:03,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2018-11-23 10:54:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2018-11-23 10:54:03,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2018-11-23 10:54:03,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:03,970 INFO L225 Difference]: With dead ends: 816 [2018-11-23 10:54:03,970 INFO L226 Difference]: Without dead ends: 554 [2018-11-23 10:54:03,971 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:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-23 10:54:04,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2018-11-23 10:54:04,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:04,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 554 states. Second operand 552 states. [2018-11-23 10:54:04,131 INFO L74 IsIncluded]: Start isIncluded. First operand 554 states. Second operand 552 states. [2018-11-23 10:54:04,131 INFO L87 Difference]: Start difference. First operand 554 states. Second operand 552 states. [2018-11-23 10:54:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:04,148 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2018-11-23 10:54:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 903 transitions. [2018-11-23 10:54:04,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:04,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:04,149 INFO L74 IsIncluded]: Start isIncluded. First operand 552 states. Second operand 554 states. [2018-11-23 10:54:04,149 INFO L87 Difference]: Start difference. First operand 552 states. Second operand 554 states. [2018-11-23 10:54:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:04,168 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2018-11-23 10:54:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 903 transitions. [2018-11-23 10:54:04,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:04,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:04,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:04,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-23 10:54:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2018-11-23 10:54:04,188 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2018-11-23 10:54:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:04,189 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2018-11-23 10:54:04,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2018-11-23 10:54:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:04,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:04,190 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:04,190 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:04,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:04,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2018-11-23 10:54:04,191 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:04,191 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:04,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:04,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:04,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {14787#true} call ULTIMATE.init(); {14787#true} is VALID [2018-11-23 10:54:04,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {14787#true} assume true; {14787#true} is VALID [2018-11-23 10:54:04,345 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14787#true} {14787#true} #214#return; {14787#true} is VALID [2018-11-23 10:54:04,345 INFO L256 TraceCheckUtils]: 3: Hoare triple {14787#true} call #t~ret12 := main(); {14787#true} is VALID [2018-11-23 10:54:04,345 INFO L273 TraceCheckUtils]: 4: Hoare triple {14787#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;havoc ~cond~0; {14787#true} is VALID [2018-11-23 10:54:04,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {14787#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {14787#true} is VALID [2018-11-23 10:54:04,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {14787#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; {14787#true} is VALID [2018-11-23 10:54:04,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {14787#true} assume !(0bv32 != ~p1~0); {14787#true} is VALID [2018-11-23 10:54:04,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {14787#true} assume !(0bv32 != ~p2~0); {14787#true} is VALID [2018-11-23 10:54:04,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {14787#true} assume !(0bv32 != ~p3~0); {14787#true} is VALID [2018-11-23 10:54:04,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {14787#true} assume !(0bv32 != ~p4~0); {14787#true} is VALID [2018-11-23 10:54:04,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {14787#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:04,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {14825#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {14788#false} is VALID [2018-11-23 10:54:04,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {14788#false} assume !false; {14788#false} is VALID [2018-11-23 10:54:04,358 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:04,358 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:04,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:04,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:04,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:04,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:04,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:04,388 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:04,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:04,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:04,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:04,389 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2018-11-23 10:54:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:04,890 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2018-11-23 10:54:04,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:04,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 10:54:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 10:54:04,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2018-11-23 10:54:05,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:05,237 INFO L225 Difference]: With dead ends: 1004 [2018-11-23 10:54:05,238 INFO L226 Difference]: Without dead ends: 1002 [2018-11-23 10:54:05,238 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:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-11-23 10:54:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2018-11-23 10:54:05,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:05,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1002 states. Second operand 776 states. [2018-11-23 10:54:05,740 INFO L74 IsIncluded]: Start isIncluded. First operand 1002 states. Second operand 776 states. [2018-11-23 10:54:05,740 INFO L87 Difference]: Start difference. First operand 1002 states. Second operand 776 states. [2018-11-23 10:54:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:05,781 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2018-11-23 10:54:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2018-11-23 10:54:05,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:05,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:05,782 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand 1002 states. [2018-11-23 10:54:05,783 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 1002 states. [2018-11-23 10:54:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:05,819 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2018-11-23 10:54:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2018-11-23 10:54:05,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:05,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:05,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:05,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-23 10:54:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2018-11-23 10:54:05,875 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2018-11-23 10:54:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:05,876 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2018-11-23 10:54:05,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2018-11-23 10:54:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:05,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:05,877 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:05,877 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:05,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2018-11-23 10:54:05,878 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:05,878 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:05,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:05,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:05,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {18710#true} call ULTIMATE.init(); {18710#true} is VALID [2018-11-23 10:54:05,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {18710#true} assume true; {18710#true} is VALID [2018-11-23 10:54:05,990 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18710#true} {18710#true} #214#return; {18710#true} is VALID [2018-11-23 10:54:05,990 INFO L256 TraceCheckUtils]: 3: Hoare triple {18710#true} call #t~ret12 := main(); {18710#true} is VALID [2018-11-23 10:54:05,990 INFO L273 TraceCheckUtils]: 4: Hoare triple {18710#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;havoc ~cond~0; {18710#true} is VALID [2018-11-23 10:54:05,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {18710#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {18710#true} is VALID [2018-11-23 10:54:05,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {18710#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; {18710#true} is VALID [2018-11-23 10:54:05,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {18710#true} assume !(0bv32 != ~p1~0); {18710#true} is VALID [2018-11-23 10:54:05,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {18710#true} assume !(0bv32 != ~p2~0); {18710#true} is VALID [2018-11-23 10:54:05,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {18710#true} assume !(0bv32 != ~p3~0); {18710#true} is VALID [2018-11-23 10:54:05,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {18710#true} assume !(0bv32 != ~p4~0); {18710#true} is VALID [2018-11-23 10:54:05,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {18710#true} assume !(0bv32 != ~p5~0); {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:05,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:05,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:05,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p8~0); {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:05,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:05,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:05,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:06,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:06,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:06,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:06,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {18748#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:06,009 INFO L273 TraceCheckUtils]: 22: Hoare triple {18748#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {18711#false} is VALID [2018-11-23 10:54:06,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {18711#false} assume 1bv32 != ~lk5~0; {18711#false} is VALID [2018-11-23 10:54:06,009 INFO L273 TraceCheckUtils]: 24: Hoare triple {18711#false} assume !false; {18711#false} is VALID [2018-11-23 10:54:06,010 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:06,011 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:06,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:06,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:06,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:06,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:06,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:06,036 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:06,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:06,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:06,037 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2018-11-23 10:54:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:06,926 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2018-11-23 10:54:06,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:06,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2018-11-23 10:54:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2018-11-23 10:54:06,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 197 transitions. [2018-11-23 10:54:07,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:07,174 INFO L225 Difference]: With dead ends: 1820 [2018-11-23 10:54:07,174 INFO L226 Difference]: Without dead ends: 1066 [2018-11-23 10:54:07,175 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:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-11-23 10:54:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2018-11-23 10:54:07,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:07,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1066 states. Second operand 1064 states. [2018-11-23 10:54:07,423 INFO L74 IsIncluded]: Start isIncluded. First operand 1066 states. Second operand 1064 states. [2018-11-23 10:54:07,423 INFO L87 Difference]: Start difference. First operand 1066 states. Second operand 1064 states. [2018-11-23 10:54:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:07,467 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2018-11-23 10:54:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1687 transitions. [2018-11-23 10:54:07,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:07,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:07,469 INFO L74 IsIncluded]: Start isIncluded. First operand 1064 states. Second operand 1066 states. [2018-11-23 10:54:07,469 INFO L87 Difference]: Start difference. First operand 1064 states. Second operand 1066 states. [2018-11-23 10:54:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:07,525 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2018-11-23 10:54:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1687 transitions. [2018-11-23 10:54:07,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:07,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:07,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:07,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-11-23 10:54:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2018-11-23 10:54:07,565 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2018-11-23 10:54:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:07,565 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2018-11-23 10:54:07,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2018-11-23 10:54:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:07,566 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:07,566 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:07,566 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:07,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:07,567 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2018-11-23 10:54:07,567 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:07,567 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:07,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:07,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:07,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {23897#true} call ULTIMATE.init(); {23897#true} is VALID [2018-11-23 10:54:07,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {23897#true} assume true; {23897#true} is VALID [2018-11-23 10:54:07,662 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23897#true} {23897#true} #214#return; {23897#true} is VALID [2018-11-23 10:54:07,662 INFO L256 TraceCheckUtils]: 3: Hoare triple {23897#true} call #t~ret12 := main(); {23897#true} is VALID [2018-11-23 10:54:07,663 INFO L273 TraceCheckUtils]: 4: Hoare triple {23897#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;havoc ~cond~0; {23897#true} is VALID [2018-11-23 10:54:07,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {23897#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {23897#true} is VALID [2018-11-23 10:54:07,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {23897#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; {23897#true} is VALID [2018-11-23 10:54:07,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {23897#true} assume !(0bv32 != ~p1~0); {23897#true} is VALID [2018-11-23 10:54:07,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {23897#true} assume !(0bv32 != ~p2~0); {23897#true} is VALID [2018-11-23 10:54:07,663 INFO L273 TraceCheckUtils]: 9: Hoare triple {23897#true} assume !(0bv32 != ~p3~0); {23897#true} is VALID [2018-11-23 10:54:07,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {23897#true} assume !(0bv32 != ~p4~0); {23897#true} is VALID [2018-11-23 10:54:07,664 INFO L273 TraceCheckUtils]: 11: Hoare triple {23897#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,665 INFO L273 TraceCheckUtils]: 13: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p8~0); {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,666 INFO L273 TraceCheckUtils]: 17: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,666 INFO L273 TraceCheckUtils]: 18: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p1~0); {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,667 INFO L273 TraceCheckUtils]: 19: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p2~0); {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,667 INFO L273 TraceCheckUtils]: 20: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p3~0); {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,668 INFO L273 TraceCheckUtils]: 21: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p4~0); {23935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:07,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {23935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p5~0); {23898#false} is VALID [2018-11-23 10:54:07,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {23898#false} assume 0bv32 != ~p6~0; {23898#false} is VALID [2018-11-23 10:54:07,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {23898#false} assume 1bv32 != ~lk6~0; {23898#false} is VALID [2018-11-23 10:54:07,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {23898#false} assume !false; {23898#false} is VALID [2018-11-23 10:54:07,670 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:07,670 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:07,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:07,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:07,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:07,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:07,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:07,697 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:07,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:07,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:07,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:07,697 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2018-11-23 10:54:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:08,719 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2018-11-23 10:54:08,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:08,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2018-11-23 10:54:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2018-11-23 10:54:08,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 192 transitions. [2018-11-23 10:54:08,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:08,970 INFO L225 Difference]: With dead ends: 1596 [2018-11-23 10:54:08,970 INFO L226 Difference]: Without dead ends: 1082 [2018-11-23 10:54:08,971 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:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-11-23 10:54:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2018-11-23 10:54:09,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:09,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1082 states. Second operand 1080 states. [2018-11-23 10:54:09,710 INFO L74 IsIncluded]: Start isIncluded. First operand 1082 states. Second operand 1080 states. [2018-11-23 10:54:09,711 INFO L87 Difference]: Start difference. First operand 1082 states. Second operand 1080 states. [2018-11-23 10:54:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:09,759 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2018-11-23 10:54:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2018-11-23 10:54:09,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:09,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:09,761 INFO L74 IsIncluded]: Start isIncluded. First operand 1080 states. Second operand 1082 states. [2018-11-23 10:54:09,761 INFO L87 Difference]: Start difference. First operand 1080 states. Second operand 1082 states. [2018-11-23 10:54:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:09,807 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2018-11-23 10:54:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2018-11-23 10:54:09,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:09,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:09,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:09,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-11-23 10:54:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2018-11-23 10:54:09,849 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2018-11-23 10:54:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:09,849 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2018-11-23 10:54:09,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2018-11-23 10:54:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:09,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:09,850 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:09,851 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:09,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:09,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2018-11-23 10:54:09,851 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:09,851 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:09,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:09,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:09,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {28911#true} call ULTIMATE.init(); {28911#true} is VALID [2018-11-23 10:54:09,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {28911#true} assume true; {28911#true} is VALID [2018-11-23 10:54:09,942 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {28911#true} {28911#true} #214#return; {28911#true} is VALID [2018-11-23 10:54:09,943 INFO L256 TraceCheckUtils]: 3: Hoare triple {28911#true} call #t~ret12 := main(); {28911#true} is VALID [2018-11-23 10:54:09,943 INFO L273 TraceCheckUtils]: 4: Hoare triple {28911#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;havoc ~cond~0; {28911#true} is VALID [2018-11-23 10:54:09,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {28911#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {28911#true} is VALID [2018-11-23 10:54:09,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {28911#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; {28911#true} is VALID [2018-11-23 10:54:09,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {28911#true} assume !(0bv32 != ~p1~0); {28911#true} is VALID [2018-11-23 10:54:09,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {28911#true} assume !(0bv32 != ~p2~0); {28911#true} is VALID [2018-11-23 10:54:09,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {28911#true} assume !(0bv32 != ~p3~0); {28911#true} is VALID [2018-11-23 10:54:09,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {28911#true} assume !(0bv32 != ~p4~0); {28911#true} is VALID [2018-11-23 10:54:09,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {28911#true} assume !(0bv32 != ~p5~0); {28911#true} is VALID [2018-11-23 10:54:09,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {28911#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,953 INFO L273 TraceCheckUtils]: 23: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0; {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:09,954 INFO L273 TraceCheckUtils]: 24: Hoare triple {28952#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk6~0; {28912#false} is VALID [2018-11-23 10:54:09,954 INFO L273 TraceCheckUtils]: 25: Hoare triple {28912#false} assume !false; {28912#false} is VALID [2018-11-23 10:54:09,955 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:09,956 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:09,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:09,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:09,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:09,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:09,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:10,005 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:10,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:10,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:10,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:10,005 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2018-11-23 10:54:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:10,866 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2018-11-23 10:54:10,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:10,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 10:54:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 10:54:10,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2018-11-23 10:54:11,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:11,128 INFO L225 Difference]: With dead ends: 1932 [2018-11-23 10:54:11,129 INFO L226 Difference]: Without dead ends: 1930 [2018-11-23 10:54:11,129 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:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-23 10:54:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2018-11-23 10:54:11,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:11,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1930 states. Second operand 1544 states. [2018-11-23 10:54:11,572 INFO L74 IsIncluded]: Start isIncluded. First operand 1930 states. Second operand 1544 states. [2018-11-23 10:54:11,572 INFO L87 Difference]: Start difference. First operand 1930 states. Second operand 1544 states. [2018-11-23 10:54:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:11,693 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2018-11-23 10:54:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3047 transitions. [2018-11-23 10:54:11,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:11,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:11,695 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand 1930 states. [2018-11-23 10:54:11,695 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 1930 states. [2018-11-23 10:54:11,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:11,807 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2018-11-23 10:54:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3047 transitions. [2018-11-23 10:54:11,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:11,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:11,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:11,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-23 10:54:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2018-11-23 10:54:11,888 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2018-11-23 10:54:11,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:11,889 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2018-11-23 10:54:11,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2018-11-23 10:54:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:11,890 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:11,890 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:11,890 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:11,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:11,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2018-11-23 10:54:11,891 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:11,891 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:11,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:11,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:12,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {36437#true} call ULTIMATE.init(); {36437#true} is VALID [2018-11-23 10:54:12,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {36437#true} assume true; {36437#true} is VALID [2018-11-23 10:54:12,014 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {36437#true} {36437#true} #214#return; {36437#true} is VALID [2018-11-23 10:54:12,015 INFO L256 TraceCheckUtils]: 3: Hoare triple {36437#true} call #t~ret12 := main(); {36437#true} is VALID [2018-11-23 10:54:12,015 INFO L273 TraceCheckUtils]: 4: Hoare triple {36437#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;havoc ~cond~0; {36437#true} is VALID [2018-11-23 10:54:12,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {36437#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {36437#true} is VALID [2018-11-23 10:54:12,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {36437#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; {36437#true} is VALID [2018-11-23 10:54:12,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {36437#true} assume !(0bv32 != ~p1~0); {36437#true} is VALID [2018-11-23 10:54:12,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {36437#true} assume !(0bv32 != ~p2~0); {36437#true} is VALID [2018-11-23 10:54:12,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {36437#true} assume !(0bv32 != ~p3~0); {36437#true} is VALID [2018-11-23 10:54:12,017 INFO L273 TraceCheckUtils]: 10: Hoare triple {36437#true} assume !(0bv32 != ~p4~0); {36437#true} is VALID [2018-11-23 10:54:12,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {36437#true} assume !(0bv32 != ~p5~0); {36437#true} is VALID [2018-11-23 10:54:12,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {36437#true} assume !(0bv32 != ~p6~0); {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p8~0); {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p1~0); {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p2~0); {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p3~0); {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p4~0); {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,032 INFO L273 TraceCheckUtils]: 22: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p5~0); {36478#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:12,034 INFO L273 TraceCheckUtils]: 23: Hoare triple {36478#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p6~0; {36438#false} is VALID [2018-11-23 10:54:12,034 INFO L273 TraceCheckUtils]: 24: Hoare triple {36438#false} assume 1bv32 != ~lk6~0; {36438#false} is VALID [2018-11-23 10:54:12,034 INFO L273 TraceCheckUtils]: 25: Hoare triple {36438#false} assume !false; {36438#false} is VALID [2018-11-23 10:54:12,034 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:12,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:12,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:12,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:12,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:12,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:12,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:12,065 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:12,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:12,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:12,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:12,066 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2018-11-23 10:54:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:13,458 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2018-11-23 10:54:13,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:13,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2018-11-23 10:54:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2018-11-23 10:54:13,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2018-11-23 10:54:13,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:13,854 INFO L225 Difference]: With dead ends: 3596 [2018-11-23 10:54:13,855 INFO L226 Difference]: Without dead ends: 2090 [2018-11-23 10:54:13,858 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:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-11-23 10:54:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2018-11-23 10:54:14,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:14,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2090 states. Second operand 2088 states. [2018-11-23 10:54:14,763 INFO L74 IsIncluded]: Start isIncluded. First operand 2090 states. Second operand 2088 states. [2018-11-23 10:54:14,763 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 2088 states. [2018-11-23 10:54:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:14,895 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2018-11-23 10:54:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3143 transitions. [2018-11-23 10:54:14,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:14,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:14,897 INFO L74 IsIncluded]: Start isIncluded. First operand 2088 states. Second operand 2090 states. [2018-11-23 10:54:14,897 INFO L87 Difference]: Start difference. First operand 2088 states. Second operand 2090 states. [2018-11-23 10:54:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:15,020 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2018-11-23 10:54:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3143 transitions. [2018-11-23 10:54:15,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:15,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:15,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:15,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-11-23 10:54:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2018-11-23 10:54:15,166 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2018-11-23 10:54:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:15,166 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2018-11-23 10:54:15,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2018-11-23 10:54:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:15,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:15,168 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:15,168 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:15,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2018-11-23 10:54:15,168 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:15,168 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:15,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:15,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:15,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {46555#true} call ULTIMATE.init(); {46555#true} is VALID [2018-11-23 10:54:15,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {46555#true} assume true; {46555#true} is VALID [2018-11-23 10:54:15,436 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {46555#true} {46555#true} #214#return; {46555#true} is VALID [2018-11-23 10:54:15,436 INFO L256 TraceCheckUtils]: 3: Hoare triple {46555#true} call #t~ret12 := main(); {46555#true} is VALID [2018-11-23 10:54:15,436 INFO L273 TraceCheckUtils]: 4: Hoare triple {46555#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;havoc ~cond~0; {46555#true} is VALID [2018-11-23 10:54:15,437 INFO L273 TraceCheckUtils]: 5: Hoare triple {46555#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {46555#true} is VALID [2018-11-23 10:54:15,437 INFO L273 TraceCheckUtils]: 6: Hoare triple {46555#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; {46555#true} is VALID [2018-11-23 10:54:15,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {46555#true} assume !(0bv32 != ~p1~0); {46555#true} is VALID [2018-11-23 10:54:15,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {46555#true} assume !(0bv32 != ~p2~0); {46555#true} is VALID [2018-11-23 10:54:15,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {46555#true} assume !(0bv32 != ~p3~0); {46555#true} is VALID [2018-11-23 10:54:15,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {46555#true} assume !(0bv32 != ~p4~0); {46555#true} is VALID [2018-11-23 10:54:15,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {46555#true} assume !(0bv32 != ~p5~0); {46555#true} is VALID [2018-11-23 10:54:15,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {46555#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p8~0); {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,440 INFO L273 TraceCheckUtils]: 17: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p1~0); {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,441 INFO L273 TraceCheckUtils]: 19: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p2~0); {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p3~0); {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p4~0); {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,442 INFO L273 TraceCheckUtils]: 22: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p5~0); {46596#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:15,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {46596#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p6~0); {46556#false} is VALID [2018-11-23 10:54:15,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {46556#false} assume 0bv32 != ~p7~0; {46556#false} is VALID [2018-11-23 10:54:15,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {46556#false} assume 1bv32 != ~lk7~0; {46556#false} is VALID [2018-11-23 10:54:15,443 INFO L273 TraceCheckUtils]: 26: Hoare triple {46556#false} assume !false; {46556#false} is VALID [2018-11-23 10:54:15,444 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:15,444 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:15,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:15,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:15,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:15,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:15,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:15,471 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:15,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:15,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:15,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:15,472 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2018-11-23 10:54:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:16,941 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2018-11-23 10:54:16,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:16,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-23 10:54:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-23 10:54:16,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2018-11-23 10:54:17,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:17,375 INFO L225 Difference]: With dead ends: 3132 [2018-11-23 10:54:17,375 INFO L226 Difference]: Without dead ends: 2122 [2018-11-23 10:54:17,377 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:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-23 10:54:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2018-11-23 10:54:17,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:17,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2122 states. Second operand 2120 states. [2018-11-23 10:54:17,886 INFO L74 IsIncluded]: Start isIncluded. First operand 2122 states. Second operand 2120 states. [2018-11-23 10:54:17,886 INFO L87 Difference]: Start difference. First operand 2122 states. Second operand 2120 states. [2018-11-23 10:54:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:18,040 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2018-11-23 10:54:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3143 transitions. [2018-11-23 10:54:18,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:18,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:18,043 INFO L74 IsIncluded]: Start isIncluded. First operand 2120 states. Second operand 2122 states. [2018-11-23 10:54:18,043 INFO L87 Difference]: Start difference. First operand 2120 states. Second operand 2122 states. [2018-11-23 10:54:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:18,171 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2018-11-23 10:54:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3143 transitions. [2018-11-23 10:54:18,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:18,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:18,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:18,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-11-23 10:54:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2018-11-23 10:54:18,347 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2018-11-23 10:54:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:18,347 INFO L480 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2018-11-23 10:54:18,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2018-11-23 10:54:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:18,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:18,349 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:18,349 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:18,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:18,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2018-11-23 10:54:18,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:18,349 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:18,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:18,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:18,440 INFO L256 TraceCheckUtils]: 0: Hoare triple {56308#true} call ULTIMATE.init(); {56308#true} is VALID [2018-11-23 10:54:18,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {56308#true} assume true; {56308#true} is VALID [2018-11-23 10:54:18,441 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {56308#true} {56308#true} #214#return; {56308#true} is VALID [2018-11-23 10:54:18,441 INFO L256 TraceCheckUtils]: 3: Hoare triple {56308#true} call #t~ret12 := main(); {56308#true} is VALID [2018-11-23 10:54:18,441 INFO L273 TraceCheckUtils]: 4: Hoare triple {56308#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;havoc ~cond~0; {56308#true} is VALID [2018-11-23 10:54:18,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {56308#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {56308#true} is VALID [2018-11-23 10:54:18,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {56308#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; {56308#true} is VALID [2018-11-23 10:54:18,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {56308#true} assume !(0bv32 != ~p1~0); {56308#true} is VALID [2018-11-23 10:54:18,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {56308#true} assume !(0bv32 != ~p2~0); {56308#true} is VALID [2018-11-23 10:54:18,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {56308#true} assume !(0bv32 != ~p3~0); {56308#true} is VALID [2018-11-23 10:54:18,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {56308#true} assume !(0bv32 != ~p4~0); {56308#true} is VALID [2018-11-23 10:54:18,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {56308#true} assume !(0bv32 != ~p5~0); {56308#true} is VALID [2018-11-23 10:54:18,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {56308#true} assume !(0bv32 != ~p6~0); {56308#true} is VALID [2018-11-23 10:54:18,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {56308#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,445 INFO L273 TraceCheckUtils]: 14: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,449 INFO L273 TraceCheckUtils]: 17: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,449 INFO L273 TraceCheckUtils]: 18: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,451 INFO L273 TraceCheckUtils]: 20: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,451 INFO L273 TraceCheckUtils]: 21: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,453 INFO L273 TraceCheckUtils]: 23: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0; {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:18,455 INFO L273 TraceCheckUtils]: 25: Hoare triple {56352#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk7~0; {56309#false} is VALID [2018-11-23 10:54:18,455 INFO L273 TraceCheckUtils]: 26: Hoare triple {56309#false} assume !false; {56309#false} is VALID [2018-11-23 10:54:18,456 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:18,456 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:18,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:18,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:18,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:18,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:18,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:18,483 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:18,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:18,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:18,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:18,484 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2018-11-23 10:54:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:20,354 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2018-11-23 10:54:20,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:20,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2018-11-23 10:54:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2018-11-23 10:54:20,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2018-11-23 10:54:20,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:21,013 INFO L225 Difference]: With dead ends: 3724 [2018-11-23 10:54:21,013 INFO L226 Difference]: Without dead ends: 3722 [2018-11-23 10:54:21,014 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:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-23 10:54:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2018-11-23 10:54:22,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:22,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3722 states. Second operand 3080 states. [2018-11-23 10:54:22,141 INFO L74 IsIncluded]: Start isIncluded. First operand 3722 states. Second operand 3080 states. [2018-11-23 10:54:22,141 INFO L87 Difference]: Start difference. First operand 3722 states. Second operand 3080 states. [2018-11-23 10:54:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:22,651 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2018-11-23 10:54:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5575 transitions. [2018-11-23 10:54:22,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:22,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:22,655 INFO L74 IsIncluded]: Start isIncluded. First operand 3080 states. Second operand 3722 states. [2018-11-23 10:54:22,655 INFO L87 Difference]: Start difference. First operand 3080 states. Second operand 3722 states. [2018-11-23 10:54:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:23,177 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2018-11-23 10:54:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5575 transitions. [2018-11-23 10:54:23,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:23,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:23,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:23,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2018-11-23 10:54:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2018-11-23 10:54:23,563 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2018-11-23 10:54:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:23,563 INFO L480 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2018-11-23 10:54:23,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2018-11-23 10:54:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:23,566 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:23,566 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:23,566 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:23,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2018-11-23 10:54:23,566 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:23,566 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:23,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:23,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:23,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {70845#true} call ULTIMATE.init(); {70845#true} is VALID [2018-11-23 10:54:23,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {70845#true} assume true; {70845#true} is VALID [2018-11-23 10:54:23,663 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {70845#true} {70845#true} #214#return; {70845#true} is VALID [2018-11-23 10:54:23,664 INFO L256 TraceCheckUtils]: 3: Hoare triple {70845#true} call #t~ret12 := main(); {70845#true} is VALID [2018-11-23 10:54:23,664 INFO L273 TraceCheckUtils]: 4: Hoare triple {70845#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;havoc ~cond~0; {70845#true} is VALID [2018-11-23 10:54:23,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {70845#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {70845#true} is VALID [2018-11-23 10:54:23,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {70845#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; {70845#true} is VALID [2018-11-23 10:54:23,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {70845#true} assume !(0bv32 != ~p1~0); {70845#true} is VALID [2018-11-23 10:54:23,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {70845#true} assume !(0bv32 != ~p2~0); {70845#true} is VALID [2018-11-23 10:54:23,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {70845#true} assume !(0bv32 != ~p3~0); {70845#true} is VALID [2018-11-23 10:54:23,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {70845#true} assume !(0bv32 != ~p4~0); {70845#true} is VALID [2018-11-23 10:54:23,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {70845#true} assume !(0bv32 != ~p5~0); {70845#true} is VALID [2018-11-23 10:54:23,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {70845#true} assume !(0bv32 != ~p6~0); {70845#true} is VALID [2018-11-23 10:54:23,667 INFO L273 TraceCheckUtils]: 13: Hoare triple {70845#true} assume !(0bv32 != ~p7~0); {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p8~0); {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p1~0); {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p2~0); {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p3~0); {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p4~0); {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p5~0); {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p6~0); {70889#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:23,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {70889#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p7~0; {70846#false} is VALID [2018-11-23 10:54:23,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {70846#false} assume 1bv32 != ~lk7~0; {70846#false} is VALID [2018-11-23 10:54:23,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {70846#false} assume !false; {70846#false} is VALID [2018-11-23 10:54:23,675 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,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:23,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:23,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:23,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:23,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:23,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:23,704 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:23,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:23,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:23,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:23,705 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2018-11-23 10:54:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:27,523 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2018-11-23 10:54:27,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:27,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-23 10:54:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-23 10:54:27,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2018-11-23 10:54:27,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:28,407 INFO L225 Difference]: With dead ends: 7116 [2018-11-23 10:54:28,407 INFO L226 Difference]: Without dead ends: 4106 [2018-11-23 10:54:28,412 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:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-23 10:54:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2018-11-23 10:54:29,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:29,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4106 states. Second operand 4104 states. [2018-11-23 10:54:29,890 INFO L74 IsIncluded]: Start isIncluded. First operand 4106 states. Second operand 4104 states. [2018-11-23 10:54:29,890 INFO L87 Difference]: Start difference. First operand 4106 states. Second operand 4104 states. [2018-11-23 10:54:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:30,522 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2018-11-23 10:54:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5831 transitions. [2018-11-23 10:54:30,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:30,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:30,527 INFO L74 IsIncluded]: Start isIncluded. First operand 4104 states. Second operand 4106 states. [2018-11-23 10:54:30,527 INFO L87 Difference]: Start difference. First operand 4104 states. Second operand 4106 states. [2018-11-23 10:54:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:31,143 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2018-11-23 10:54:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5831 transitions. [2018-11-23 10:54:31,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:31,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:31,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:31,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-11-23 10:54:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2018-11-23 10:54:31,859 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2018-11-23 10:54:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:31,860 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2018-11-23 10:54:31,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:31,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2018-11-23 10:54:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:31,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:31,862 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:31,863 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:31,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2018-11-23 10:54:31,863 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:31,863 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:54:31,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:31,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:31,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {90694#true} call ULTIMATE.init(); {90694#true} is VALID [2018-11-23 10:54:31,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {90694#true} assume true; {90694#true} is VALID [2018-11-23 10:54:31,960 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {90694#true} {90694#true} #214#return; {90694#true} is VALID [2018-11-23 10:54:31,960 INFO L256 TraceCheckUtils]: 3: Hoare triple {90694#true} call #t~ret12 := main(); {90694#true} is VALID [2018-11-23 10:54:31,961 INFO L273 TraceCheckUtils]: 4: Hoare triple {90694#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;havoc ~cond~0; {90694#true} is VALID [2018-11-23 10:54:31,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {90694#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {90694#true} is VALID [2018-11-23 10:54:31,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {90694#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; {90694#true} is VALID [2018-11-23 10:54:31,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {90694#true} assume !(0bv32 != ~p1~0); {90694#true} is VALID [2018-11-23 10:54:31,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {90694#true} assume !(0bv32 != ~p2~0); {90694#true} is VALID [2018-11-23 10:54:31,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {90694#true} assume !(0bv32 != ~p3~0); {90694#true} is VALID [2018-11-23 10:54:31,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {90694#true} assume !(0bv32 != ~p4~0); {90694#true} is VALID [2018-11-23 10:54:31,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {90694#true} assume !(0bv32 != ~p5~0); {90694#true} is VALID [2018-11-23 10:54:31,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {90694#true} assume !(0bv32 != ~p6~0); {90694#true} is VALID [2018-11-23 10:54:31,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {90694#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p8~0); {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p1~0); {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p2~0); {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p3~0); {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p4~0); {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p5~0); {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p6~0); {90738#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:31,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {90738#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p7~0); {90695#false} is VALID [2018-11-23 10:54:31,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {90695#false} assume 0bv32 != ~p8~0; {90695#false} is VALID [2018-11-23 10:54:31,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {90695#false} assume 1bv32 != ~lk8~0; {90695#false} is VALID [2018-11-23 10:54:31,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {90695#false} assume !false; {90695#false} is VALID [2018-11-23 10:54:31,968 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:31,968 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:31,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:31,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:31,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:31,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:31,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:31,997 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:31,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:31,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:31,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:31,998 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2018-11-23 10:54:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:35,835 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2018-11-23 10:54:35,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:35,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 10:54:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 10:54:35,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2018-11-23 10:54:36,034 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:36,829 INFO L225 Difference]: With dead ends: 6156 [2018-11-23 10:54:36,830 INFO L226 Difference]: Without dead ends: 4170 [2018-11-23 10:54:36,833 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:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2018-11-23 10:54:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2018-11-23 10:54:39,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:39,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4170 states. Second operand 4168 states. [2018-11-23 10:54:39,322 INFO L74 IsIncluded]: Start isIncluded. First operand 4170 states. Second operand 4168 states. [2018-11-23 10:54:39,322 INFO L87 Difference]: Start difference. First operand 4170 states. Second operand 4168 states. [2018-11-23 10:54:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,956 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2018-11-23 10:54:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5831 transitions. [2018-11-23 10:54:39,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,960 INFO L74 IsIncluded]: Start isIncluded. First operand 4168 states. Second operand 4170 states. [2018-11-23 10:54:39,960 INFO L87 Difference]: Start difference. First operand 4168 states. Second operand 4170 states. [2018-11-23 10:54:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,611 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2018-11-23 10:54:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5831 transitions. [2018-11-23 10:54:40,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:40,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2018-11-23 10:54:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2018-11-23 10:54:41,279 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2018-11-23 10:54:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:41,279 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2018-11-23 10:54:41,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2018-11-23 10:54:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:41,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:41,282 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,282 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:41,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:41,283 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2018-11-23 10:54:41,283 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:41,283 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:54:41,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:41,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:41,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {109778#true} call ULTIMATE.init(); {109778#true} is VALID [2018-11-23 10:54:41,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {109778#true} assume true; {109778#true} is VALID [2018-11-23 10:54:41,381 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {109778#true} {109778#true} #214#return; {109778#true} is VALID [2018-11-23 10:54:41,382 INFO L256 TraceCheckUtils]: 3: Hoare triple {109778#true} call #t~ret12 := main(); {109778#true} is VALID [2018-11-23 10:54:41,382 INFO L273 TraceCheckUtils]: 4: Hoare triple {109778#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;havoc ~cond~0; {109778#true} is VALID [2018-11-23 10:54:41,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {109778#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {109778#true} is VALID [2018-11-23 10:54:41,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {109778#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; {109778#true} is VALID [2018-11-23 10:54:41,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {109778#true} assume !(0bv32 != ~p1~0); {109778#true} is VALID [2018-11-23 10:54:41,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {109778#true} assume !(0bv32 != ~p2~0); {109778#true} is VALID [2018-11-23 10:54:41,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {109778#true} assume !(0bv32 != ~p3~0); {109778#true} is VALID [2018-11-23 10:54:41,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {109778#true} assume !(0bv32 != ~p4~0); {109778#true} is VALID [2018-11-23 10:54:41,384 INFO L273 TraceCheckUtils]: 11: Hoare triple {109778#true} assume !(0bv32 != ~p5~0); {109778#true} is VALID [2018-11-23 10:54:41,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {109778#true} assume !(0bv32 != ~p6~0); {109778#true} is VALID [2018-11-23 10:54:41,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {109778#true} assume !(0bv32 != ~p7~0); {109778#true} is VALID [2018-11-23 10:54:41,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {109778#true} assume !(0bv32 != ~p8~0); {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p1~0); {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p2~0); {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p3~0); {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p4~0); {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p5~0); {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p6~0); {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p7~0); {109825#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:41,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {109825#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p8~0; {109779#false} is VALID [2018-11-23 10:54:41,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {109779#false} assume 1bv32 != ~lk8~0; {109779#false} is VALID [2018-11-23 10:54:41,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {109779#false} assume !false; {109779#false} is VALID [2018-11-23 10:54:41,405 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,405 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:41,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:41,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:41,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:41,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:41,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:41,434 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,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:41,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:41,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:41,435 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2018-11-23 10:54:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:50,233 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2018-11-23 10:54:50,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:50,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-23 10:54:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-23 10:54:50,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2018-11-23 10:54:50,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:53,399 INFO L225 Difference]: With dead ends: 12108 [2018-11-23 10:54:53,400 INFO L226 Difference]: Without dead ends: 8074 [2018-11-23 10:54:53,406 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:53,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-23 10:54:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2018-11-23 10:54:57,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:57,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8074 states. Second operand 8072 states. [2018-11-23 10:54:57,469 INFO L74 IsIncluded]: Start isIncluded. First operand 8074 states. Second operand 8072 states. [2018-11-23 10:54:57,469 INFO L87 Difference]: Start difference. First operand 8074 states. Second operand 8072 states. [2018-11-23 10:54:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,941 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2018-11-23 10:54:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10887 transitions. [2018-11-23 10:54:59,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:59,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:59,948 INFO L74 IsIncluded]: Start isIncluded. First operand 8072 states. Second operand 8074 states. [2018-11-23 10:54:59,948 INFO L87 Difference]: Start difference. First operand 8072 states. Second operand 8074 states. [2018-11-23 10:55:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:02,477 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2018-11-23 10:55:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10887 transitions. [2018-11-23 10:55:02,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:02,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:02,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:02,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-23 10:55:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2018-11-23 10:55:05,158 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2018-11-23 10:55:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:05,158 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2018-11-23 10:55:05,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2018-11-23 10:55:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:55:05,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:05,162 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:55:05,162 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:05,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:05,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2018-11-23 10:55:05,162 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:05,162 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:05,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:05,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:05,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {146846#true} call ULTIMATE.init(); {146846#true} is VALID [2018-11-23 10:55:05,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {146846#true} assume true; {146846#true} is VALID [2018-11-23 10:55:05,257 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {146846#true} {146846#true} #214#return; {146846#true} is VALID [2018-11-23 10:55:05,257 INFO L256 TraceCheckUtils]: 3: Hoare triple {146846#true} call #t~ret12 := main(); {146846#true} is VALID [2018-11-23 10:55:05,257 INFO L273 TraceCheckUtils]: 4: Hoare triple {146846#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;havoc ~cond~0; {146846#true} is VALID [2018-11-23 10:55:05,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {146846#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {146846#true} is VALID [2018-11-23 10:55:05,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {146846#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; {146846#true} is VALID [2018-11-23 10:55:05,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {146846#true} assume !(0bv32 != ~p1~0); {146846#true} is VALID [2018-11-23 10:55:05,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {146846#true} assume !(0bv32 != ~p2~0); {146846#true} is VALID [2018-11-23 10:55:05,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {146846#true} assume !(0bv32 != ~p3~0); {146846#true} is VALID [2018-11-23 10:55:05,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {146846#true} assume !(0bv32 != ~p4~0); {146846#true} is VALID [2018-11-23 10:55:05,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {146846#true} assume !(0bv32 != ~p5~0); {146846#true} is VALID [2018-11-23 10:55:05,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {146846#true} assume !(0bv32 != ~p6~0); {146846#true} is VALID [2018-11-23 10:55:05,259 INFO L273 TraceCheckUtils]: 13: Hoare triple {146846#true} assume !(0bv32 != ~p7~0); {146846#true} is VALID [2018-11-23 10:55:05,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {146846#true} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,272 INFO L273 TraceCheckUtils]: 24: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,272 INFO L273 TraceCheckUtils]: 25: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0; {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {146893#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk8~0; {146847#false} is VALID [2018-11-23 10:55:05,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {146847#false} assume !false; {146847#false} is VALID [2018-11-23 10:55:05,275 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:05,275 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:05,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:05,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:05,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:55:05,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:05,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:05,303 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:55:05,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:05,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:05,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:05,304 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2018-11-23 10:55:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:14,461 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2018-11-23 10:55:14,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:14,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:55:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2018-11-23 10:55:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2018-11-23 10:55:14,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2018-11-23 10:55:14,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:18,444 INFO L225 Difference]: With dead ends: 9100 [2018-11-23 10:55:18,444 INFO L226 Difference]: Without dead ends: 9098 [2018-11-23 10:55:18,447 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:55:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2018-11-23 10:55:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2018-11-23 10:55:22,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:22,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9098 states. Second operand 8072 states. [2018-11-23 10:55:22,128 INFO L74 IsIncluded]: Start isIncluded. First operand 9098 states. Second operand 8072 states. [2018-11-23 10:55:22,128 INFO L87 Difference]: Start difference. First operand 9098 states. Second operand 8072 states. [2018-11-23 10:55:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:25,227 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2018-11-23 10:55:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 12551 transitions. [2018-11-23 10:55:25,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:25,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:25,233 INFO L74 IsIncluded]: Start isIncluded. First operand 8072 states. Second operand 9098 states. [2018-11-23 10:55:25,233 INFO L87 Difference]: Start difference. First operand 8072 states. Second operand 9098 states. [2018-11-23 10:55:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:28,372 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2018-11-23 10:55:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 12551 transitions. [2018-11-23 10:55:28,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:28,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:28,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:28,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-23 10:55:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2018-11-23 10:55:31,097 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2018-11-23 10:55:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:31,097 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2018-11-23 10:55:31,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2018-11-23 10:55:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:55:31,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:31,102 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:55:31,102 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:31,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2018-11-23 10:55:31,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:31,103 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:55:31,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:31,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:31,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {182954#true} call ULTIMATE.init(); {182954#true} is VALID [2018-11-23 10:55:31,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {182954#true} assume true; {182954#true} is VALID [2018-11-23 10:55:31,208 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {182954#true} {182954#true} #214#return; {182954#true} is VALID [2018-11-23 10:55:31,208 INFO L256 TraceCheckUtils]: 3: Hoare triple {182954#true} call #t~ret12 := main(); {182954#true} is VALID [2018-11-23 10:55:31,208 INFO L273 TraceCheckUtils]: 4: Hoare triple {182954#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;havoc ~cond~0; {182954#true} is VALID [2018-11-23 10:55:31,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {182954#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {182954#true} is VALID [2018-11-23 10:55:31,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {182954#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; {182954#true} is VALID [2018-11-23 10:55:31,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {182954#true} assume !(0bv32 != ~p1~0); {182954#true} is VALID [2018-11-23 10:55:31,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {182954#true} assume !(0bv32 != ~p2~0); {182954#true} is VALID [2018-11-23 10:55:31,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {182954#true} assume !(0bv32 != ~p3~0); {182954#true} is VALID [2018-11-23 10:55:31,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {182954#true} assume !(0bv32 != ~p4~0); {182954#true} is VALID [2018-11-23 10:55:31,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {182954#true} assume !(0bv32 != ~p5~0); {182954#true} is VALID [2018-11-23 10:55:31,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {182954#true} assume !(0bv32 != ~p6~0); {182954#true} is VALID [2018-11-23 10:55:31,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {182954#true} assume !(0bv32 != ~p7~0); {182954#true} is VALID [2018-11-23 10:55:31,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {182954#true} assume !(0bv32 != ~p8~0); {182954#true} is VALID [2018-11-23 10:55:31,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {182954#true} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,214 INFO L273 TraceCheckUtils]: 17: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,218 INFO L273 TraceCheckUtils]: 21: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,227 INFO L273 TraceCheckUtils]: 26: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0; {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:31,227 INFO L273 TraceCheckUtils]: 27: Hoare triple {183004#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk9~0; {182955#false} is VALID [2018-11-23 10:55:31,227 INFO L273 TraceCheckUtils]: 28: Hoare triple {182955#false} assume !false; {182955#false} is VALID [2018-11-23 10:55:31,228 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:31,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:31,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:31,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:31,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:55:31,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:31,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:31,257 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:55:31,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:31,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:31,258 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2018-11-23 10:55:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:47,358 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2018-11-23 10:55:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:47,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:55:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 10:55:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 10:55:47,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2018-11-23 10:55:47,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:54,820 INFO L225 Difference]: With dead ends: 13708 [2018-11-23 10:55:54,820 INFO L226 Difference]: Without dead ends: 13706 [2018-11-23 10:55:54,822 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:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2018-11-23 10:56:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2018-11-23 10:56:00,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:56:00,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13706 states. Second operand 12168 states. [2018-11-23 10:56:00,046 INFO L74 IsIncluded]: Start isIncluded. First operand 13706 states. Second operand 12168 states. [2018-11-23 10:56:00,046 INFO L87 Difference]: Start difference. First operand 13706 states. Second operand 12168 states. [2018-11-23 10:56:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:08,000 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2018-11-23 10:56:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 18311 transitions. [2018-11-23 10:56:08,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:08,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:08,012 INFO L74 IsIncluded]: Start isIncluded. First operand 12168 states. Second operand 13706 states. [2018-11-23 10:56:08,013 INFO L87 Difference]: Start difference. First operand 12168 states. Second operand 13706 states. [2018-11-23 10:56:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:15,657 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2018-11-23 10:56:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 18311 transitions. [2018-11-23 10:56:15,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:15,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:15,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:56:15,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:56:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-11-23 10:56:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2018-11-23 10:56:22,157 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2018-11-23 10:56:22,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:56:22,157 INFO L480 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2018-11-23 10:56:22,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:56:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2018-11-23 10:56:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:56:22,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:56:22,164 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:56:22,165 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:56:22,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:56:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2018-11-23 10:56:22,165 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:56:22,165 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:56:22,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:56:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:22,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:56:22,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {237113#true} call ULTIMATE.init(); {237113#true} is VALID [2018-11-23 10:56:22,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {237113#true} assume true; {237113#true} is VALID [2018-11-23 10:56:22,263 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {237113#true} {237113#true} #214#return; {237113#true} is VALID [2018-11-23 10:56:22,263 INFO L256 TraceCheckUtils]: 3: Hoare triple {237113#true} call #t~ret12 := main(); {237113#true} is VALID [2018-11-23 10:56:22,263 INFO L273 TraceCheckUtils]: 4: Hoare triple {237113#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;havoc ~cond~0; {237113#true} is VALID [2018-11-23 10:56:22,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {237113#true} assume !false;~cond~0 := #t~nondet11;havoc #t~nondet11; {237113#true} is VALID [2018-11-23 10:56:22,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {237113#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; {237113#true} is VALID [2018-11-23 10:56:22,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {237113#true} assume !(0bv32 != ~p1~0); {237113#true} is VALID [2018-11-23 10:56:22,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {237113#true} assume !(0bv32 != ~p2~0); {237113#true} is VALID [2018-11-23 10:56:22,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {237113#true} assume !(0bv32 != ~p3~0); {237113#true} is VALID [2018-11-23 10:56:22,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {237113#true} assume !(0bv32 != ~p4~0); {237113#true} is VALID [2018-11-23 10:56:22,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {237113#true} assume !(0bv32 != ~p5~0); {237113#true} is VALID [2018-11-23 10:56:22,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {237113#true} assume !(0bv32 != ~p6~0); {237113#true} is VALID [2018-11-23 10:56:22,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {237113#true} assume !(0bv32 != ~p7~0); {237113#true} is VALID [2018-11-23 10:56:22,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {237113#true} assume !(0bv32 != ~p8~0); {237113#true} is VALID [2018-11-23 10:56:22,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {237113#true} assume !(0bv32 != ~p9~0); {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p1~0); {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p2~0); {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p3~0); {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p4~0); {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p5~0); {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p6~0); {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p7~0); {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p8~0); {237163#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:22,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {237163#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p9~0; {237114#false} is VALID [2018-11-23 10:56:22,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {237114#false} assume 1bv32 != ~lk9~0; {237114#false} is VALID [2018-11-23 10:56:22,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {237114#false} assume !false; {237114#false} is VALID [2018-11-23 10:56:22,272 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:22,272 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:56:22,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:56:22,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:56:22,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:56:22,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:56:22,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:56:22,300 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:56:22,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:56:22,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:56:22,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:56:22,301 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states.