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_9_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:54:52,422 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:54:52,424 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:54:52,437 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:54:52,437 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:54:52,438 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:54:52,440 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:54:52,441 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:54:52,443 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:54:52,444 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:54:52,445 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:54:52,445 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:54:52,446 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:54:52,447 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:54:52,448 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:54:52,449 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:54:52,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:54:52,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:54:52,454 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:54:52,455 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:54:52,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:54:52,458 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:54:52,460 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:54:52,461 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:54:52,461 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:54:52,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:54:52,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:54:52,464 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:54:52,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:54:52,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:54:52,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:54:52,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:54:52,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:54:52,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:54:52,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:54:52,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:54:52,469 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:54:52,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:54:52,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:54:52,497 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:54:52,497 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:54:52,498 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:54:52,498 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:54:52,499 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:54:52,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:54:52,499 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:54:52,499 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:54:52,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:54:52,500 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:54:52,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:54:52,500 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:54:52,500 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:54:52,500 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:54:52,501 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:54:52,502 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:54:52,502 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:54:52,502 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:54:52,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:54:52,503 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:54:52,503 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:54:52,503 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:54:52,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:52,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:54:52,504 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:54:52,504 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:54:52,504 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:54:52,504 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:54:52,505 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:54:52,505 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:54:52,505 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:54:52,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:54:52,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:54:52,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:54:52,591 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:54:52,591 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:54:52,592 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:52,657 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6544971/0015234e882846d0a5a2945771324f74/FLAGa2e648706 [2018-11-23 10:54:53,086 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:54:53,087 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:53,095 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6544971/0015234e882846d0a5a2945771324f74/FLAGa2e648706 [2018-11-23 10:54:53,441 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6544971/0015234e882846d0a5a2945771324f74 [2018-11-23 10:54:53,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:54:53,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:54:53,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:53,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:54:53,460 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:54:53,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d7a7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53, skipping insertion in model container [2018-11-23 10:54:53,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:54:53,508 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:54:53,765 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:53,772 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:54:53,804 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:53,820 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:54:53,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53 WrapperNode [2018-11-23 10:54:53,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:53,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:53,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:54:53,822 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:54:53,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:53,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:54:53,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:54:53,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:54:53,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (1/1) ... [2018-11-23 10:54:53,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:54:53,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:54:53,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:54:53,879 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:54:53,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:54:54,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:54:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:54:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:54:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:54:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:54:54,942 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:54:54,943 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:54:54,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:54 BoogieIcfgContainer [2018-11-23 10:54:54,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:54:54,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:54:54,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:54:54,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:54:54,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:54:53" (1/3) ... [2018-11-23 10:54:54,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc94895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:54, skipping insertion in model container [2018-11-23 10:54:54,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:53" (2/3) ... [2018-11-23 10:54:54,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc94895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:54, skipping insertion in model container [2018-11-23 10:54:54,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:54" (3/3) ... [2018-11-23 10:54:54,952 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:54,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:54:54,969 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:54:54,983 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:54:55,016 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:54:55,017 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:54:55,017 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:54:55,017 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:54:55,018 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:54:55,018 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:54:55,018 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:54:55,019 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:54:55,019 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:54:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 10:54:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:55,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:55,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:55,050 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:55,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:55,056 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2018-11-23 10:54:55,061 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:55,061 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:55,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:55,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:55,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2018-11-23 10:54:55,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 10:54:55,384 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {44#true} {44#true} #180#return; {44#true} is VALID [2018-11-23 10:54:55,385 INFO L256 TraceCheckUtils]: 3: Hoare triple {44#true} call #t~ret10 := main(); {44#true} is VALID [2018-11-23 10:54:55,385 INFO L273 TraceCheckUtils]: 4: Hoare triple {44#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;havoc ~cond~0; {44#true} is VALID [2018-11-23 10:54:55,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {44#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {44#true} is VALID [2018-11-23 10:54:55,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {44#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; {44#true} is VALID [2018-11-23 10:54:55,387 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:55,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:55,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:55,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:55,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:55,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:55,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:55,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:55,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:55,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:55,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {70#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {45#false} is VALID [2018-11-23 10:54:55,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {45#false} assume !false; {45#false} is VALID [2018-11-23 10:54:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:55,410 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:55,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:55,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:55,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:55,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:55,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:55,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:55,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:55,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:55,523 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-11-23 10:54:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:56,176 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2018-11-23 10:54:56,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:56,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 10:54:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 10:54:56,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2018-11-23 10:54:56,891 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:54:56,908 INFO L225 Difference]: With dead ends: 81 [2018-11-23 10:54:56,908 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 10:54:56,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 10:54:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-11-23 10:54:56,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:56,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 46 states. [2018-11-23 10:54:56,975 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 46 states. [2018-11-23 10:54:56,975 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 46 states. [2018-11-23 10:54:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:56,985 INFO L93 Difference]: Finished difference Result 66 states and 116 transitions. [2018-11-23 10:54:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 116 transitions. [2018-11-23 10:54:56,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:56,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:56,986 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 66 states. [2018-11-23 10:54:56,987 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 66 states. [2018-11-23 10:54:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:56,995 INFO L93 Difference]: Finished difference Result 66 states and 116 transitions. [2018-11-23 10:54:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 116 transitions. [2018-11-23 10:54:56,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:56,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:56,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:56,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 10:54:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2018-11-23 10:54:57,003 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2018-11-23 10:54:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:57,004 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2018-11-23 10:54:57,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2018-11-23 10:54:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:57,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:57,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:57,006 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:57,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2018-11-23 10:54:57,007 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:57,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:57,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:57,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {380#true} call ULTIMATE.init(); {380#true} is VALID [2018-11-23 10:54:57,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {380#true} assume true; {380#true} is VALID [2018-11-23 10:54:57,136 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {380#true} {380#true} #180#return; {380#true} is VALID [2018-11-23 10:54:57,136 INFO L256 TraceCheckUtils]: 3: Hoare triple {380#true} call #t~ret10 := main(); {380#true} is VALID [2018-11-23 10:54:57,136 INFO L273 TraceCheckUtils]: 4: Hoare triple {380#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;havoc ~cond~0; {380#true} is VALID [2018-11-23 10:54:57,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {380#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {380#true} is VALID [2018-11-23 10:54:57,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {380#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; {380#true} is VALID [2018-11-23 10:54:57,140 INFO L273 TraceCheckUtils]: 7: Hoare triple {380#true} assume !(0bv32 != ~p1~0); {406#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:57,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {406#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {406#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:57,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {406#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {406#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:57,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {406#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {406#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:57,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {406#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {406#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:57,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {406#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {406#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:57,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {406#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {406#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:57,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {406#(= (_ bv0 32) main_~p1~0)} assume !(0bv32 != ~p8~0); {406#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:57,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {406#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {406#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:57,150 INFO L273 TraceCheckUtils]: 16: Hoare triple {406#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {381#false} is VALID [2018-11-23 10:54:57,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {381#false} assume 1bv32 != ~lk1~0; {381#false} is VALID [2018-11-23 10:54:57,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {381#false} assume !false; {381#false} is VALID [2018-11-23 10:54:57,152 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:57,152 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:57,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:57,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:57,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:57,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:57,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:57,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:57,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:57,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:57,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:57,189 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2018-11-23 10:54:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:57,570 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2018-11-23 10:54:57,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:57,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-23 10:54:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-23 10:54:57,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2018-11-23 10:54:57,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:57,983 INFO L225 Difference]: With dead ends: 107 [2018-11-23 10:54:57,983 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 10:54:57,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 10:54:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-23 10:54:58,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:58,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2018-11-23 10:54:58,016 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2018-11-23 10:54:58,016 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2018-11-23 10:54:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,021 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2018-11-23 10:54:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 114 transitions. [2018-11-23 10:54:58,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:58,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:58,023 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2018-11-23 10:54:58,023 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2018-11-23 10:54:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,028 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2018-11-23 10:54:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 114 transitions. [2018-11-23 10:54:58,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:58,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:58,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:58,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 10:54:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2018-11-23 10:54:58,034 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2018-11-23 10:54:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:58,034 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2018-11-23 10:54:58,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2018-11-23 10:54:58,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:58,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:58,036 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] [2018-11-23 10:54:58,036 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:58,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:58,037 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2018-11-23 10:54:58,037 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:58,038 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:58,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:58,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:58,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {759#true} call ULTIMATE.init(); {759#true} is VALID [2018-11-23 10:54:58,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {759#true} assume true; {759#true} is VALID [2018-11-23 10:54:58,167 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {759#true} {759#true} #180#return; {759#true} is VALID [2018-11-23 10:54:58,168 INFO L256 TraceCheckUtils]: 3: Hoare triple {759#true} call #t~ret10 := main(); {759#true} is VALID [2018-11-23 10:54:58,168 INFO L273 TraceCheckUtils]: 4: Hoare triple {759#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;havoc ~cond~0; {759#true} is VALID [2018-11-23 10:54:58,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {759#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {759#true} is VALID [2018-11-23 10:54:58,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {759#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; {759#true} is VALID [2018-11-23 10:54:58,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {759#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {785#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:58,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {785#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {785#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:58,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {785#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {785#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:58,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {785#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {785#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:58,177 INFO L273 TraceCheckUtils]: 11: Hoare triple {785#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {785#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:58,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {785#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {785#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:58,181 INFO L273 TraceCheckUtils]: 13: Hoare triple {785#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {785#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:58,182 INFO L273 TraceCheckUtils]: 14: Hoare triple {785#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p8~0); {785#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:58,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {785#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {785#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:58,183 INFO L273 TraceCheckUtils]: 16: Hoare triple {785#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {760#false} is VALID [2018-11-23 10:54:58,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {760#false} assume 0bv32 != ~p2~0; {760#false} is VALID [2018-11-23 10:54:58,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {760#false} assume 1bv32 != ~lk2~0; {760#false} is VALID [2018-11-23 10:54:58,184 INFO L273 TraceCheckUtils]: 19: Hoare triple {760#false} assume !false; {760#false} is VALID [2018-11-23 10:54:58,185 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:58,185 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:58,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:58,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:58,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:58,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:58,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:58,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:58,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:58,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:58,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:58,226 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2018-11-23 10:54:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,454 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2018-11-23 10:54:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:58,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-23 10:54:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-23 10:54:58,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2018-11-23 10:54:58,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:58,767 INFO L225 Difference]: With dead ends: 99 [2018-11-23 10:54:58,767 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 10:54:58,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 10:54:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 10:54:58,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:58,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 10:54:58,828 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 10:54:58,828 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 10:54:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,832 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2018-11-23 10:54:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 116 transitions. [2018-11-23 10:54:58,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:58,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:58,834 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 10:54:58,834 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 10:54:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,838 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2018-11-23 10:54:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 116 transitions. [2018-11-23 10:54:58,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:58,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:58,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:58,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 10:54:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2018-11-23 10:54:58,843 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2018-11-23 10:54:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:58,843 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2018-11-23 10:54:58,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2018-11-23 10:54:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:58,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:58,845 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] [2018-11-23 10:54:58,845 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:58,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:58,845 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2018-11-23 10:54:58,846 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:58,846 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:58,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:58,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:58,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {1144#true} call ULTIMATE.init(); {1144#true} is VALID [2018-11-23 10:54:58,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {1144#true} assume true; {1144#true} is VALID [2018-11-23 10:54:58,971 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1144#true} {1144#true} #180#return; {1144#true} is VALID [2018-11-23 10:54:58,972 INFO L256 TraceCheckUtils]: 3: Hoare triple {1144#true} call #t~ret10 := main(); {1144#true} is VALID [2018-11-23 10:54:58,972 INFO L273 TraceCheckUtils]: 4: Hoare triple {1144#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;havoc ~cond~0; {1144#true} is VALID [2018-11-23 10:54:58,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {1144#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {1144#true} is VALID [2018-11-23 10:54:58,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {1144#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; {1144#true} is VALID [2018-11-23 10:54:58,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {1144#true} assume !(0bv32 != ~p1~0); {1144#true} is VALID [2018-11-23 10:54:58,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {1144#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,980 INFO L273 TraceCheckUtils]: 14: Hoare triple {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {1173#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {1145#false} is VALID [2018-11-23 10:54:58,985 INFO L273 TraceCheckUtils]: 19: Hoare triple {1145#false} assume !false; {1145#false} is VALID [2018-11-23 10:54:58,986 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:58,987 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:58,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:58,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:58,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:58,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:58,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:59,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:59,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:59,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:59,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:59,017 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2018-11-23 10:54:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,194 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2018-11-23 10:54:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:59,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 10:54:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 10:54:59,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-23 10:54:59,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:59,366 INFO L225 Difference]: With dead ends: 124 [2018-11-23 10:54:59,366 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 10:54:59,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 10:54:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2018-11-23 10:54:59,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:59,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 88 states. [2018-11-23 10:54:59,398 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 88 states. [2018-11-23 10:54:59,398 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 88 states. [2018-11-23 10:54:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,404 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2018-11-23 10:54:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 213 transitions. [2018-11-23 10:54:59,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:59,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:59,406 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 122 states. [2018-11-23 10:54:59,406 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 122 states. [2018-11-23 10:54:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,412 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2018-11-23 10:54:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 213 transitions. [2018-11-23 10:54:59,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:59,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:59,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:59,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 10:54:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2018-11-23 10:54:59,419 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2018-11-23 10:54:59,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:59,419 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2018-11-23 10:54:59,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2018-11-23 10:54:59,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:59,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:59,420 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] [2018-11-23 10:54:59,421 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:59,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:59,421 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2018-11-23 10:54:59,422 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:59,422 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:59,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:59,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:59,557 INFO L256 TraceCheckUtils]: 0: Hoare triple {1682#true} call ULTIMATE.init(); {1682#true} is VALID [2018-11-23 10:54:59,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {1682#true} assume true; {1682#true} is VALID [2018-11-23 10:54:59,558 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1682#true} {1682#true} #180#return; {1682#true} is VALID [2018-11-23 10:54:59,558 INFO L256 TraceCheckUtils]: 3: Hoare triple {1682#true} call #t~ret10 := main(); {1682#true} is VALID [2018-11-23 10:54:59,559 INFO L273 TraceCheckUtils]: 4: Hoare triple {1682#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;havoc ~cond~0; {1682#true} is VALID [2018-11-23 10:54:59,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {1682#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {1682#true} is VALID [2018-11-23 10:54:59,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {1682#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; {1682#true} is VALID [2018-11-23 10:54:59,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {1682#true} assume !(0bv32 != ~p1~0); {1682#true} is VALID [2018-11-23 10:54:59,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {1682#true} assume !(0bv32 != ~p2~0); {1711#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:59,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {1711#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1711#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:59,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {1711#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1711#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:59,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {1711#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1711#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:59,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {1711#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1711#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:59,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {1711#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1711#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:59,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {1711#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p8~0); {1711#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:59,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {1711#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1711#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:59,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {1711#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {1711#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:59,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {1711#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {1683#false} is VALID [2018-11-23 10:54:59,578 INFO L273 TraceCheckUtils]: 18: Hoare triple {1683#false} assume 1bv32 != ~lk2~0; {1683#false} is VALID [2018-11-23 10:54:59,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {1683#false} assume !false; {1683#false} is VALID [2018-11-23 10:54:59,580 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:59,580 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:59,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:59,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:59,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:59,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:59,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:59,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:59,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:59,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:59,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:59,610 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2018-11-23 10:54:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,810 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2018-11-23 10:54:59,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:59,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2018-11-23 10:54:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2018-11-23 10:54:59,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2018-11-23 10:55:00,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:00,162 INFO L225 Difference]: With dead ends: 204 [2018-11-23 10:55:00,162 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 10:55:00,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 10:55:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-23 10:55:00,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:00,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2018-11-23 10:55:00,192 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2018-11-23 10:55:00,192 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2018-11-23 10:55:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:00,197 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2018-11-23 10:55:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2018-11-23 10:55:00,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:00,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:00,199 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2018-11-23 10:55:00,199 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2018-11-23 10:55:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:00,205 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2018-11-23 10:55:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2018-11-23 10:55:00,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:00,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:00,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:00,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 10:55:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2018-11-23 10:55:00,211 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2018-11-23 10:55:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:00,212 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2018-11-23 10:55:00,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2018-11-23 10:55:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:55:00,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:00,213 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:55:00,213 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:00,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2018-11-23 10:55:00,214 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:00,214 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:55:00,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:00,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:00,334 INFO L256 TraceCheckUtils]: 0: Hoare triple {2342#true} call ULTIMATE.init(); {2342#true} is VALID [2018-11-23 10:55:00,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {2342#true} assume true; {2342#true} is VALID [2018-11-23 10:55:00,335 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2342#true} {2342#true} #180#return; {2342#true} is VALID [2018-11-23 10:55:00,335 INFO L256 TraceCheckUtils]: 3: Hoare triple {2342#true} call #t~ret10 := main(); {2342#true} is VALID [2018-11-23 10:55:00,336 INFO L273 TraceCheckUtils]: 4: Hoare triple {2342#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;havoc ~cond~0; {2342#true} is VALID [2018-11-23 10:55:00,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {2342#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {2342#true} is VALID [2018-11-23 10:55:00,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {2342#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; {2342#true} is VALID [2018-11-23 10:55:00,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {2342#true} assume !(0bv32 != ~p1~0); {2342#true} is VALID [2018-11-23 10:55:00,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {2342#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {2371#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:55:00,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {2371#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2371#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:55:00,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {2371#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2371#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:55:00,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {2371#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2371#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:55:00,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {2371#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2371#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:55:00,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {2371#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2371#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:55:00,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {2371#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p8~0); {2371#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:55:00,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {2371#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {2371#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:55:00,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {2371#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {2371#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:55:00,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {2371#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {2343#false} is VALID [2018-11-23 10:55:00,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {2343#false} assume 0bv32 != ~p3~0; {2343#false} is VALID [2018-11-23 10:55:00,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {2343#false} assume 1bv32 != ~lk3~0; {2343#false} is VALID [2018-11-23 10:55:00,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {2343#false} assume !false; {2343#false} is VALID [2018-11-23 10:55:00,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:55:00,356 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:00,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:00,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:00,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:55:00,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:00,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:00,381 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:55:00,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:00,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:00,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:00,383 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2018-11-23 10:55:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:00,579 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2018-11-23 10:55:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:00,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:55:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2018-11-23 10:55:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2018-11-23 10:55:00,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 165 transitions. [2018-11-23 10:55:00,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:00,846 INFO L225 Difference]: With dead ends: 183 [2018-11-23 10:55:00,846 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 10:55:00,847 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:55:00,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 10:55:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-11-23 10:55:00,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:00,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 124 states. [2018-11-23 10:55:00,881 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 124 states. [2018-11-23 10:55:00,882 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 124 states. [2018-11-23 10:55:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:00,886 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2018-11-23 10:55:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 211 transitions. [2018-11-23 10:55:00,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:00,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:00,887 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 126 states. [2018-11-23 10:55:00,887 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 126 states. [2018-11-23 10:55:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:00,893 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2018-11-23 10:55:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 211 transitions. [2018-11-23 10:55:00,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:00,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:00,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:00,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 10:55:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2018-11-23 10:55:00,899 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2018-11-23 10:55:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:00,899 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2018-11-23 10:55:00,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2018-11-23 10:55:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:55:00,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:00,900 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:55:00,901 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:00,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2018-11-23 10:55:00,901 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:00,901 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:55:00,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:00,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:01,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {2990#true} call ULTIMATE.init(); {2990#true} is VALID [2018-11-23 10:55:01,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {2990#true} assume true; {2990#true} is VALID [2018-11-23 10:55:01,019 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2990#true} {2990#true} #180#return; {2990#true} is VALID [2018-11-23 10:55:01,020 INFO L256 TraceCheckUtils]: 3: Hoare triple {2990#true} call #t~ret10 := main(); {2990#true} is VALID [2018-11-23 10:55:01,020 INFO L273 TraceCheckUtils]: 4: Hoare triple {2990#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;havoc ~cond~0; {2990#true} is VALID [2018-11-23 10:55:01,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {2990#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {2990#true} is VALID [2018-11-23 10:55:01,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {2990#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; {2990#true} is VALID [2018-11-23 10:55:01,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {2990#true} assume !(0bv32 != ~p1~0); {2990#true} is VALID [2018-11-23 10:55:01,022 INFO L273 TraceCheckUtils]: 8: Hoare triple {2990#true} assume !(0bv32 != ~p2~0); {2990#true} is VALID [2018-11-23 10:55:01,036 INFO L273 TraceCheckUtils]: 9: Hoare triple {2990#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:01,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:01,037 INFO L273 TraceCheckUtils]: 11: Hoare triple {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:01,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:01,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:01,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:01,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:01,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:01,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:01,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:01,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {3022#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {2991#false} is VALID [2018-11-23 10:55:01,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {2991#false} assume !false; {2991#false} is VALID [2018-11-23 10:55:01,044 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:01,044 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:01,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:01,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:01,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:55:01,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:01,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:01,119 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:55:01,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:01,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:01,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:01,121 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2018-11-23 10:55:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:01,421 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2018-11-23 10:55:01,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:01,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:55:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 10:55:01,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 10:55:01,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2018-11-23 10:55:01,625 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:01,631 INFO L225 Difference]: With dead ends: 228 [2018-11-23 10:55:01,631 INFO L226 Difference]: Without dead ends: 226 [2018-11-23 10:55:01,632 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:55:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-23 10:55:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2018-11-23 10:55:01,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:01,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand 168 states. [2018-11-23 10:55:01,967 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 168 states. [2018-11-23 10:55:01,967 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 168 states. [2018-11-23 10:55:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:01,977 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2018-11-23 10:55:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 387 transitions. [2018-11-23 10:55:01,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:01,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:01,978 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 226 states. [2018-11-23 10:55:01,978 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 226 states. [2018-11-23 10:55:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:01,988 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2018-11-23 10:55:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 387 transitions. [2018-11-23 10:55:01,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:01,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:01,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:01,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 10:55:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2018-11-23 10:55:01,996 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2018-11-23 10:55:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:01,997 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2018-11-23 10:55:01,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2018-11-23 10:55:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:55:01,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:01,998 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:55:01,998 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:01,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2018-11-23 10:55:01,999 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:01,999 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:55:02,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:02,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:02,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {3929#true} call ULTIMATE.init(); {3929#true} is VALID [2018-11-23 10:55:02,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {3929#true} assume true; {3929#true} is VALID [2018-11-23 10:55:02,131 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3929#true} {3929#true} #180#return; {3929#true} is VALID [2018-11-23 10:55:02,131 INFO L256 TraceCheckUtils]: 3: Hoare triple {3929#true} call #t~ret10 := main(); {3929#true} is VALID [2018-11-23 10:55:02,132 INFO L273 TraceCheckUtils]: 4: Hoare triple {3929#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;havoc ~cond~0; {3929#true} is VALID [2018-11-23 10:55:02,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {3929#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {3929#true} is VALID [2018-11-23 10:55:02,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {3929#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; {3929#true} is VALID [2018-11-23 10:55:02,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {3929#true} assume !(0bv32 != ~p1~0); {3929#true} is VALID [2018-11-23 10:55:02,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {3929#true} assume !(0bv32 != ~p2~0); {3929#true} is VALID [2018-11-23 10:55:02,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {3929#true} assume !(0bv32 != ~p3~0); {3961#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:55:02,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {3961#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3961#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:55:02,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {3961#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3961#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:55:02,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {3961#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3961#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:55:02,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {3961#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {3961#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:55:02,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {3961#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p8~0); {3961#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:55:02,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {3961#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {3961#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:55:02,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {3961#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {3961#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:55:02,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {3961#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {3961#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:55:02,138 INFO L273 TraceCheckUtils]: 18: Hoare triple {3961#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {3930#false} is VALID [2018-11-23 10:55:02,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {3930#false} assume 1bv32 != ~lk3~0; {3930#false} is VALID [2018-11-23 10:55:02,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {3930#false} assume !false; {3930#false} is VALID [2018-11-23 10:55:02,140 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:02,140 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:02,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:02,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:02,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:55:02,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:02,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:02,164 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:55:02,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:02,166 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2018-11-23 10:55:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:02,422 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2018-11-23 10:55:02,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:02,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:55:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2018-11-23 10:55:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2018-11-23 10:55:02,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2018-11-23 10:55:03,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:03,172 INFO L225 Difference]: With dead ends: 392 [2018-11-23 10:55:03,172 INFO L226 Difference]: Without dead ends: 234 [2018-11-23 10:55:03,173 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:55:03,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-23 10:55:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-11-23 10:55:03,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:03,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 232 states. [2018-11-23 10:55:03,242 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 232 states. [2018-11-23 10:55:03,242 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 232 states. [2018-11-23 10:55:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:03,251 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2018-11-23 10:55:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 387 transitions. [2018-11-23 10:55:03,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:03,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:03,252 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 234 states. [2018-11-23 10:55:03,252 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 234 states. [2018-11-23 10:55:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:03,260 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2018-11-23 10:55:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 387 transitions. [2018-11-23 10:55:03,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:03,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:03,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:03,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 10:55:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2018-11-23 10:55:03,268 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2018-11-23 10:55:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:03,269 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2018-11-23 10:55:03,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2018-11-23 10:55:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:55:03,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:03,270 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:55:03,270 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:03,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2018-11-23 10:55:03,271 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:03,271 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:55:03,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:03,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:03,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {5120#true} call ULTIMATE.init(); {5120#true} is VALID [2018-11-23 10:55:03,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {5120#true} assume true; {5120#true} is VALID [2018-11-23 10:55:03,412 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5120#true} {5120#true} #180#return; {5120#true} is VALID [2018-11-23 10:55:03,413 INFO L256 TraceCheckUtils]: 3: Hoare triple {5120#true} call #t~ret10 := main(); {5120#true} is VALID [2018-11-23 10:55:03,413 INFO L273 TraceCheckUtils]: 4: Hoare triple {5120#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;havoc ~cond~0; {5120#true} is VALID [2018-11-23 10:55:03,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {5120#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {5120#true} is VALID [2018-11-23 10:55:03,414 INFO L273 TraceCheckUtils]: 6: Hoare triple {5120#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; {5120#true} is VALID [2018-11-23 10:55:03,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {5120#true} assume !(0bv32 != ~p1~0); {5120#true} is VALID [2018-11-23 10:55:03,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {5120#true} assume !(0bv32 != ~p2~0); {5120#true} is VALID [2018-11-23 10:55:03,414 INFO L273 TraceCheckUtils]: 9: Hoare triple {5120#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {5152#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:55:03,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {5152#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {5152#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:55:03,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {5152#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {5152#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:55:03,415 INFO L273 TraceCheckUtils]: 12: Hoare triple {5152#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {5152#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:55:03,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {5152#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {5152#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:55:03,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {5152#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p8~0); {5152#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:55:03,417 INFO L273 TraceCheckUtils]: 15: Hoare triple {5152#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {5152#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:55:03,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {5152#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {5152#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:55:03,417 INFO L273 TraceCheckUtils]: 17: Hoare triple {5152#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {5152#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:55:03,418 INFO L273 TraceCheckUtils]: 18: Hoare triple {5152#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {5121#false} is VALID [2018-11-23 10:55:03,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {5121#false} assume 0bv32 != ~p4~0; {5121#false} is VALID [2018-11-23 10:55:03,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {5121#false} assume 1bv32 != ~lk4~0; {5121#false} is VALID [2018-11-23 10:55:03,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {5121#false} assume !false; {5121#false} is VALID [2018-11-23 10:55:03,419 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:03,420 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:03,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:03,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:03,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:03,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:03,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:03,447 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:55:03,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:03,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:03,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:03,448 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2018-11-23 10:55:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:03,767 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2018-11-23 10:55:03,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:03,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 10:55:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 10:55:03,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2018-11-23 10:55:04,491 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:55:04,496 INFO L225 Difference]: With dead ends: 348 [2018-11-23 10:55:04,496 INFO L226 Difference]: Without dead ends: 238 [2018-11-23 10:55:04,497 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:55:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-23 10:55:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-11-23 10:55:04,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:04,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 236 states. [2018-11-23 10:55:04,580 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 236 states. [2018-11-23 10:55:04,580 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 236 states. [2018-11-23 10:55:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:04,586 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2018-11-23 10:55:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 387 transitions. [2018-11-23 10:55:04,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:04,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:04,587 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 238 states. [2018-11-23 10:55:04,587 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 238 states. [2018-11-23 10:55:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:04,594 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2018-11-23 10:55:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 387 transitions. [2018-11-23 10:55:04,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:04,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:04,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:04,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-23 10:55:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2018-11-23 10:55:04,601 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2018-11-23 10:55:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:04,601 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2018-11-23 10:55:04,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2018-11-23 10:55:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:55:04,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:04,602 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:55:04,603 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:04,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2018-11-23 10:55:04,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:04,603 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:55:04,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:04,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:05,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {6282#true} call ULTIMATE.init(); {6282#true} is VALID [2018-11-23 10:55:05,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {6282#true} assume true; {6282#true} is VALID [2018-11-23 10:55:05,209 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6282#true} {6282#true} #180#return; {6282#true} is VALID [2018-11-23 10:55:05,209 INFO L256 TraceCheckUtils]: 3: Hoare triple {6282#true} call #t~ret10 := main(); {6282#true} is VALID [2018-11-23 10:55:05,209 INFO L273 TraceCheckUtils]: 4: Hoare triple {6282#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;havoc ~cond~0; {6282#true} is VALID [2018-11-23 10:55:05,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {6282#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {6282#true} is VALID [2018-11-23 10:55:05,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {6282#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; {6282#true} is VALID [2018-11-23 10:55:05,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {6282#true} assume !(0bv32 != ~p1~0); {6282#true} is VALID [2018-11-23 10:55:05,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {6282#true} assume !(0bv32 != ~p2~0); {6282#true} is VALID [2018-11-23 10:55:05,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {6282#true} assume !(0bv32 != ~p3~0); {6282#true} is VALID [2018-11-23 10:55:05,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {6282#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {6317#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {6283#false} is VALID [2018-11-23 10:55:05,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {6283#false} assume !false; {6283#false} is VALID [2018-11-23 10:55:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:55:05,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:05,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:05,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:05,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:05,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:05,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:05,254 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:55:05,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:05,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:05,255 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2018-11-23 10:55:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:05,721 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2018-11-23 10:55:05,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:05,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 10:55:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 10:55:05,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2018-11-23 10:55:05,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:05,845 INFO L225 Difference]: With dead ends: 428 [2018-11-23 10:55:05,845 INFO L226 Difference]: Without dead ends: 426 [2018-11-23 10:55:05,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:55:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-23 10:55:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2018-11-23 10:55:05,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:05,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 426 states. Second operand 328 states. [2018-11-23 10:55:05,949 INFO L74 IsIncluded]: Start isIncluded. First operand 426 states. Second operand 328 states. [2018-11-23 10:55:05,949 INFO L87 Difference]: Start difference. First operand 426 states. Second operand 328 states. [2018-11-23 10:55:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:05,961 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2018-11-23 10:55:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 703 transitions. [2018-11-23 10:55:05,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:05,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:05,963 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand 426 states. [2018-11-23 10:55:05,963 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 426 states. [2018-11-23 10:55:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:05,975 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2018-11-23 10:55:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 703 transitions. [2018-11-23 10:55:05,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:05,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:05,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:05,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-23 10:55:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2018-11-23 10:55:05,981 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2018-11-23 10:55:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:05,982 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2018-11-23 10:55:05,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2018-11-23 10:55:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:55:05,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:05,983 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:55:05,983 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:05,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2018-11-23 10:55:05,983 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:05,984 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:55:06,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:06,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:06,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {7996#true} call ULTIMATE.init(); {7996#true} is VALID [2018-11-23 10:55:06,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {7996#true} assume true; {7996#true} is VALID [2018-11-23 10:55:06,083 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7996#true} {7996#true} #180#return; {7996#true} is VALID [2018-11-23 10:55:06,083 INFO L256 TraceCheckUtils]: 3: Hoare triple {7996#true} call #t~ret10 := main(); {7996#true} is VALID [2018-11-23 10:55:06,084 INFO L273 TraceCheckUtils]: 4: Hoare triple {7996#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;havoc ~cond~0; {7996#true} is VALID [2018-11-23 10:55:06,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {7996#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {7996#true} is VALID [2018-11-23 10:55:06,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {7996#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; {7996#true} is VALID [2018-11-23 10:55:06,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {7996#true} assume !(0bv32 != ~p1~0); {7996#true} is VALID [2018-11-23 10:55:06,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {7996#true} assume !(0bv32 != ~p2~0); {7996#true} is VALID [2018-11-23 10:55:06,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {7996#true} assume !(0bv32 != ~p3~0); {7996#true} is VALID [2018-11-23 10:55:06,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {7996#true} assume !(0bv32 != ~p4~0); {8031#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:55:06,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {8031#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {8031#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:55:06,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {8031#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {8031#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:55:06,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {8031#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {8031#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:55:06,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {8031#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p8~0); {8031#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:55:06,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {8031#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {8031#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:55:06,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {8031#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {8031#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:55:06,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {8031#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {8031#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:55:06,089 INFO L273 TraceCheckUtils]: 18: Hoare triple {8031#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {8031#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:55:06,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {8031#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {7997#false} is VALID [2018-11-23 10:55:06,090 INFO L273 TraceCheckUtils]: 20: Hoare triple {7997#false} assume 1bv32 != ~lk4~0; {7997#false} is VALID [2018-11-23 10:55:06,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {7997#false} assume !false; {7997#false} is VALID [2018-11-23 10:55:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:55:06,092 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:06,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:06,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:06,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:06,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:06,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:06,115 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:55:06,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:06,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:06,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:06,116 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2018-11-23 10:55:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:06,471 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2018-11-23 10:55:06,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:06,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-23 10:55:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-23 10:55:06,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2018-11-23 10:55:06,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:06,671 INFO L225 Difference]: With dead ends: 764 [2018-11-23 10:55:06,671 INFO L226 Difference]: Without dead ends: 450 [2018-11-23 10:55:06,672 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:55:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-23 10:55:06,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2018-11-23 10:55:06,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:06,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand 448 states. [2018-11-23 10:55:06,868 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand 448 states. [2018-11-23 10:55:06,868 INFO L87 Difference]: Start difference. First operand 450 states. Second operand 448 states. [2018-11-23 10:55:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:06,882 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2018-11-23 10:55:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 711 transitions. [2018-11-23 10:55:06,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:06,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:06,884 INFO L74 IsIncluded]: Start isIncluded. First operand 448 states. Second operand 450 states. [2018-11-23 10:55:06,884 INFO L87 Difference]: Start difference. First operand 448 states. Second operand 450 states. [2018-11-23 10:55:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:06,899 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2018-11-23 10:55:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 711 transitions. [2018-11-23 10:55:06,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:06,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:06,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:06,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-11-23 10:55:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2018-11-23 10:55:06,913 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2018-11-23 10:55:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:06,913 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2018-11-23 10:55:06,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2018-11-23 10:55:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:55:06,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:06,915 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:55:06,915 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:06,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2018-11-23 10:55:06,915 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:06,916 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:55:06,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:06,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:06,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {10230#true} call ULTIMATE.init(); {10230#true} is VALID [2018-11-23 10:55:06,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {10230#true} assume true; {10230#true} is VALID [2018-11-23 10:55:07,000 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10230#true} {10230#true} #180#return; {10230#true} is VALID [2018-11-23 10:55:07,000 INFO L256 TraceCheckUtils]: 3: Hoare triple {10230#true} call #t~ret10 := main(); {10230#true} is VALID [2018-11-23 10:55:07,000 INFO L273 TraceCheckUtils]: 4: Hoare triple {10230#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;havoc ~cond~0; {10230#true} is VALID [2018-11-23 10:55:07,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {10230#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {10230#true} is VALID [2018-11-23 10:55:07,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {10230#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; {10230#true} is VALID [2018-11-23 10:55:07,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {10230#true} assume !(0bv32 != ~p1~0); {10230#true} is VALID [2018-11-23 10:55:07,001 INFO L273 TraceCheckUtils]: 8: Hoare triple {10230#true} assume !(0bv32 != ~p2~0); {10230#true} is VALID [2018-11-23 10:55:07,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {10230#true} assume !(0bv32 != ~p3~0); {10230#true} is VALID [2018-11-23 10:55:07,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {10230#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {10265#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:55:07,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {10265#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {10265#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:55:07,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {10265#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {10265#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:55:07,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {10265#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {10265#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:55:07,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {10265#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p8~0); {10265#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:55:07,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {10265#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {10265#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:55:07,029 INFO L273 TraceCheckUtils]: 16: Hoare triple {10265#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {10265#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:55:07,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {10265#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {10265#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:55:07,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {10265#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {10265#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:55:07,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {10265#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {10231#false} is VALID [2018-11-23 10:55:07,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {10231#false} assume 0bv32 != ~p5~0; {10231#false} is VALID [2018-11-23 10:55:07,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {10231#false} assume 1bv32 != ~lk5~0; {10231#false} is VALID [2018-11-23 10:55:07,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {10231#false} assume !false; {10231#false} is VALID [2018-11-23 10:55:07,069 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:07,070 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (13)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:55:07,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:07,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:07,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:07,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:07,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:07,106 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:55:07,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:07,107 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2018-11-23 10:55:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:08,498 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2018-11-23 10:55:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:08,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2018-11-23 10:55:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2018-11-23 10:55:08,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2018-11-23 10:55:08,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:08,673 INFO L225 Difference]: With dead ends: 672 [2018-11-23 10:55:08,673 INFO L226 Difference]: Without dead ends: 458 [2018-11-23 10:55:08,674 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:55:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-23 10:55:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2018-11-23 10:55:08,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:08,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand 456 states. [2018-11-23 10:55:08,866 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand 456 states. [2018-11-23 10:55:08,866 INFO L87 Difference]: Start difference. First operand 458 states. Second operand 456 states. [2018-11-23 10:55:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:08,879 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2018-11-23 10:55:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 711 transitions. [2018-11-23 10:55:08,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:08,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:08,881 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 458 states. [2018-11-23 10:55:08,881 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 458 states. [2018-11-23 10:55:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:08,894 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2018-11-23 10:55:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 711 transitions. [2018-11-23 10:55:08,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:08,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:08,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:08,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 10:55:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2018-11-23 10:55:08,909 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2018-11-23 10:55:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:08,910 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2018-11-23 10:55:08,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2018-11-23 10:55:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:55:08,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:08,911 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:55:08,911 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:08,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:08,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2018-11-23 10:55:08,912 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:08,912 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:55:08,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:08,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:09,045 INFO L256 TraceCheckUtils]: 0: Hoare triple {12399#true} call ULTIMATE.init(); {12399#true} is VALID [2018-11-23 10:55:09,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {12399#true} assume true; {12399#true} is VALID [2018-11-23 10:55:09,046 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12399#true} {12399#true} #180#return; {12399#true} is VALID [2018-11-23 10:55:09,046 INFO L256 TraceCheckUtils]: 3: Hoare triple {12399#true} call #t~ret10 := main(); {12399#true} is VALID [2018-11-23 10:55:09,046 INFO L273 TraceCheckUtils]: 4: Hoare triple {12399#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;havoc ~cond~0; {12399#true} is VALID [2018-11-23 10:55:09,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {12399#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {12399#true} is VALID [2018-11-23 10:55:09,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {12399#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; {12399#true} is VALID [2018-11-23 10:55:09,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {12399#true} assume !(0bv32 != ~p1~0); {12399#true} is VALID [2018-11-23 10:55:09,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {12399#true} assume !(0bv32 != ~p2~0); {12399#true} is VALID [2018-11-23 10:55:09,047 INFO L273 TraceCheckUtils]: 9: Hoare triple {12399#true} assume !(0bv32 != ~p3~0); {12399#true} is VALID [2018-11-23 10:55:09,047 INFO L273 TraceCheckUtils]: 10: Hoare triple {12399#true} assume !(0bv32 != ~p4~0); {12399#true} is VALID [2018-11-23 10:55:09,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {12399#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:09,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:09,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:09,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:09,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:09,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:09,050 INFO L273 TraceCheckUtils]: 17: Hoare triple {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:09,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:09,051 INFO L273 TraceCheckUtils]: 19: Hoare triple {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:09,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:09,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {12437#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {12400#false} is VALID [2018-11-23 10:55:09,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {12400#false} assume !false; {12400#false} is VALID [2018-11-23 10:55:09,053 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:09,053 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (14)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:55:09,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:09,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:09,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:09,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:09,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:09,082 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:55:09,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:09,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:09,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:09,083 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2018-11-23 10:55:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:09,677 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2018-11-23 10:55:09,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:09,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 10:55:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 10:55:09,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 10:55:09,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:09,814 INFO L225 Difference]: With dead ends: 812 [2018-11-23 10:55:09,814 INFO L226 Difference]: Without dead ends: 810 [2018-11-23 10:55:09,814 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:55:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-23 10:55:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2018-11-23 10:55:09,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:09,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 810 states. Second operand 648 states. [2018-11-23 10:55:09,977 INFO L74 IsIncluded]: Start isIncluded. First operand 810 states. Second operand 648 states. [2018-11-23 10:55:09,978 INFO L87 Difference]: Start difference. First operand 810 states. Second operand 648 states. [2018-11-23 10:55:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:10,005 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2018-11-23 10:55:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1271 transitions. [2018-11-23 10:55:10,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:10,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:10,008 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand 810 states. [2018-11-23 10:55:10,008 INFO L87 Difference]: Start difference. First operand 648 states. Second operand 810 states. [2018-11-23 10:55:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:10,047 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2018-11-23 10:55:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1271 transitions. [2018-11-23 10:55:10,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:10,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:10,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:10,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-23 10:55:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2018-11-23 10:55:10,075 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2018-11-23 10:55:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:10,076 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2018-11-23 10:55:10,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2018-11-23 10:55:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:55:10,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:10,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:10,078 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:10,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2018-11-23 10:55:10,079 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:10,079 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:55:10,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:10,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:10,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {15612#true} call ULTIMATE.init(); {15612#true} is VALID [2018-11-23 10:55:10,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {15612#true} assume true; {15612#true} is VALID [2018-11-23 10:55:10,180 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15612#true} {15612#true} #180#return; {15612#true} is VALID [2018-11-23 10:55:10,180 INFO L256 TraceCheckUtils]: 3: Hoare triple {15612#true} call #t~ret10 := main(); {15612#true} is VALID [2018-11-23 10:55:10,180 INFO L273 TraceCheckUtils]: 4: Hoare triple {15612#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;havoc ~cond~0; {15612#true} is VALID [2018-11-23 10:55:10,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {15612#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {15612#true} is VALID [2018-11-23 10:55:10,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {15612#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; {15612#true} is VALID [2018-11-23 10:55:10,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {15612#true} assume !(0bv32 != ~p1~0); {15612#true} is VALID [2018-11-23 10:55:10,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {15612#true} assume !(0bv32 != ~p2~0); {15612#true} is VALID [2018-11-23 10:55:10,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {15612#true} assume !(0bv32 != ~p3~0); {15612#true} is VALID [2018-11-23 10:55:10,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {15612#true} assume !(0bv32 != ~p4~0); {15612#true} is VALID [2018-11-23 10:55:10,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {15612#true} assume !(0bv32 != ~p5~0); {15650#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:10,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {15650#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {15650#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:10,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {15650#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {15650#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:10,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {15650#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p8~0); {15650#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:10,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {15650#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {15650#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:10,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {15650#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {15650#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:10,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {15650#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {15650#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:10,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {15650#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {15650#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:10,192 INFO L273 TraceCheckUtils]: 19: Hoare triple {15650#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {15650#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:10,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {15650#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {15613#false} is VALID [2018-11-23 10:55:10,193 INFO L273 TraceCheckUtils]: 21: Hoare triple {15613#false} assume 1bv32 != ~lk5~0; {15613#false} is VALID [2018-11-23 10:55:10,193 INFO L273 TraceCheckUtils]: 22: Hoare triple {15613#false} assume !false; {15613#false} is VALID [2018-11-23 10:55:10,194 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:10,194 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:10,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:10,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:10,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:10,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:10,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:10,246 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:55:10,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:10,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:10,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:10,247 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2018-11-23 10:55:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:10,952 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2018-11-23 10:55:10,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:10,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2018-11-23 10:55:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2018-11-23 10:55:10,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2018-11-23 10:55:11,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:11,205 INFO L225 Difference]: With dead ends: 1500 [2018-11-23 10:55:11,205 INFO L226 Difference]: Without dead ends: 874 [2018-11-23 10:55:11,206 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:55:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-23 10:55:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2018-11-23 10:55:11,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:11,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 874 states. Second operand 872 states. [2018-11-23 10:55:11,839 INFO L74 IsIncluded]: Start isIncluded. First operand 874 states. Second operand 872 states. [2018-11-23 10:55:11,839 INFO L87 Difference]: Start difference. First operand 874 states. Second operand 872 states. [2018-11-23 10:55:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:11,867 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2018-11-23 10:55:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1303 transitions. [2018-11-23 10:55:11,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:11,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:11,869 INFO L74 IsIncluded]: Start isIncluded. First operand 872 states. Second operand 874 states. [2018-11-23 10:55:11,869 INFO L87 Difference]: Start difference. First operand 872 states. Second operand 874 states. [2018-11-23 10:55:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:11,909 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2018-11-23 10:55:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1303 transitions. [2018-11-23 10:55:11,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:11,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:11,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:11,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-23 10:55:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2018-11-23 10:55:11,953 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2018-11-23 10:55:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:11,953 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2018-11-23 10:55:11,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2018-11-23 10:55:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:55:11,954 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:11,954 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:55:11,955 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:11,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:11,955 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2018-11-23 10:55:11,955 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:11,955 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:55:11,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:12,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:12,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {19897#true} call ULTIMATE.init(); {19897#true} is VALID [2018-11-23 10:55:12,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {19897#true} assume true; {19897#true} is VALID [2018-11-23 10:55:12,068 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19897#true} {19897#true} #180#return; {19897#true} is VALID [2018-11-23 10:55:12,068 INFO L256 TraceCheckUtils]: 3: Hoare triple {19897#true} call #t~ret10 := main(); {19897#true} is VALID [2018-11-23 10:55:12,069 INFO L273 TraceCheckUtils]: 4: Hoare triple {19897#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;havoc ~cond~0; {19897#true} is VALID [2018-11-23 10:55:12,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {19897#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {19897#true} is VALID [2018-11-23 10:55:12,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {19897#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; {19897#true} is VALID [2018-11-23 10:55:12,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {19897#true} assume !(0bv32 != ~p1~0); {19897#true} is VALID [2018-11-23 10:55:12,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {19897#true} assume !(0bv32 != ~p2~0); {19897#true} is VALID [2018-11-23 10:55:12,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {19897#true} assume !(0bv32 != ~p3~0); {19897#true} is VALID [2018-11-23 10:55:12,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {19897#true} assume !(0bv32 != ~p4~0); {19897#true} is VALID [2018-11-23 10:55:12,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {19897#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {19935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:12,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {19935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {19935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:12,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {19935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {19935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:12,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {19935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p8~0); {19935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:12,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {19935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {19935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:12,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {19935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p1~0); {19935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:12,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {19935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p2~0); {19935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:12,080 INFO L273 TraceCheckUtils]: 18: Hoare triple {19935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p3~0); {19935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:12,080 INFO L273 TraceCheckUtils]: 19: Hoare triple {19935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p4~0); {19935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:12,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {19935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p5~0); {19898#false} is VALID [2018-11-23 10:55:12,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {19898#false} assume 0bv32 != ~p6~0; {19898#false} is VALID [2018-11-23 10:55:12,083 INFO L273 TraceCheckUtils]: 22: Hoare triple {19898#false} assume 1bv32 != ~lk6~0; {19898#false} is VALID [2018-11-23 10:55:12,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {19898#false} assume !false; {19898#false} is VALID [2018-11-23 10:55:12,084 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:12,084 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:12,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:12,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:12,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:12,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:12,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:12,117 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:55:12,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:12,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:12,118 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2018-11-23 10:55:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:13,099 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2018-11-23 10:55:13,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:13,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-23 10:55:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-23 10:55:13,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2018-11-23 10:55:13,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:13,335 INFO L225 Difference]: With dead ends: 1308 [2018-11-23 10:55:13,335 INFO L226 Difference]: Without dead ends: 890 [2018-11-23 10:55:13,336 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:55:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-11-23 10:55:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2018-11-23 10:55:13,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:13,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 890 states. Second operand 888 states. [2018-11-23 10:55:13,633 INFO L74 IsIncluded]: Start isIncluded. First operand 890 states. Second operand 888 states. [2018-11-23 10:55:13,633 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 888 states. [2018-11-23 10:55:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:13,666 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2018-11-23 10:55:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1303 transitions. [2018-11-23 10:55:13,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:13,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:13,667 INFO L74 IsIncluded]: Start isIncluded. First operand 888 states. Second operand 890 states. [2018-11-23 10:55:13,667 INFO L87 Difference]: Start difference. First operand 888 states. Second operand 890 states. [2018-11-23 10:55:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:13,696 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2018-11-23 10:55:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1303 transitions. [2018-11-23 10:55:13,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:13,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:13,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:13,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-11-23 10:55:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2018-11-23 10:55:13,723 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2018-11-23 10:55:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:13,723 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2018-11-23 10:55:13,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2018-11-23 10:55:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:55:13,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:13,724 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:55:13,725 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:13,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2018-11-23 10:55:13,725 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:13,725 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:55:13,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:13,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:13,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {24041#true} call ULTIMATE.init(); {24041#true} is VALID [2018-11-23 10:55:13,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {24041#true} assume true; {24041#true} is VALID [2018-11-23 10:55:13,813 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24041#true} {24041#true} #180#return; {24041#true} is VALID [2018-11-23 10:55:13,813 INFO L256 TraceCheckUtils]: 3: Hoare triple {24041#true} call #t~ret10 := main(); {24041#true} is VALID [2018-11-23 10:55:13,813 INFO L273 TraceCheckUtils]: 4: Hoare triple {24041#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;havoc ~cond~0; {24041#true} is VALID [2018-11-23 10:55:13,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {24041#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {24041#true} is VALID [2018-11-23 10:55:13,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {24041#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; {24041#true} is VALID [2018-11-23 10:55:13,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {24041#true} assume !(0bv32 != ~p1~0); {24041#true} is VALID [2018-11-23 10:55:13,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {24041#true} assume !(0bv32 != ~p2~0); {24041#true} is VALID [2018-11-23 10:55:13,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {24041#true} assume !(0bv32 != ~p3~0); {24041#true} is VALID [2018-11-23 10:55:13,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {24041#true} assume !(0bv32 != ~p4~0); {24041#true} is VALID [2018-11-23 10:55:13,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {24041#true} assume !(0bv32 != ~p5~0); {24041#true} is VALID [2018-11-23 10:55:13,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {24041#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:13,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:13,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:13,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:13,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:13,823 INFO L273 TraceCheckUtils]: 17: Hoare triple {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:13,824 INFO L273 TraceCheckUtils]: 18: Hoare triple {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:13,824 INFO L273 TraceCheckUtils]: 19: Hoare triple {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:13,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:13,827 INFO L273 TraceCheckUtils]: 21: Hoare triple {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0; {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:13,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {24082#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk6~0; {24042#false} is VALID [2018-11-23 10:55:13,829 INFO L273 TraceCheckUtils]: 23: Hoare triple {24042#false} assume !false; {24042#false} is VALID [2018-11-23 10:55:13,829 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:13,830 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:13,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:13,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:13,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:13,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:13,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:13,856 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:55:13,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:13,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:13,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:13,857 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2018-11-23 10:55:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:14,580 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2018-11-23 10:55:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:14,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 10:55:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 10:55:14,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-23 10:55:14,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:14,788 INFO L225 Difference]: With dead ends: 1548 [2018-11-23 10:55:14,788 INFO L226 Difference]: Without dead ends: 1546 [2018-11-23 10:55:14,789 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:55:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-11-23 10:55:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2018-11-23 10:55:15,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:15,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1546 states. Second operand 1288 states. [2018-11-23 10:55:15,708 INFO L74 IsIncluded]: Start isIncluded. First operand 1546 states. Second operand 1288 states. [2018-11-23 10:55:15,708 INFO L87 Difference]: Start difference. First operand 1546 states. Second operand 1288 states. [2018-11-23 10:55:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:15,805 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2018-11-23 10:55:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2279 transitions. [2018-11-23 10:55:15,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:15,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:15,807 INFO L74 IsIncluded]: Start isIncluded. First operand 1288 states. Second operand 1546 states. [2018-11-23 10:55:15,807 INFO L87 Difference]: Start difference. First operand 1288 states. Second operand 1546 states. [2018-11-23 10:55:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:15,900 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2018-11-23 10:55:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2279 transitions. [2018-11-23 10:55:15,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:15,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:15,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:15,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-11-23 10:55:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2018-11-23 10:55:15,975 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2018-11-23 10:55:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:15,975 INFO L480 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2018-11-23 10:55:15,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2018-11-23 10:55:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:55:15,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:15,977 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:55:15,977 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:15,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2018-11-23 10:55:15,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:15,977 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:55:15,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:16,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:16,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {30153#true} call ULTIMATE.init(); {30153#true} is VALID [2018-11-23 10:55:16,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {30153#true} assume true; {30153#true} is VALID [2018-11-23 10:55:16,077 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {30153#true} {30153#true} #180#return; {30153#true} is VALID [2018-11-23 10:55:16,077 INFO L256 TraceCheckUtils]: 3: Hoare triple {30153#true} call #t~ret10 := main(); {30153#true} is VALID [2018-11-23 10:55:16,077 INFO L273 TraceCheckUtils]: 4: Hoare triple {30153#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;havoc ~cond~0; {30153#true} is VALID [2018-11-23 10:55:16,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {30153#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {30153#true} is VALID [2018-11-23 10:55:16,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {30153#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; {30153#true} is VALID [2018-11-23 10:55:16,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {30153#true} assume !(0bv32 != ~p1~0); {30153#true} is VALID [2018-11-23 10:55:16,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {30153#true} assume !(0bv32 != ~p2~0); {30153#true} is VALID [2018-11-23 10:55:16,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {30153#true} assume !(0bv32 != ~p3~0); {30153#true} is VALID [2018-11-23 10:55:16,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {30153#true} assume !(0bv32 != ~p4~0); {30153#true} is VALID [2018-11-23 10:55:16,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {30153#true} assume !(0bv32 != ~p5~0); {30153#true} is VALID [2018-11-23 10:55:16,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {30153#true} assume !(0bv32 != ~p6~0); {30194#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:16,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {30194#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {30194#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:16,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {30194#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p8~0); {30194#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:16,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {30194#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {30194#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:16,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {30194#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p1~0); {30194#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:16,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {30194#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p2~0); {30194#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:16,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {30194#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p3~0); {30194#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:16,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {30194#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p4~0); {30194#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:16,082 INFO L273 TraceCheckUtils]: 20: Hoare triple {30194#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p5~0); {30194#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:16,082 INFO L273 TraceCheckUtils]: 21: Hoare triple {30194#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p6~0; {30154#false} is VALID [2018-11-23 10:55:16,082 INFO L273 TraceCheckUtils]: 22: Hoare triple {30154#false} assume 1bv32 != ~lk6~0; {30154#false} is VALID [2018-11-23 10:55:16,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {30154#false} assume !false; {30154#false} is VALID [2018-11-23 10:55:16,083 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:16,083 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:16,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:16,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:16,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:16,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:16,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:16,108 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:55:16,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:16,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:16,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:16,109 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2018-11-23 10:55:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:17,278 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2018-11-23 10:55:17,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:17,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 10:55:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 10:55:17,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2018-11-23 10:55:17,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:17,561 INFO L225 Difference]: With dead ends: 2956 [2018-11-23 10:55:17,561 INFO L226 Difference]: Without dead ends: 1706 [2018-11-23 10:55:17,563 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:55:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-11-23 10:55:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2018-11-23 10:55:18,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:18,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1706 states. Second operand 1704 states. [2018-11-23 10:55:18,588 INFO L74 IsIncluded]: Start isIncluded. First operand 1706 states. Second operand 1704 states. [2018-11-23 10:55:18,588 INFO L87 Difference]: Start difference. First operand 1706 states. Second operand 1704 states. [2018-11-23 10:55:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:18,675 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2018-11-23 10:55:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2375 transitions. [2018-11-23 10:55:18,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:18,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:18,677 INFO L74 IsIncluded]: Start isIncluded. First operand 1704 states. Second operand 1706 states. [2018-11-23 10:55:18,677 INFO L87 Difference]: Start difference. First operand 1704 states. Second operand 1706 states. [2018-11-23 10:55:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:18,775 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2018-11-23 10:55:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2375 transitions. [2018-11-23 10:55:18,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:18,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:18,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:18,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2018-11-23 10:55:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2018-11-23 10:55:18,870 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2018-11-23 10:55:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:18,870 INFO L480 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2018-11-23 10:55:18,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2018-11-23 10:55:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:55:18,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:18,872 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:55:18,872 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:18,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:18,872 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2018-11-23 10:55:18,873 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:18,873 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:55:18,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:18,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:18,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {38473#true} call ULTIMATE.init(); {38473#true} is VALID [2018-11-23 10:55:18,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {38473#true} assume true; {38473#true} is VALID [2018-11-23 10:55:18,967 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {38473#true} {38473#true} #180#return; {38473#true} is VALID [2018-11-23 10:55:18,968 INFO L256 TraceCheckUtils]: 3: Hoare triple {38473#true} call #t~ret10 := main(); {38473#true} is VALID [2018-11-23 10:55:18,968 INFO L273 TraceCheckUtils]: 4: Hoare triple {38473#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;havoc ~cond~0; {38473#true} is VALID [2018-11-23 10:55:18,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {38473#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {38473#true} is VALID [2018-11-23 10:55:18,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {38473#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; {38473#true} is VALID [2018-11-23 10:55:18,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {38473#true} assume !(0bv32 != ~p1~0); {38473#true} is VALID [2018-11-23 10:55:18,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {38473#true} assume !(0bv32 != ~p2~0); {38473#true} is VALID [2018-11-23 10:55:18,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {38473#true} assume !(0bv32 != ~p3~0); {38473#true} is VALID [2018-11-23 10:55:18,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {38473#true} assume !(0bv32 != ~p4~0); {38473#true} is VALID [2018-11-23 10:55:18,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {38473#true} assume !(0bv32 != ~p5~0); {38473#true} is VALID [2018-11-23 10:55:18,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {38473#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {38514#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:18,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {38514#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {38514#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:18,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {38514#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p8~0); {38514#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:18,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {38514#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {38514#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:18,983 INFO L273 TraceCheckUtils]: 16: Hoare triple {38514#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p1~0); {38514#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:18,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {38514#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p2~0); {38514#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:18,984 INFO L273 TraceCheckUtils]: 18: Hoare triple {38514#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p3~0); {38514#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:18,985 INFO L273 TraceCheckUtils]: 19: Hoare triple {38514#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p4~0); {38514#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:18,985 INFO L273 TraceCheckUtils]: 20: Hoare triple {38514#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p5~0); {38514#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:18,985 INFO L273 TraceCheckUtils]: 21: Hoare triple {38514#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p6~0); {38474#false} is VALID [2018-11-23 10:55:18,986 INFO L273 TraceCheckUtils]: 22: Hoare triple {38474#false} assume 0bv32 != ~p7~0; {38474#false} is VALID [2018-11-23 10:55:18,986 INFO L273 TraceCheckUtils]: 23: Hoare triple {38474#false} assume 1bv32 != ~lk7~0; {38474#false} is VALID [2018-11-23 10:55:18,986 INFO L273 TraceCheckUtils]: 24: Hoare triple {38474#false} assume !false; {38474#false} is VALID [2018-11-23 10:55:18,987 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:18,987 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:18,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:18,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:18,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:18,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:18,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:19,020 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:55:19,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:19,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:19,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:19,022 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2018-11-23 10:55:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:20,752 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2018-11-23 10:55:20,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:20,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:20,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-23 10:55:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:20,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-23 10:55:20,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2018-11-23 10:55:20,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:21,032 INFO L225 Difference]: With dead ends: 2556 [2018-11-23 10:55:21,032 INFO L226 Difference]: Without dead ends: 1738 [2018-11-23 10:55:21,033 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:55:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-23 10:55:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2018-11-23 10:55:21,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:21,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1738 states. Second operand 1736 states. [2018-11-23 10:55:21,544 INFO L74 IsIncluded]: Start isIncluded. First operand 1738 states. Second operand 1736 states. [2018-11-23 10:55:21,544 INFO L87 Difference]: Start difference. First operand 1738 states. Second operand 1736 states. [2018-11-23 10:55:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:21,645 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2018-11-23 10:55:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2375 transitions. [2018-11-23 10:55:21,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:21,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:21,647 INFO L74 IsIncluded]: Start isIncluded. First operand 1736 states. Second operand 1738 states. [2018-11-23 10:55:21,647 INFO L87 Difference]: Start difference. First operand 1736 states. Second operand 1738 states. [2018-11-23 10:55:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:21,734 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2018-11-23 10:55:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2375 transitions. [2018-11-23 10:55:21,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:21,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:21,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:21,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2018-11-23 10:55:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2018-11-23 10:55:21,865 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2018-11-23 10:55:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:21,865 INFO L480 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2018-11-23 10:55:21,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2018-11-23 10:55:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:55:21,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:21,867 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:55:21,867 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:21,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2018-11-23 10:55:21,868 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:21,868 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:55:21,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:21,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:21,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {46492#true} call ULTIMATE.init(); {46492#true} is VALID [2018-11-23 10:55:21,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {46492#true} assume true; {46492#true} is VALID [2018-11-23 10:55:21,957 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {46492#true} {46492#true} #180#return; {46492#true} is VALID [2018-11-23 10:55:21,957 INFO L256 TraceCheckUtils]: 3: Hoare triple {46492#true} call #t~ret10 := main(); {46492#true} is VALID [2018-11-23 10:55:21,958 INFO L273 TraceCheckUtils]: 4: Hoare triple {46492#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;havoc ~cond~0; {46492#true} is VALID [2018-11-23 10:55:21,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {46492#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {46492#true} is VALID [2018-11-23 10:55:21,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {46492#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; {46492#true} is VALID [2018-11-23 10:55:21,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {46492#true} assume !(0bv32 != ~p1~0); {46492#true} is VALID [2018-11-23 10:55:21,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {46492#true} assume !(0bv32 != ~p2~0); {46492#true} is VALID [2018-11-23 10:55:21,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {46492#true} assume !(0bv32 != ~p3~0); {46492#true} is VALID [2018-11-23 10:55:21,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {46492#true} assume !(0bv32 != ~p4~0); {46492#true} is VALID [2018-11-23 10:55:21,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {46492#true} assume !(0bv32 != ~p5~0); {46492#true} is VALID [2018-11-23 10:55:21,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {46492#true} assume !(0bv32 != ~p6~0); {46492#true} is VALID [2018-11-23 10:55:21,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {46492#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:21,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:21,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:21,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:21,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:21,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:21,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:21,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:21,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:21,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0; {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:21,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {46536#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk7~0; {46493#false} is VALID [2018-11-23 10:55:21,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {46493#false} assume !false; {46493#false} is VALID [2018-11-23 10:55:21,982 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:21,982 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:21,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:21,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:21,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:21,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:21,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:22,012 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:55:22,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:22,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:22,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:22,013 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2018-11-23 10:55:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:23,662 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2018-11-23 10:55:23,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:23,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-23 10:55:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-23 10:55:23,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2018-11-23 10:55:23,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:24,123 INFO L225 Difference]: With dead ends: 2956 [2018-11-23 10:55:24,123 INFO L226 Difference]: Without dead ends: 2954 [2018-11-23 10:55:24,125 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:55:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-23 10:55:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2018-11-23 10:55:24,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:24,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2954 states. Second operand 2568 states. [2018-11-23 10:55:24,931 INFO L74 IsIncluded]: Start isIncluded. First operand 2954 states. Second operand 2568 states. [2018-11-23 10:55:24,931 INFO L87 Difference]: Start difference. First operand 2954 states. Second operand 2568 states. [2018-11-23 10:55:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:25,240 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2018-11-23 10:55:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4039 transitions. [2018-11-23 10:55:25,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:25,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:25,244 INFO L74 IsIncluded]: Start isIncluded. First operand 2568 states. Second operand 2954 states. [2018-11-23 10:55:25,244 INFO L87 Difference]: Start difference. First operand 2568 states. Second operand 2954 states. [2018-11-23 10:55:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:25,544 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2018-11-23 10:55:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4039 transitions. [2018-11-23 10:55:25,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:25,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:25,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:25,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2018-11-23 10:55:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2018-11-23 10:55:25,795 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2018-11-23 10:55:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:25,795 INFO L480 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2018-11-23 10:55:25,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2018-11-23 10:55:25,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:55:25,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:25,797 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:55:25,798 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:25,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:25,798 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2018-11-23 10:55:25,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:25,798 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:55:25,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:25,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:25,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {58207#true} call ULTIMATE.init(); {58207#true} is VALID [2018-11-23 10:55:25,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {58207#true} assume true; {58207#true} is VALID [2018-11-23 10:55:25,895 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {58207#true} {58207#true} #180#return; {58207#true} is VALID [2018-11-23 10:55:25,895 INFO L256 TraceCheckUtils]: 3: Hoare triple {58207#true} call #t~ret10 := main(); {58207#true} is VALID [2018-11-23 10:55:25,895 INFO L273 TraceCheckUtils]: 4: Hoare triple {58207#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;havoc ~cond~0; {58207#true} is VALID [2018-11-23 10:55:25,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {58207#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {58207#true} is VALID [2018-11-23 10:55:25,896 INFO L273 TraceCheckUtils]: 6: Hoare triple {58207#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; {58207#true} is VALID [2018-11-23 10:55:25,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {58207#true} assume !(0bv32 != ~p1~0); {58207#true} is VALID [2018-11-23 10:55:25,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {58207#true} assume !(0bv32 != ~p2~0); {58207#true} is VALID [2018-11-23 10:55:25,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {58207#true} assume !(0bv32 != ~p3~0); {58207#true} is VALID [2018-11-23 10:55:25,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {58207#true} assume !(0bv32 != ~p4~0); {58207#true} is VALID [2018-11-23 10:55:25,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {58207#true} assume !(0bv32 != ~p5~0); {58207#true} is VALID [2018-11-23 10:55:25,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {58207#true} assume !(0bv32 != ~p6~0); {58207#true} is VALID [2018-11-23 10:55:25,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {58207#true} assume !(0bv32 != ~p7~0); {58251#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:25,898 INFO L273 TraceCheckUtils]: 14: Hoare triple {58251#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p8~0); {58251#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:25,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {58251#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {58251#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:25,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {58251#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p1~0); {58251#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:25,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {58251#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p2~0); {58251#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:25,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {58251#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p3~0); {58251#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:25,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {58251#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p4~0); {58251#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:25,900 INFO L273 TraceCheckUtils]: 20: Hoare triple {58251#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p5~0); {58251#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:25,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {58251#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p6~0); {58251#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:25,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {58251#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p7~0; {58208#false} is VALID [2018-11-23 10:55:25,901 INFO L273 TraceCheckUtils]: 23: Hoare triple {58208#false} assume 1bv32 != ~lk7~0; {58208#false} is VALID [2018-11-23 10:55:25,901 INFO L273 TraceCheckUtils]: 24: Hoare triple {58208#false} assume !false; {58208#false} is VALID [2018-11-23 10:55:25,901 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:25,901 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:25,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:25,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:25,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:25,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:25,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:25,927 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:55:25,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:25,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:25,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:25,928 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2018-11-23 10:55:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:29,113 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2018-11-23 10:55:29,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:29,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-23 10:55:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-23 10:55:29,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2018-11-23 10:55:29,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:29,744 INFO L225 Difference]: With dead ends: 5836 [2018-11-23 10:55:29,744 INFO L226 Difference]: Without dead ends: 3338 [2018-11-23 10:55:29,748 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:55:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-23 10:55:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2018-11-23 10:55:30,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:30,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3338 states. Second operand 3336 states. [2018-11-23 10:55:30,790 INFO L74 IsIncluded]: Start isIncluded. First operand 3338 states. Second operand 3336 states. [2018-11-23 10:55:30,791 INFO L87 Difference]: Start difference. First operand 3338 states. Second operand 3336 states. [2018-11-23 10:55:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:31,202 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2018-11-23 10:55:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4295 transitions. [2018-11-23 10:55:31,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:31,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:31,206 INFO L74 IsIncluded]: Start isIncluded. First operand 3336 states. Second operand 3338 states. [2018-11-23 10:55:31,206 INFO L87 Difference]: Start difference. First operand 3336 states. Second operand 3338 states. [2018-11-23 10:55:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:31,626 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2018-11-23 10:55:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4295 transitions. [2018-11-23 10:55:31,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:31,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:31,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:31,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-23 10:55:32,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2018-11-23 10:55:32,091 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2018-11-23 10:55:32,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:32,092 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2018-11-23 10:55:32,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:32,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2018-11-23 10:55:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:55:32,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:32,094 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:55:32,094 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:32,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:32,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2018-11-23 10:55:32,095 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:32,095 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:55:32,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:32,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:32,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {74466#true} call ULTIMATE.init(); {74466#true} is VALID [2018-11-23 10:55:32,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {74466#true} assume true; {74466#true} is VALID [2018-11-23 10:55:32,204 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {74466#true} {74466#true} #180#return; {74466#true} is VALID [2018-11-23 10:55:32,204 INFO L256 TraceCheckUtils]: 3: Hoare triple {74466#true} call #t~ret10 := main(); {74466#true} is VALID [2018-11-23 10:55:32,204 INFO L273 TraceCheckUtils]: 4: Hoare triple {74466#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;havoc ~cond~0; {74466#true} is VALID [2018-11-23 10:55:32,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {74466#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {74466#true} is VALID [2018-11-23 10:55:32,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {74466#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; {74466#true} is VALID [2018-11-23 10:55:32,205 INFO L273 TraceCheckUtils]: 7: Hoare triple {74466#true} assume !(0bv32 != ~p1~0); {74466#true} is VALID [2018-11-23 10:55:32,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {74466#true} assume !(0bv32 != ~p2~0); {74466#true} is VALID [2018-11-23 10:55:32,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {74466#true} assume !(0bv32 != ~p3~0); {74466#true} is VALID [2018-11-23 10:55:32,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {74466#true} assume !(0bv32 != ~p4~0); {74466#true} is VALID [2018-11-23 10:55:32,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {74466#true} assume !(0bv32 != ~p5~0); {74466#true} is VALID [2018-11-23 10:55:32,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {74466#true} assume !(0bv32 != ~p6~0); {74466#true} is VALID [2018-11-23 10:55:32,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {74466#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {74510#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:32,206 INFO L273 TraceCheckUtils]: 14: Hoare triple {74510#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p8~0); {74510#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:32,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {74510#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {74510#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:32,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {74510#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p1~0); {74510#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:32,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {74510#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p2~0); {74510#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:32,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {74510#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p3~0); {74510#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:32,208 INFO L273 TraceCheckUtils]: 19: Hoare triple {74510#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p4~0); {74510#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:32,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {74510#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p5~0); {74510#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:32,208 INFO L273 TraceCheckUtils]: 21: Hoare triple {74510#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p6~0); {74510#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:32,209 INFO L273 TraceCheckUtils]: 22: Hoare triple {74510#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p7~0); {74467#false} is VALID [2018-11-23 10:55:32,209 INFO L273 TraceCheckUtils]: 23: Hoare triple {74467#false} assume 0bv32 != ~p8~0; {74467#false} is VALID [2018-11-23 10:55:32,210 INFO L273 TraceCheckUtils]: 24: Hoare triple {74467#false} assume 1bv32 != ~lk8~0; {74467#false} is VALID [2018-11-23 10:55:32,210 INFO L273 TraceCheckUtils]: 25: Hoare triple {74467#false} assume !false; {74467#false} is VALID [2018-11-23 10:55:32,211 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:32,211 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:32,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:32,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:32,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:55:32,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:32,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:32,236 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:55:32,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:32,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:32,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:32,237 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2018-11-23 10:55:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:34,923 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2018-11-23 10:55:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:34,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:55:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 10:55:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 10:55:34,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-23 10:55:35,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:35,640 INFO L225 Difference]: With dead ends: 5004 [2018-11-23 10:55:35,640 INFO L226 Difference]: Without dead ends: 3402 [2018-11-23 10:55:35,644 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:55:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2018-11-23 10:55:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2018-11-23 10:55:37,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:37,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3402 states. Second operand 3400 states. [2018-11-23 10:55:37,820 INFO L74 IsIncluded]: Start isIncluded. First operand 3402 states. Second operand 3400 states. [2018-11-23 10:55:37,820 INFO L87 Difference]: Start difference. First operand 3402 states. Second operand 3400 states. [2018-11-23 10:55:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:38,166 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2018-11-23 10:55:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4295 transitions. [2018-11-23 10:55:38,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:38,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:38,171 INFO L74 IsIncluded]: Start isIncluded. First operand 3400 states. Second operand 3402 states. [2018-11-23 10:55:38,171 INFO L87 Difference]: Start difference. First operand 3400 states. Second operand 3402 states. [2018-11-23 10:55:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:38,518 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2018-11-23 10:55:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4295 transitions. [2018-11-23 10:55:38,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:38,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:38,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:38,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-11-23 10:55:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2018-11-23 10:55:38,919 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2018-11-23 10:55:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:38,919 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2018-11-23 10:55:38,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2018-11-23 10:55:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:55:38,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:38,921 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:55:38,921 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:38,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:38,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2018-11-23 10:55:38,922 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:38,922 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:55:38,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:38,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:39,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {90088#true} call ULTIMATE.init(); {90088#true} is VALID [2018-11-23 10:55:39,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {90088#true} assume true; {90088#true} is VALID [2018-11-23 10:55:39,224 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {90088#true} {90088#true} #180#return; {90088#true} is VALID [2018-11-23 10:55:39,224 INFO L256 TraceCheckUtils]: 3: Hoare triple {90088#true} call #t~ret10 := main(); {90088#true} is VALID [2018-11-23 10:55:39,225 INFO L273 TraceCheckUtils]: 4: Hoare triple {90088#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;havoc ~cond~0; {90088#true} is VALID [2018-11-23 10:55:39,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {90088#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {90088#true} is VALID [2018-11-23 10:55:39,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {90088#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; {90088#true} is VALID [2018-11-23 10:55:39,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {90088#true} assume !(0bv32 != ~p1~0); {90088#true} is VALID [2018-11-23 10:55:39,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {90088#true} assume !(0bv32 != ~p2~0); {90088#true} is VALID [2018-11-23 10:55:39,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {90088#true} assume !(0bv32 != ~p3~0); {90088#true} is VALID [2018-11-23 10:55:39,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {90088#true} assume !(0bv32 != ~p4~0); {90088#true} is VALID [2018-11-23 10:55:39,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {90088#true} assume !(0bv32 != ~p5~0); {90088#true} is VALID [2018-11-23 10:55:39,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {90088#true} assume !(0bv32 != ~p6~0); {90088#true} is VALID [2018-11-23 10:55:39,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {90088#true} assume !(0bv32 != ~p7~0); {90088#true} is VALID [2018-11-23 10:55:39,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {90088#true} assume !(0bv32 != ~p8~0); {90135#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:39,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {90135#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {90135#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:39,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {90135#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p1~0); {90135#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:39,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {90135#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p2~0); {90135#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:39,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {90135#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p3~0); {90135#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:39,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {90135#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p4~0); {90135#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:39,230 INFO L273 TraceCheckUtils]: 20: Hoare triple {90135#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p5~0); {90135#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:39,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {90135#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p6~0); {90135#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:39,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {90135#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p7~0); {90135#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:39,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {90135#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p8~0; {90089#false} is VALID [2018-11-23 10:55:39,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {90089#false} assume 1bv32 != ~lk8~0; {90089#false} is VALID [2018-11-23 10:55:39,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {90089#false} assume !false; {90089#false} is VALID [2018-11-23 10:55:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:55:39,233 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:39,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:39,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:39,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:55:39,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:39,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:39,261 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:55:39,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:39,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:39,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:39,262 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2018-11-23 10:55:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:45,518 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2018-11-23 10:55:45,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:45,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:55:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:45,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-23 10:55:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-23 10:55:45,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2018-11-23 10:55:45,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:47,603 INFO L225 Difference]: With dead ends: 9804 [2018-11-23 10:55:47,604 INFO L226 Difference]: Without dead ends: 6538 [2018-11-23 10:55:47,608 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:55:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2018-11-23 10:55:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2018-11-23 10:55:52,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:52,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6538 states. Second operand 6536 states. [2018-11-23 10:55:52,630 INFO L74 IsIncluded]: Start isIncluded. First operand 6538 states. Second operand 6536 states. [2018-11-23 10:55:52,630 INFO L87 Difference]: Start difference. First operand 6538 states. Second operand 6536 states. [2018-11-23 10:55:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:54,269 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2018-11-23 10:55:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7815 transitions. [2018-11-23 10:55:54,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:54,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:54,276 INFO L74 IsIncluded]: Start isIncluded. First operand 6536 states. Second operand 6538 states. [2018-11-23 10:55:54,276 INFO L87 Difference]: Start difference. First operand 6536 states. Second operand 6538 states. [2018-11-23 10:55:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:55,786 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2018-11-23 10:55:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7815 transitions. [2018-11-23 10:55:55,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:55,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:55,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:55,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-11-23 10:55:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2018-11-23 10:55:57,481 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2018-11-23 10:55:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:57,481 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2018-11-23 10:55:57,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:57,481 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2018-11-23 10:55:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:55:57,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:57,484 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:55:57,484 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:57,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:57,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2018-11-23 10:55:57,485 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:57,485 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:57,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:57,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:57,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {120238#true} call ULTIMATE.init(); {120238#true} is VALID [2018-11-23 10:55:57,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {120238#true} assume true; {120238#true} is VALID [2018-11-23 10:55:57,580 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {120238#true} {120238#true} #180#return; {120238#true} is VALID [2018-11-23 10:55:57,581 INFO L256 TraceCheckUtils]: 3: Hoare triple {120238#true} call #t~ret10 := main(); {120238#true} is VALID [2018-11-23 10:55:57,581 INFO L273 TraceCheckUtils]: 4: Hoare triple {120238#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;havoc ~cond~0; {120238#true} is VALID [2018-11-23 10:55:57,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {120238#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {120238#true} is VALID [2018-11-23 10:55:57,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {120238#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; {120238#true} is VALID [2018-11-23 10:55:57,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {120238#true} assume !(0bv32 != ~p1~0); {120238#true} is VALID [2018-11-23 10:55:57,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {120238#true} assume !(0bv32 != ~p2~0); {120238#true} is VALID [2018-11-23 10:55:57,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {120238#true} assume !(0bv32 != ~p3~0); {120238#true} is VALID [2018-11-23 10:55:57,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {120238#true} assume !(0bv32 != ~p4~0); {120238#true} is VALID [2018-11-23 10:55:57,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {120238#true} assume !(0bv32 != ~p5~0); {120238#true} is VALID [2018-11-23 10:55:57,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {120238#true} assume !(0bv32 != ~p6~0); {120238#true} is VALID [2018-11-23 10:55:57,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {120238#true} assume !(0bv32 != ~p7~0); {120238#true} is VALID [2018-11-23 10:55:57,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {120238#true} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:57,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:57,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:57,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:57,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:57,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:57,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:57,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:57,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:57,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0; {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:57,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {120285#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk8~0; {120239#false} is VALID [2018-11-23 10:55:57,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {120239#false} assume !false; {120239#false} is VALID [2018-11-23 10:55:57,607 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:57,607 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:57,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:57,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:57,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:55:57,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:57,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:57,635 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:55:57,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:57,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:57,637 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2018-11-23 10:56:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:04,688 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2018-11-23 10:56:04,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:56:04,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:56:04,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:56:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 10:56:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 10:56:04,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2018-11-23 10:56:04,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:56:07,158 INFO L225 Difference]: With dead ends: 7052 [2018-11-23 10:56:07,158 INFO L226 Difference]: Without dead ends: 7050 [2018-11-23 10:56:07,161 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:56:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2018-11-23 10:56:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2018-11-23 10:56:11,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:56:11,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7050 states. Second operand 6536 states. [2018-11-23 10:56:11,150 INFO L74 IsIncluded]: Start isIncluded. First operand 7050 states. Second operand 6536 states. [2018-11-23 10:56:11,150 INFO L87 Difference]: Start difference. First operand 7050 states. Second operand 6536 states. [2018-11-23 10:56:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:13,032 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2018-11-23 10:56:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 8455 transitions. [2018-11-23 10:56:13,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:13,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:13,037 INFO L74 IsIncluded]: Start isIncluded. First operand 6536 states. Second operand 7050 states. [2018-11-23 10:56:13,037 INFO L87 Difference]: Start difference. First operand 6536 states. Second operand 7050 states. [2018-11-23 10:56:14,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:14,957 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2018-11-23 10:56:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 8455 transitions. [2018-11-23 10:56:14,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:14,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:14,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:56:14,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:56:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-11-23 10:56:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2018-11-23 10:56:16,752 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2018-11-23 10:56:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:56:16,752 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2018-11-23 10:56:16,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:56:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2018-11-23 10:56:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:56:16,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:56:16,756 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:56:16,756 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:56:16,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:56:16,756 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2018-11-23 10:56:16,756 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:56:16,756 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:56:16,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:56:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:16,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:56:16,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {148660#true} call ULTIMATE.init(); {148660#true} is VALID [2018-11-23 10:56:16,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {148660#true} assume true; {148660#true} is VALID [2018-11-23 10:56:16,850 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {148660#true} {148660#true} #180#return; {148660#true} is VALID [2018-11-23 10:56:16,850 INFO L256 TraceCheckUtils]: 3: Hoare triple {148660#true} call #t~ret10 := main(); {148660#true} is VALID [2018-11-23 10:56:16,850 INFO L273 TraceCheckUtils]: 4: Hoare triple {148660#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;havoc ~cond~0; {148660#true} is VALID [2018-11-23 10:56:16,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {148660#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {148660#true} is VALID [2018-11-23 10:56:16,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {148660#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; {148660#true} is VALID [2018-11-23 10:56:16,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {148660#true} assume !(0bv32 != ~p1~0); {148660#true} is VALID [2018-11-23 10:56:16,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {148660#true} assume !(0bv32 != ~p2~0); {148660#true} is VALID [2018-11-23 10:56:16,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {148660#true} assume !(0bv32 != ~p3~0); {148660#true} is VALID [2018-11-23 10:56:16,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {148660#true} assume !(0bv32 != ~p4~0); {148660#true} is VALID [2018-11-23 10:56:16,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {148660#true} assume !(0bv32 != ~p5~0); {148660#true} is VALID [2018-11-23 10:56:16,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {148660#true} assume !(0bv32 != ~p6~0); {148660#true} is VALID [2018-11-23 10:56:16,851 INFO L273 TraceCheckUtils]: 13: Hoare triple {148660#true} assume !(0bv32 != ~p7~0); {148660#true} is VALID [2018-11-23 10:56:16,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {148660#true} assume !(0bv32 != ~p8~0); {148660#true} is VALID [2018-11-23 10:56:16,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {148660#true} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:16,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:16,855 INFO L273 TraceCheckUtils]: 17: Hoare triple {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:16,855 INFO L273 TraceCheckUtils]: 18: Hoare triple {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:16,856 INFO L273 TraceCheckUtils]: 19: Hoare triple {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:16,856 INFO L273 TraceCheckUtils]: 20: Hoare triple {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:16,856 INFO L273 TraceCheckUtils]: 21: Hoare triple {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:16,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:16,857 INFO L273 TraceCheckUtils]: 23: Hoare triple {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:16,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0; {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:16,858 INFO L273 TraceCheckUtils]: 25: Hoare triple {148710#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk9~0; {148661#false} is VALID [2018-11-23 10:56:16,858 INFO L273 TraceCheckUtils]: 26: Hoare triple {148661#false} assume !false; {148661#false} is VALID [2018-11-23 10:56:16,859 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:16,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:56:16,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:56:16,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:56:16,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:56:16,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:56:16,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:56:16,885 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:56:16,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:56:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:56:16,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:56:16,886 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2018-11-23 10:56:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:29,316 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2018-11-23 10:56:29,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:56:29,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:56:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:56:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-23 10:56:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-23 10:56:29,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2018-11-23 10:56:29,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:56:34,093 INFO L225 Difference]: With dead ends: 10634 [2018-11-23 10:56:34,093 INFO L226 Difference]: Without dead ends: 10632 [2018-11-23 10:56:34,095 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:56:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2018-11-23 10:56:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2018-11-23 10:56:38,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:56:38,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10632 states. Second operand 10120 states. [2018-11-23 10:56:38,490 INFO L74 IsIncluded]: Start isIncluded. First operand 10632 states. Second operand 10120 states. [2018-11-23 10:56:38,491 INFO L87 Difference]: Start difference. First operand 10632 states. Second operand 10120 states. [2018-11-23 10:56:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:42,639 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2018-11-23 10:56:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 12166 transitions. [2018-11-23 10:56:42,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:42,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:42,646 INFO L74 IsIncluded]: Start isIncluded. First operand 10120 states. Second operand 10632 states. [2018-11-23 10:56:42,646 INFO L87 Difference]: Start difference. First operand 10120 states. Second operand 10632 states. [2018-11-23 10:56:46,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:46,872 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2018-11-23 10:56:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 12166 transitions. [2018-11-23 10:56:46,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:46,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:46,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:56:46,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:56:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2018-11-23 10:56:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2018-11-23 10:56:51,305 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2018-11-23 10:56:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:56:51,305 INFO L480 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2018-11-23 10:56:51,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:56:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2018-11-23 10:56:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:56:51,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:56:51,313 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:56:51,313 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:56:51,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:56:51,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2018-11-23 10:56:51,314 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:56:51,314 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:51,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:56:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:51,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:56:51,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {191542#true} call ULTIMATE.init(); {191542#true} is VALID [2018-11-23 10:56:51,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {191542#true} assume true; {191542#true} is VALID [2018-11-23 10:56:51,406 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {191542#true} {191542#true} #180#return; {191542#true} is VALID [2018-11-23 10:56:51,407 INFO L256 TraceCheckUtils]: 3: Hoare triple {191542#true} call #t~ret10 := main(); {191542#true} is VALID [2018-11-23 10:56:51,407 INFO L273 TraceCheckUtils]: 4: Hoare triple {191542#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;havoc ~cond~0; {191542#true} is VALID [2018-11-23 10:56:51,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {191542#true} assume !false;~cond~0 := #t~nondet9;havoc #t~nondet9; {191542#true} is VALID [2018-11-23 10:56:51,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {191542#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; {191542#true} is VALID [2018-11-23 10:56:51,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {191542#true} assume !(0bv32 != ~p1~0); {191542#true} is VALID [2018-11-23 10:56:51,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {191542#true} assume !(0bv32 != ~p2~0); {191542#true} is VALID [2018-11-23 10:56:51,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {191542#true} assume !(0bv32 != ~p3~0); {191542#true} is VALID [2018-11-23 10:56:51,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {191542#true} assume !(0bv32 != ~p4~0); {191542#true} is VALID [2018-11-23 10:56:51,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {191542#true} assume !(0bv32 != ~p5~0); {191542#true} is VALID [2018-11-23 10:56:51,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {191542#true} assume !(0bv32 != ~p6~0); {191542#true} is VALID [2018-11-23 10:56:51,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {191542#true} assume !(0bv32 != ~p7~0); {191542#true} is VALID [2018-11-23 10:56:51,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {191542#true} assume !(0bv32 != ~p8~0); {191542#true} is VALID [2018-11-23 10:56:51,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {191542#true} assume !(0bv32 != ~p9~0); {191592#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:51,412 INFO L273 TraceCheckUtils]: 16: Hoare triple {191592#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p1~0); {191592#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:51,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {191592#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p2~0); {191592#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:51,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {191592#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p3~0); {191592#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:51,413 INFO L273 TraceCheckUtils]: 19: Hoare triple {191592#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p4~0); {191592#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:51,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {191592#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p5~0); {191592#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:51,414 INFO L273 TraceCheckUtils]: 21: Hoare triple {191592#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p6~0); {191592#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:51,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {191592#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p7~0); {191592#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:51,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {191592#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p8~0); {191592#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:56:51,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {191592#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p9~0; {191543#false} is VALID [2018-11-23 10:56:51,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {191543#false} assume 1bv32 != ~lk9~0; {191543#false} is VALID [2018-11-23 10:56:51,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {191543#false} assume !false; {191543#false} is VALID [2018-11-23 10:56:51,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:56:51,416 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:56:51,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:56:51,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:56:51,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:56:51,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:56:51,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:56:51,441 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:56:51,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:56:51,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:56:51,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:56:51,442 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2018-11-23 10:57:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:57:22,138 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2018-11-23 10:57:22,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:57:22,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:57:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:57:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:57:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 10:57:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:57:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 10:57:22,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-23 10:57:22,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:57:22,302 INFO L225 Difference]: With dead ends: 22664 [2018-11-23 10:57:22,302 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 10:57:22,325 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:57:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 10:57:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 10:57:22,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:57:22,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 10:57:22,326 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:57:22,326 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:57:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:57:22,326 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:57:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:57:22,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:57:22,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:57:22,327 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:57:22,327 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:57:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:57:22,327 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:57:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:57:22,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:57:22,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:57:22,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:57:22,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:57:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 10:57:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 10:57:22,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-23 10:57:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:57:22,329 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 10:57:22,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:57:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:57:22,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:57:22,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 10:57:22,604 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 10:57:22,604 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:57:22,604 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:57:22,604 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 10:57:22,604 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:57:22,604 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:57:22,604 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,604 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-11-23 10:57:22,605 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,605 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-23 10:57:22,605 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,605 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-23 10:57:22,605 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,605 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-11-23 10:57:22,605 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,605 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,605 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-23 10:57:22,606 INFO L451 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-11-23 10:57:22,606 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-11-23 10:57:22,606 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,606 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-23 10:57:22,606 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,606 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-11-23 10:57:22,606 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-23 10:57:22,606 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-23 10:57:22,607 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,607 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,607 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,607 INFO L451 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-11-23 10:57:22,607 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,607 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-11-23 10:57:22,607 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,607 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-23 10:57:22,607 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-23 10:57:22,608 INFO L444 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-11-23 10:57:22,608 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,608 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,608 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-23 10:57:22,608 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-11-23 10:57:22,608 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,608 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 10:57:22,610 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:57:22,611 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:57:22,611 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:57:22,611 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 10:57:22,611 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:57:22,611 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:57:22,611 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 10:57:22,611 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 10:57:22,612 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:57:22,612 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 10:57:22,612 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 10:57:22,612 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 10:57:22,612 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2018-11-23 10:57:22,612 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2018-11-23 10:57:22,612 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2018-11-23 10:57:22,612 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2018-11-23 10:57:22,612 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2018-11-23 10:57:22,613 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2018-11-23 10:57:22,613 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-23 10:57:22,613 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-23 10:57:22,613 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2018-11-23 10:57:22,613 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2018-11-23 10:57:22,613 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2018-11-23 10:57:22,613 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2018-11-23 10:57:22,613 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2018-11-23 10:57:22,613 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2018-11-23 10:57:22,614 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 10:57:22,614 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 10:57:22,614 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-23 10:57:22,614 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-23 10:57:22,614 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2018-11-23 10:57:22,614 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2018-11-23 10:57:22,614 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2018-11-23 10:57:22,614 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2018-11-23 10:57:22,614 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 10:57:22,615 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:57:22,615 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2018-11-23 10:57:22,615 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2018-11-23 10:57:22,615 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2018-11-23 10:57:22,615 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2018-11-23 10:57:22,615 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-23 10:57:22,615 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-23 10:57:22,615 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2018-11-23 10:57:22,615 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2018-11-23 10:57:22,616 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-23 10:57:22,616 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-23 10:57:22,616 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2018-11-23 10:57:22,616 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2018-11-23 10:57:22,616 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-23 10:57:22,616 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-23 10:57:22,616 WARN L170 areAnnotationChecker]: L119-1 has no Hoare annotation [2018-11-23 10:57:22,616 WARN L170 areAnnotationChecker]: L119-1 has no Hoare annotation [2018-11-23 10:57:22,616 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2018-11-23 10:57:22,616 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2018-11-23 10:57:22,617 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-23 10:57:22,618 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-23 10:57:22,618 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 10:57:22,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:57:22 BoogieIcfgContainer [2018-11-23 10:57:22,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:57:22,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:57:22,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:57:22,626 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:57:22,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:54" (3/4) ... [2018-11-23 10:57:22,631 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 10:57:22,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 10:57:22,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 10:57:22,649 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 10:57:22,650 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 10:57:22,650 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 10:57:22,728 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c-witness.graphml [2018-11-23 10:57:22,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:57:22,730 INFO L168 Benchmark]: Toolchain (without parser) took 149277.23 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -298.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-23 10:57:22,732 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:57:22,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 10:57:22,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:57:22,732 INFO L168 Benchmark]: Boogie Preprocessor took 36.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:57:22,733 INFO L168 Benchmark]: RCFGBuilder took 1064.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 10:57:22,733 INFO L168 Benchmark]: TraceAbstraction took 147680.55 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 612.9 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 459.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-23 10:57:22,734 INFO L168 Benchmark]: Witness Printer took 102.99 ms. Allocated memory is still 2.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2018-11-23 10:57:22,736 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 365.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 20.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1064.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 147680.55 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 612.9 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 459.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Witness Printer took 102.99 ms. Allocated memory is still 2.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 147.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 92.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 50.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 27890 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1252 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...