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_8_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:54:44,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:54:44,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:54:44,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:54:44,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:54:44,825 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:54:44,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:54:44,830 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:54:44,839 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:54:44,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:54:44,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:54:44,841 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:54:44,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:54:44,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:54:44,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:54:44,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:54:44,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:54:44,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:54:44,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:54:44,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:54:44,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:54:44,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:54:44,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:54:44,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:54:44,862 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:54:44,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:54:44,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:54:44,864 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:54:44,865 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:54:44,866 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:54:44,866 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:54:44,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:54:44,867 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:54:44,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:54:44,868 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:54:44,869 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:54:44,869 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:44,899 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:54:44,899 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:54:44,900 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:54:44,900 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:54:44,901 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:54:44,901 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:54:44,901 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:54:44,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:54:44,905 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:54:44,905 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:54:44,905 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:54:44,906 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:54:44,906 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:54:44,906 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:54:44,906 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:54:44,906 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:54:44,906 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:54:44,907 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:54:44,907 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:54:44,907 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:54:44,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:54:44,907 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:54:44,908 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:54:44,909 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:54:44,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:44,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:54:44,910 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:54:44,910 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:54:44,910 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:54:44,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:54:44,910 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:54:44,911 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:54:44,911 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:54:44,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:54:44,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:54:44,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:54:44,987 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:54:44,988 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:54:44,988 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:45,050 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/817a38636/d566b58f36804c9a8cc86230599440c8/FLAGf1e6a7347 [2018-11-23 10:54:45,495 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:54:45,496 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:45,512 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/817a38636/d566b58f36804c9a8cc86230599440c8/FLAGf1e6a7347 [2018-11-23 10:54:45,861 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/817a38636/d566b58f36804c9a8cc86230599440c8 [2018-11-23 10:54:45,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:54:45,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:54:45,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:45,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:54:45,877 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:54:45,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:45" (1/1) ... [2018-11-23 10:54:45,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c7f1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:45, skipping insertion in model container [2018-11-23 10:54:45,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:45" (1/1) ... [2018-11-23 10:54:45,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:54:45,928 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:54:46,196 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:46,205 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:54:46,252 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:46,271 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:54:46,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:46 WrapperNode [2018-11-23 10:54:46,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:46,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:46,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:54:46,273 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:54:46,281 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:46" (1/1) ... [2018-11-23 10:54:46,289 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:46" (1/1) ... [2018-11-23 10:54:46,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:46,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:54:46,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:54:46,297 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:54:46,307 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:46" (1/1) ... [2018-11-23 10:54:46,308 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:46" (1/1) ... [2018-11-23 10:54:46,310 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:46" (1/1) ... [2018-11-23 10:54:46,310 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:46" (1/1) ... [2018-11-23 10:54:46,320 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:46" (1/1) ... [2018-11-23 10:54:46,330 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:46" (1/1) ... [2018-11-23 10:54:46,332 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:46" (1/1) ... [2018-11-23 10:54:46,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:54:46,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:54:46,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:54:46,336 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:54:46,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:54:46,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:54:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:54:46,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:54:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:54:46,471 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:54:47,221 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:54:47,221 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:54:47,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:47 BoogieIcfgContainer [2018-11-23 10:54:47,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:54:47,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:54:47,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:54:47,227 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:54:47,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:54:45" (1/3) ... [2018-11-23 10:54:47,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3785c62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:47, skipping insertion in model container [2018-11-23 10:54:47,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:46" (2/3) ... [2018-11-23 10:54:47,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3785c62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:47, skipping insertion in model container [2018-11-23 10:54:47,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:47" (3/3) ... [2018-11-23 10:54:47,231 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:47,241 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:54:47,251 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:54:47,266 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:54:47,300 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:54:47,301 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:54:47,301 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:54:47,301 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:54:47,301 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:54:47,302 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:54:47,302 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:54:47,302 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:54:47,302 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:54:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 10:54:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:47,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:47,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:47,333 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:47,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:47,340 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2018-11-23 10:54:47,345 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:47,346 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:47,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:47,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:47,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-23 10:54:47,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-23 10:54:47,664 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #163#return; {41#true} is VALID [2018-11-23 10:54:47,664 INFO L256 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret9 := main(); {41#true} is VALID [2018-11-23 10:54:47,664 INFO L273 TraceCheckUtils]: 4: Hoare triple {41#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;havoc ~cond~0; {41#true} is VALID [2018-11-23 10:54:47,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {41#true} is VALID [2018-11-23 10:54:47,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#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; {41#true} is VALID [2018-11-23 10:54:47,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {67#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {42#false} is VALID [2018-11-23 10:54:47,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-23 10:54:47,686 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:47,686 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:47,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:47,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:47,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:47,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:47,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:47,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:47,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:47,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:47,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:47,941 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-11-23 10:54:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,593 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2018-11-23 10:54:48,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:48,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 10:54:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 10:54:48,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2018-11-23 10:54:49,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:49,284 INFO L225 Difference]: With dead ends: 75 [2018-11-23 10:54:49,284 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 10:54:49,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 10:54:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-11-23 10:54:49,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:49,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 42 states. [2018-11-23 10:54:49,335 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 42 states. [2018-11-23 10:54:49,335 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 42 states. [2018-11-23 10:54:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,343 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2018-11-23 10:54:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2018-11-23 10:54:49,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,344 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 60 states. [2018-11-23 10:54:49,345 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 60 states. [2018-11-23 10:54:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,352 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2018-11-23 10:54:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2018-11-23 10:54:49,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:49,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 10:54:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2018-11-23 10:54:49,360 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2018-11-23 10:54:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:49,360 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2018-11-23 10:54:49,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2018-11-23 10:54:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:49,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:49,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:49,362 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:49,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:49,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2018-11-23 10:54:49,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:49,364 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:49,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:49,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:49,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {352#true} is VALID [2018-11-23 10:54:49,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {352#true} assume true; {352#true} is VALID [2018-11-23 10:54:49,505 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {352#true} {352#true} #163#return; {352#true} is VALID [2018-11-23 10:54:49,505 INFO L256 TraceCheckUtils]: 3: Hoare triple {352#true} call #t~ret9 := main(); {352#true} is VALID [2018-11-23 10:54:49,506 INFO L273 TraceCheckUtils]: 4: Hoare triple {352#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;havoc ~cond~0; {352#true} is VALID [2018-11-23 10:54:49,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {352#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {352#true} is VALID [2018-11-23 10:54:49,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {352#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; {352#true} is VALID [2018-11-23 10:54:49,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {352#true} assume !(0bv32 != ~p1~0); {378#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:49,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {378#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {378#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:49,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {378#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {378#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:49,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {378#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {378#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:49,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {378#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {378#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:49,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {378#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {378#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:49,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {378#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {378#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:49,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {378#(= (_ bv0 32) main_~p1~0)} assume !(0bv32 != ~p8~0); {378#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:49,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {378#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {353#false} is VALID [2018-11-23 10:54:49,517 INFO L273 TraceCheckUtils]: 16: Hoare triple {353#false} assume 1bv32 != ~lk1~0; {353#false} is VALID [2018-11-23 10:54:49,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {353#false} assume !false; {353#false} is VALID [2018-11-23 10:54:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:49,520 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:49,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:49,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:49,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:49,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:49,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:49,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:49,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:49,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:49,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:49,568 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2018-11-23 10:54:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,950 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2018-11-23 10:54:49,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:49,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-23 10:54:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-23 10:54:49,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2018-11-23 10:54:50,247 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:54:50,250 INFO L225 Difference]: With dead ends: 97 [2018-11-23 10:54:50,251 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 10:54:50,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 10:54:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-23 10:54:50,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:50,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2018-11-23 10:54:50,300 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2018-11-23 10:54:50,300 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2018-11-23 10:54:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:50,304 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2018-11-23 10:54:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2018-11-23 10:54:50,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:50,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:50,306 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2018-11-23 10:54:50,306 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2018-11-23 10:54:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:50,310 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2018-11-23 10:54:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2018-11-23 10:54:50,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:50,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:50,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:50,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 10:54:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2018-11-23 10:54:50,316 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2018-11-23 10:54:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:50,317 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2018-11-23 10:54:50,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2018-11-23 10:54:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:50,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:50,318 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:50,319 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:50,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2018-11-23 10:54:50,320 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:50,320 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:50,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:50,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:50,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {700#true} call ULTIMATE.init(); {700#true} is VALID [2018-11-23 10:54:50,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {700#true} assume true; {700#true} is VALID [2018-11-23 10:54:50,448 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {700#true} {700#true} #163#return; {700#true} is VALID [2018-11-23 10:54:50,448 INFO L256 TraceCheckUtils]: 3: Hoare triple {700#true} call #t~ret9 := main(); {700#true} is VALID [2018-11-23 10:54:50,449 INFO L273 TraceCheckUtils]: 4: Hoare triple {700#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;havoc ~cond~0; {700#true} is VALID [2018-11-23 10:54:50,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {700#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {700#true} is VALID [2018-11-23 10:54:50,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {700#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; {700#true} is VALID [2018-11-23 10:54:50,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {700#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {726#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:50,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {726#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {726#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:50,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {726#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {726#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:50,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {726#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {726#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:50,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {726#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {726#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:50,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {726#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {726#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:50,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {726#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {726#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:50,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {726#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p8~0); {726#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:50,467 INFO L273 TraceCheckUtils]: 15: Hoare triple {726#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {701#false} is VALID [2018-11-23 10:54:50,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {701#false} assume 0bv32 != ~p2~0; {701#false} is VALID [2018-11-23 10:54:50,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {701#false} assume 1bv32 != ~lk2~0; {701#false} is VALID [2018-11-23 10:54:50,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {701#false} assume !false; {701#false} is VALID [2018-11-23 10:54:50,469 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:50,469 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:50,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:50,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:50,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:50,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:50,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:50,530 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:50,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:50,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:50,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:50,531 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2018-11-23 10:54:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:50,819 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-11-23 10:54:50,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:50,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:50,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 10:54:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 10:54:50,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-23 10:54:51,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:51,095 INFO L225 Difference]: With dead ends: 90 [2018-11-23 10:54:51,096 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 10:54:51,096 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:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 10:54:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-23 10:54:51,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:51,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2018-11-23 10:54:51,111 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2018-11-23 10:54:51,111 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2018-11-23 10:54:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,115 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2018-11-23 10:54:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2018-11-23 10:54:51,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:51,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:51,116 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2018-11-23 10:54:51,117 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2018-11-23 10:54:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,121 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2018-11-23 10:54:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2018-11-23 10:54:51,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:51,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:51,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:51,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 10:54:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2018-11-23 10:54:51,126 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2018-11-23 10:54:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:51,126 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2018-11-23 10:54:51,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2018-11-23 10:54:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:51,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:51,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:51,128 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:51,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2018-11-23 10:54:51,129 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:51,129 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:51,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:51,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {1055#true} call ULTIMATE.init(); {1055#true} is VALID [2018-11-23 10:54:51,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {1055#true} assume true; {1055#true} is VALID [2018-11-23 10:54:51,244 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1055#true} {1055#true} #163#return; {1055#true} is VALID [2018-11-23 10:54:51,245 INFO L256 TraceCheckUtils]: 3: Hoare triple {1055#true} call #t~ret9 := main(); {1055#true} is VALID [2018-11-23 10:54:51,245 INFO L273 TraceCheckUtils]: 4: Hoare triple {1055#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;havoc ~cond~0; {1055#true} is VALID [2018-11-23 10:54:51,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {1055#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {1055#true} is VALID [2018-11-23 10:54:51,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {1055#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; {1055#true} is VALID [2018-11-23 10:54:51,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {1055#true} assume !(0bv32 != ~p1~0); {1055#true} is VALID [2018-11-23 10:54:51,252 INFO L273 TraceCheckUtils]: 8: Hoare triple {1055#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {1084#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {1056#false} is VALID [2018-11-23 10:54:51,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {1056#false} assume !false; {1056#false} is VALID [2018-11-23 10:54:51,264 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:51,264 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:51,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:51,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:51,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:51,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:51,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:51,293 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:51,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:51,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:51,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:51,294 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2018-11-23 10:54:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,557 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2018-11-23 10:54:51,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:51,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 10:54:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 10:54:51,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 10:54:51,728 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:54:51,732 INFO L225 Difference]: With dead ends: 112 [2018-11-23 10:54:51,732 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 10:54:51,733 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:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 10:54:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2018-11-23 10:54:51,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:51,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 80 states. [2018-11-23 10:54:51,769 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 80 states. [2018-11-23 10:54:51,769 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 80 states. [2018-11-23 10:54:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,774 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2018-11-23 10:54:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2018-11-23 10:54:51,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:51,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:51,776 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 110 states. [2018-11-23 10:54:51,776 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 110 states. [2018-11-23 10:54:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,782 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2018-11-23 10:54:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2018-11-23 10:54:51,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:51,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:51,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:51,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 10:54:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2018-11-23 10:54:51,788 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2018-11-23 10:54:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:51,788 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2018-11-23 10:54:51,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2018-11-23 10:54:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:51,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:51,790 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:51,790 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:51,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2018-11-23 10:54:51,791 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:51,791 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:51,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:51,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {1546#true} call ULTIMATE.init(); {1546#true} is VALID [2018-11-23 10:54:51,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {1546#true} assume true; {1546#true} is VALID [2018-11-23 10:54:51,901 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1546#true} {1546#true} #163#return; {1546#true} is VALID [2018-11-23 10:54:51,901 INFO L256 TraceCheckUtils]: 3: Hoare triple {1546#true} call #t~ret9 := main(); {1546#true} is VALID [2018-11-23 10:54:51,901 INFO L273 TraceCheckUtils]: 4: Hoare triple {1546#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;havoc ~cond~0; {1546#true} is VALID [2018-11-23 10:54:51,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {1546#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {1546#true} is VALID [2018-11-23 10:54:51,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {1546#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; {1546#true} is VALID [2018-11-23 10:54:51,902 INFO L273 TraceCheckUtils]: 7: Hoare triple {1546#true} assume !(0bv32 != ~p1~0); {1546#true} is VALID [2018-11-23 10:54:51,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {1546#true} assume !(0bv32 != ~p2~0); {1575#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:51,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {1575#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1575#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:51,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {1575#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1575#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:51,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {1575#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1575#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:51,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {1575#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1575#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:51,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {1575#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1575#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:51,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {1575#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p8~0); {1575#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:51,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {1575#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {1575#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:51,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {1575#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {1547#false} is VALID [2018-11-23 10:54:51,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {1547#false} assume 1bv32 != ~lk2~0; {1547#false} is VALID [2018-11-23 10:54:51,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {1547#false} assume !false; {1547#false} is VALID [2018-11-23 10:54:51,915 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:51,915 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:51,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:51,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:51,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:51,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:51,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:51,975 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:51,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:51,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:51,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:51,976 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2018-11-23 10:54:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:52,171 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2018-11-23 10:54:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:52,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-23 10:54:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-23 10:54:52,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2018-11-23 10:54:52,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:52,369 INFO L225 Difference]: With dead ends: 184 [2018-11-23 10:54:52,369 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 10:54:52,370 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:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 10:54:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-11-23 10:54:52,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:52,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2018-11-23 10:54:52,408 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2018-11-23 10:54:52,409 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2018-11-23 10:54:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:52,414 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2018-11-23 10:54:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 187 transitions. [2018-11-23 10:54:52,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:52,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:52,415 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2018-11-23 10:54:52,415 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2018-11-23 10:54:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:52,420 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2018-11-23 10:54:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 187 transitions. [2018-11-23 10:54:52,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:52,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:52,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:52,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 10:54:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2018-11-23 10:54:52,426 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2018-11-23 10:54:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:52,427 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2018-11-23 10:54:52,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2018-11-23 10:54:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:52,428 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:52,428 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:52,428 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:52,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2018-11-23 10:54:52,429 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:52,429 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:52,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:52,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:52,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {2147#true} call ULTIMATE.init(); {2147#true} is VALID [2018-11-23 10:54:52,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {2147#true} assume true; {2147#true} is VALID [2018-11-23 10:54:52,668 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2147#true} {2147#true} #163#return; {2147#true} is VALID [2018-11-23 10:54:52,669 INFO L256 TraceCheckUtils]: 3: Hoare triple {2147#true} call #t~ret9 := main(); {2147#true} is VALID [2018-11-23 10:54:52,669 INFO L273 TraceCheckUtils]: 4: Hoare triple {2147#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;havoc ~cond~0; {2147#true} is VALID [2018-11-23 10:54:52,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {2147#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {2147#true} is VALID [2018-11-23 10:54:52,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {2147#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; {2147#true} is VALID [2018-11-23 10:54:52,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {2147#true} assume !(0bv32 != ~p1~0); {2147#true} is VALID [2018-11-23 10:54:52,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {2147#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {2176#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:52,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {2176#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2176#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:52,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {2176#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2176#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:52,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {2176#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2176#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:52,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {2176#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2176#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:52,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {2176#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2176#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:52,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {2176#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p8~0); {2176#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:52,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {2176#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {2176#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:52,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {2176#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {2148#false} is VALID [2018-11-23 10:54:52,682 INFO L273 TraceCheckUtils]: 17: Hoare triple {2148#false} assume 0bv32 != ~p3~0; {2148#false} is VALID [2018-11-23 10:54:52,682 INFO L273 TraceCheckUtils]: 18: Hoare triple {2148#false} assume 1bv32 != ~lk3~0; {2148#false} is VALID [2018-11-23 10:54:52,683 INFO L273 TraceCheckUtils]: 19: Hoare triple {2148#false} assume !false; {2148#false} is VALID [2018-11-23 10:54:52,684 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:52,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:52,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:52,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:52,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:52,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:52,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:52,716 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:52,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:52,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:52,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:52,717 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2018-11-23 10:54:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:52,944 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2018-11-23 10:54:52,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:52,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 10:54:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 10:54:52,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-23 10:54:53,128 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:54:53,131 INFO L225 Difference]: With dead ends: 165 [2018-11-23 10:54:53,131 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 10:54:53,132 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:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 10:54:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-23 10:54:53,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:53,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2018-11-23 10:54:53,173 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2018-11-23 10:54:53,174 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2018-11-23 10:54:53,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:53,179 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2018-11-23 10:54:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 187 transitions. [2018-11-23 10:54:53,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:53,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:53,180 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2018-11-23 10:54:53,180 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2018-11-23 10:54:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:53,185 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2018-11-23 10:54:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 187 transitions. [2018-11-23 10:54:53,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:53,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:53,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:53,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 10:54:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2018-11-23 10:54:53,191 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2018-11-23 10:54:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:53,192 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2018-11-23 10:54:53,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2018-11-23 10:54:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:53,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:53,193 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:53,193 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:53,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:53,194 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2018-11-23 10:54:53,194 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:53,194 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:53,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:53,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:53,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {2738#true} call ULTIMATE.init(); {2738#true} is VALID [2018-11-23 10:54:53,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {2738#true} assume true; {2738#true} is VALID [2018-11-23 10:54:53,304 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2738#true} {2738#true} #163#return; {2738#true} is VALID [2018-11-23 10:54:53,304 INFO L256 TraceCheckUtils]: 3: Hoare triple {2738#true} call #t~ret9 := main(); {2738#true} is VALID [2018-11-23 10:54:53,304 INFO L273 TraceCheckUtils]: 4: Hoare triple {2738#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;havoc ~cond~0; {2738#true} is VALID [2018-11-23 10:54:53,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {2738#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {2738#true} is VALID [2018-11-23 10:54:53,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {2738#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; {2738#true} is VALID [2018-11-23 10:54:53,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {2738#true} assume !(0bv32 != ~p1~0); {2738#true} is VALID [2018-11-23 10:54:53,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {2738#true} assume !(0bv32 != ~p2~0); {2738#true} is VALID [2018-11-23 10:54:53,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {2738#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,331 INFO L273 TraceCheckUtils]: 17: Hoare triple {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {2770#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {2739#false} is VALID [2018-11-23 10:54:53,331 INFO L273 TraceCheckUtils]: 19: Hoare triple {2739#false} assume !false; {2739#false} is VALID [2018-11-23 10:54:53,332 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:53,332 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:53,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:53,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:53,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:53,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:53,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:53,359 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:53,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:53,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:53,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:53,360 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2018-11-23 10:54:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:53,646 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2018-11-23 10:54:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:53,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 10:54:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 10:54:53,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-23 10:54:53,853 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:54:53,858 INFO L225 Difference]: With dead ends: 204 [2018-11-23 10:54:53,858 INFO L226 Difference]: Without dead ends: 202 [2018-11-23 10:54:53,861 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:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-23 10:54:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2018-11-23 10:54:54,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:54,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 152 states. [2018-11-23 10:54:54,185 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 152 states. [2018-11-23 10:54:54,185 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 152 states. [2018-11-23 10:54:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,192 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2018-11-23 10:54:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 339 transitions. [2018-11-23 10:54:54,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:54,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:54,194 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 202 states. [2018-11-23 10:54:54,194 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 202 states. [2018-11-23 10:54:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,202 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2018-11-23 10:54:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 339 transitions. [2018-11-23 10:54:54,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:54,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:54,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:54,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 10:54:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2018-11-23 10:54:54,217 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2018-11-23 10:54:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:54,218 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2018-11-23 10:54:54,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2018-11-23 10:54:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:54,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:54,221 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:54,221 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:54,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:54,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2018-11-23 10:54:54,223 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:54,223 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:54,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:54,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:54,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {3586#true} call ULTIMATE.init(); {3586#true} is VALID [2018-11-23 10:54:54,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {3586#true} assume true; {3586#true} is VALID [2018-11-23 10:54:54,557 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3586#true} {3586#true} #163#return; {3586#true} is VALID [2018-11-23 10:54:54,557 INFO L256 TraceCheckUtils]: 3: Hoare triple {3586#true} call #t~ret9 := main(); {3586#true} is VALID [2018-11-23 10:54:54,557 INFO L273 TraceCheckUtils]: 4: Hoare triple {3586#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;havoc ~cond~0; {3586#true} is VALID [2018-11-23 10:54:54,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {3586#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {3586#true} is VALID [2018-11-23 10:54:54,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {3586#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; {3586#true} is VALID [2018-11-23 10:54:54,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {3586#true} assume !(0bv32 != ~p1~0); {3586#true} is VALID [2018-11-23 10:54:54,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {3586#true} assume !(0bv32 != ~p2~0); {3586#true} is VALID [2018-11-23 10:54:54,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {3586#true} assume !(0bv32 != ~p3~0); {3618#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:54,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {3618#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3618#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:54,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {3618#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3618#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:54,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {3618#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3618#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:54,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {3618#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {3618#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:54,561 INFO L273 TraceCheckUtils]: 14: Hoare triple {3618#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p8~0); {3618#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:54,564 INFO L273 TraceCheckUtils]: 15: Hoare triple {3618#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {3618#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:54,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {3618#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {3618#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:54,566 INFO L273 TraceCheckUtils]: 17: Hoare triple {3618#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {3587#false} is VALID [2018-11-23 10:54:54,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {3587#false} assume 1bv32 != ~lk3~0; {3587#false} is VALID [2018-11-23 10:54:54,566 INFO L273 TraceCheckUtils]: 19: Hoare triple {3587#false} assume !false; {3587#false} is VALID [2018-11-23 10:54:54,567 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:54,567 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:54,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:54,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:54,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:54,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:54,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:54,635 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:54,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:54,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:54,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:54,636 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2018-11-23 10:54:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,838 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2018-11-23 10:54:54,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:54,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-23 10:54:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-23 10:54:54,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2018-11-23 10:54:55,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:55,033 INFO L225 Difference]: With dead ends: 352 [2018-11-23 10:54:55,033 INFO L226 Difference]: Without dead ends: 210 [2018-11-23 10:54:55,035 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:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-23 10:54:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-11-23 10:54:55,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:55,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 208 states. [2018-11-23 10:54:55,116 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 208 states. [2018-11-23 10:54:55,116 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 208 states. [2018-11-23 10:54:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:55,122 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2018-11-23 10:54:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2018-11-23 10:54:55,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:55,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:55,123 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 210 states. [2018-11-23 10:54:55,124 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 210 states. [2018-11-23 10:54:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:55,129 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2018-11-23 10:54:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2018-11-23 10:54:55,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:55,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:55,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:55,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-23 10:54:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2018-11-23 10:54:55,136 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2018-11-23 10:54:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:55,136 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2018-11-23 10:54:55,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2018-11-23 10:54:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:54:55,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:55,137 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:54:55,138 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:55,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:55,138 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2018-11-23 10:54:55,138 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:55,138 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:55,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:55,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:55,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {4662#true} call ULTIMATE.init(); {4662#true} is VALID [2018-11-23 10:54:55,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {4662#true} assume true; {4662#true} is VALID [2018-11-23 10:54:55,271 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4662#true} {4662#true} #163#return; {4662#true} is VALID [2018-11-23 10:54:55,271 INFO L256 TraceCheckUtils]: 3: Hoare triple {4662#true} call #t~ret9 := main(); {4662#true} is VALID [2018-11-23 10:54:55,271 INFO L273 TraceCheckUtils]: 4: Hoare triple {4662#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;havoc ~cond~0; {4662#true} is VALID [2018-11-23 10:54:55,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {4662#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {4662#true} is VALID [2018-11-23 10:54:55,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {4662#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; {4662#true} is VALID [2018-11-23 10:54:55,272 INFO L273 TraceCheckUtils]: 7: Hoare triple {4662#true} assume !(0bv32 != ~p1~0); {4662#true} is VALID [2018-11-23 10:54:55,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {4662#true} assume !(0bv32 != ~p2~0); {4662#true} is VALID [2018-11-23 10:54:55,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {4662#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {4694#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:55,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {4694#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {4694#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:55,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {4694#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {4694#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:55,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {4694#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {4694#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:55,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {4694#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {4694#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:55,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {4694#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p8~0); {4694#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:55,305 INFO L273 TraceCheckUtils]: 15: Hoare triple {4694#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {4694#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:55,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {4694#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {4694#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:55,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {4694#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {4663#false} is VALID [2018-11-23 10:54:55,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {4663#false} assume 0bv32 != ~p4~0; {4663#false} is VALID [2018-11-23 10:54:55,306 INFO L273 TraceCheckUtils]: 19: Hoare triple {4663#false} assume 1bv32 != ~lk4~0; {4663#false} is VALID [2018-11-23 10:54:55,306 INFO L273 TraceCheckUtils]: 20: Hoare triple {4663#false} assume !false; {4663#false} is VALID [2018-11-23 10:54:55,307 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,307 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:55,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:55,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:55,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:55,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:55,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:55,348 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:54:55,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:55,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:55,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:55,348 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2018-11-23 10:54:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:55,568 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-11-23 10:54:55,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:55,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-23 10:54:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-23 10:54:55,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2018-11-23 10:54:56,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:56,154 INFO L225 Difference]: With dead ends: 312 [2018-11-23 10:54:56,154 INFO L226 Difference]: Without dead ends: 214 [2018-11-23 10:54:56,155 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:54:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-23 10:54:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-11-23 10:54:56,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:56,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 212 states. [2018-11-23 10:54:56,273 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 212 states. [2018-11-23 10:54:56,274 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 212 states. [2018-11-23 10:54:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:56,279 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2018-11-23 10:54:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 339 transitions. [2018-11-23 10:54:56,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:56,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:56,280 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 214 states. [2018-11-23 10:54:56,280 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 214 states. [2018-11-23 10:54:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:56,286 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2018-11-23 10:54:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 339 transitions. [2018-11-23 10:54:56,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:56,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:56,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:56,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-23 10:54:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2018-11-23 10:54:56,293 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2018-11-23 10:54:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:56,293 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2018-11-23 10:54:56,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2018-11-23 10:54:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:54:56,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:56,294 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:54:56,295 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:56,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2018-11-23 10:54:56,295 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:56,295 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:56,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:56,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:56,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {5713#true} call ULTIMATE.init(); {5713#true} is VALID [2018-11-23 10:54:56,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {5713#true} assume true; {5713#true} is VALID [2018-11-23 10:54:56,910 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5713#true} {5713#true} #163#return; {5713#true} is VALID [2018-11-23 10:54:56,911 INFO L256 TraceCheckUtils]: 3: Hoare triple {5713#true} call #t~ret9 := main(); {5713#true} is VALID [2018-11-23 10:54:56,911 INFO L273 TraceCheckUtils]: 4: Hoare triple {5713#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;havoc ~cond~0; {5713#true} is VALID [2018-11-23 10:54:56,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {5713#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {5713#true} is VALID [2018-11-23 10:54:56,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {5713#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; {5713#true} is VALID [2018-11-23 10:54:56,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {5713#true} assume !(0bv32 != ~p1~0); {5713#true} is VALID [2018-11-23 10:54:56,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {5713#true} assume !(0bv32 != ~p2~0); {5713#true} is VALID [2018-11-23 10:54:56,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {5713#true} assume !(0bv32 != ~p3~0); {5713#true} is VALID [2018-11-23 10:54:56,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {5713#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:56,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:56,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:56,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:56,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:56,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:56,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:56,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:56,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:56,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {5748#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {5714#false} is VALID [2018-11-23 10:54:56,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {5714#false} assume !false; {5714#false} is VALID [2018-11-23 10:54:56,922 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:56,922 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:56,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:56,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:56,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:56,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:56,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:56,999 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:54:56,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:57,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:57,000 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2018-11-23 10:54:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:57,264 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2018-11-23 10:54:57,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:57,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-23 10:54:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-23 10:54:57,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2018-11-23 10:54:57,867 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:54:57,877 INFO L225 Difference]: With dead ends: 380 [2018-11-23 10:54:57,877 INFO L226 Difference]: Without dead ends: 378 [2018-11-23 10:54:57,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-23 10:54:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2018-11-23 10:54:57,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:57,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand 296 states. [2018-11-23 10:54:57,992 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand 296 states. [2018-11-23 10:54:57,992 INFO L87 Difference]: Start difference. First operand 378 states. Second operand 296 states. [2018-11-23 10:54:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,005 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2018-11-23 10:54:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 607 transitions. [2018-11-23 10:54:58,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:58,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:58,006 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand 378 states. [2018-11-23 10:54:58,006 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 378 states. [2018-11-23 10:54:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,016 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2018-11-23 10:54:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 607 transitions. [2018-11-23 10:54:58,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:58,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:58,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:58,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-23 10:54:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2018-11-23 10:54:58,025 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2018-11-23 10:54:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:58,026 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2018-11-23 10:54:58,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2018-11-23 10:54:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:54:58,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:58,027 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:54:58,027 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:58,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2018-11-23 10:54:58,028 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:58,028 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:58,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:58,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:58,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {7248#true} call ULTIMATE.init(); {7248#true} is VALID [2018-11-23 10:54:58,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {7248#true} assume true; {7248#true} is VALID [2018-11-23 10:54:58,154 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7248#true} {7248#true} #163#return; {7248#true} is VALID [2018-11-23 10:54:58,155 INFO L256 TraceCheckUtils]: 3: Hoare triple {7248#true} call #t~ret9 := main(); {7248#true} is VALID [2018-11-23 10:54:58,155 INFO L273 TraceCheckUtils]: 4: Hoare triple {7248#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;havoc ~cond~0; {7248#true} is VALID [2018-11-23 10:54:58,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {7248#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {7248#true} is VALID [2018-11-23 10:54:58,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {7248#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; {7248#true} is VALID [2018-11-23 10:54:58,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {7248#true} assume !(0bv32 != ~p1~0); {7248#true} is VALID [2018-11-23 10:54:58,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {7248#true} assume !(0bv32 != ~p2~0); {7248#true} is VALID [2018-11-23 10:54:58,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {7248#true} assume !(0bv32 != ~p3~0); {7248#true} is VALID [2018-11-23 10:54:58,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {7248#true} assume !(0bv32 != ~p4~0); {7283#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:58,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {7283#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {7283#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:58,164 INFO L273 TraceCheckUtils]: 12: Hoare triple {7283#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {7283#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:58,164 INFO L273 TraceCheckUtils]: 13: Hoare triple {7283#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {7283#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:58,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {7283#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p8~0); {7283#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:58,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {7283#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {7283#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:58,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {7283#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {7283#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:58,165 INFO L273 TraceCheckUtils]: 17: Hoare triple {7283#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {7283#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:58,166 INFO L273 TraceCheckUtils]: 18: Hoare triple {7283#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {7249#false} is VALID [2018-11-23 10:54:58,166 INFO L273 TraceCheckUtils]: 19: Hoare triple {7249#false} assume 1bv32 != ~lk4~0; {7249#false} is VALID [2018-11-23 10:54:58,166 INFO L273 TraceCheckUtils]: 20: Hoare triple {7249#false} assume !false; {7249#false} is VALID [2018-11-23 10:54:58,167 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,167 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:58,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:58,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:58,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:58,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:58,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:58,192 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:54:58,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:58,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:58,193 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2018-11-23 10:54:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,208 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2018-11-23 10:54:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:59,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 10:54:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 10:54:59,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2018-11-23 10:54:59,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:59,365 INFO L225 Difference]: With dead ends: 684 [2018-11-23 10:54:59,365 INFO L226 Difference]: Without dead ends: 402 [2018-11-23 10:54:59,366 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:54:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-23 10:54:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-11-23 10:54:59,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:59,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand 400 states. [2018-11-23 10:54:59,715 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand 400 states. [2018-11-23 10:54:59,715 INFO L87 Difference]: Start difference. First operand 402 states. Second operand 400 states. [2018-11-23 10:54:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,727 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2018-11-23 10:54:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 615 transitions. [2018-11-23 10:54:59,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:59,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:59,728 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand 402 states. [2018-11-23 10:54:59,728 INFO L87 Difference]: Start difference. First operand 400 states. Second operand 402 states. [2018-11-23 10:54:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,739 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2018-11-23 10:54:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 615 transitions. [2018-11-23 10:54:59,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:59,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:59,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:59,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-23 10:54:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2018-11-23 10:54:59,751 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2018-11-23 10:54:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:59,751 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2018-11-23 10:54:59,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2018-11-23 10:54:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:54:59,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:59,753 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:54:59,753 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:59,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2018-11-23 10:54:59,754 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:59,754 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:59,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:59,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:59,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {9255#true} call ULTIMATE.init(); {9255#true} is VALID [2018-11-23 10:54:59,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {9255#true} assume true; {9255#true} is VALID [2018-11-23 10:54:59,876 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9255#true} {9255#true} #163#return; {9255#true} is VALID [2018-11-23 10:54:59,876 INFO L256 TraceCheckUtils]: 3: Hoare triple {9255#true} call #t~ret9 := main(); {9255#true} is VALID [2018-11-23 10:54:59,877 INFO L273 TraceCheckUtils]: 4: Hoare triple {9255#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;havoc ~cond~0; {9255#true} is VALID [2018-11-23 10:54:59,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {9255#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {9255#true} is VALID [2018-11-23 10:54:59,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {9255#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; {9255#true} is VALID [2018-11-23 10:54:59,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {9255#true} assume !(0bv32 != ~p1~0); {9255#true} is VALID [2018-11-23 10:54:59,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {9255#true} assume !(0bv32 != ~p2~0); {9255#true} is VALID [2018-11-23 10:54:59,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {9255#true} assume !(0bv32 != ~p3~0); {9255#true} is VALID [2018-11-23 10:54:59,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {9255#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {9290#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:59,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {9290#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {9290#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:59,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {9290#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {9290#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:59,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {9290#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {9290#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:59,891 INFO L273 TraceCheckUtils]: 14: Hoare triple {9290#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p8~0); {9290#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:59,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {9290#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {9290#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:59,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {9290#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {9290#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:59,892 INFO L273 TraceCheckUtils]: 17: Hoare triple {9290#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {9290#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:59,893 INFO L273 TraceCheckUtils]: 18: Hoare triple {9290#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {9256#false} is VALID [2018-11-23 10:54:59,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {9256#false} assume 0bv32 != ~p5~0; {9256#false} is VALID [2018-11-23 10:54:59,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {9256#false} assume 1bv32 != ~lk5~0; {9256#false} is VALID [2018-11-23 10:54:59,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {9256#false} assume !false; {9256#false} is VALID [2018-11-23 10:54:59,894 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,894 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:59,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:59,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:59,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:54:59,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:59,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:59,943 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:54:59,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:59,944 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2018-11-23 10:55:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:00,235 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2018-11-23 10:55:00,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:00,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2018-11-23 10:55:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2018-11-23 10:55:00,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 141 transitions. [2018-11-23 10:55:00,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:00,540 INFO L225 Difference]: With dead ends: 600 [2018-11-23 10:55:00,540 INFO L226 Difference]: Without dead ends: 410 [2018-11-23 10:55:00,541 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:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-23 10:55:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-11-23 10:55:00,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:00,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand 408 states. [2018-11-23 10:55:00,729 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand 408 states. [2018-11-23 10:55:00,729 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 408 states. [2018-11-23 10:55:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:00,738 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2018-11-23 10:55:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2018-11-23 10:55:00,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:00,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:00,739 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand 410 states. [2018-11-23 10:55:00,739 INFO L87 Difference]: Start difference. First operand 408 states. Second operand 410 states. [2018-11-23 10:55:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:00,750 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2018-11-23 10:55:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2018-11-23 10:55:00,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:00,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:00,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:00,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-11-23 10:55:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2018-11-23 10:55:00,762 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2018-11-23 10:55:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:00,763 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2018-11-23 10:55:00,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2018-11-23 10:55:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:55:00,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:00,764 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:00,764 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:00,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:00,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2018-11-23 10:55:00,765 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:00,765 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:00,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:00,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:00,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {11205#true} call ULTIMATE.init(); {11205#true} is VALID [2018-11-23 10:55:00,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {11205#true} assume true; {11205#true} is VALID [2018-11-23 10:55:00,877 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11205#true} {11205#true} #163#return; {11205#true} is VALID [2018-11-23 10:55:00,877 INFO L256 TraceCheckUtils]: 3: Hoare triple {11205#true} call #t~ret9 := main(); {11205#true} is VALID [2018-11-23 10:55:00,877 INFO L273 TraceCheckUtils]: 4: Hoare triple {11205#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;havoc ~cond~0; {11205#true} is VALID [2018-11-23 10:55:00,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {11205#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {11205#true} is VALID [2018-11-23 10:55:00,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {11205#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; {11205#true} is VALID [2018-11-23 10:55:00,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {11205#true} assume !(0bv32 != ~p1~0); {11205#true} is VALID [2018-11-23 10:55:00,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {11205#true} assume !(0bv32 != ~p2~0); {11205#true} is VALID [2018-11-23 10:55:00,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {11205#true} assume !(0bv32 != ~p3~0); {11205#true} is VALID [2018-11-23 10:55:00,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#true} assume !(0bv32 != ~p4~0); {11205#true} is VALID [2018-11-23 10:55:00,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {11205#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:00,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:00,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:00,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:00,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:00,884 INFO L273 TraceCheckUtils]: 16: Hoare triple {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:00,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:00,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:00,890 INFO L273 TraceCheckUtils]: 19: Hoare triple {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:00,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {11243#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {11206#false} is VALID [2018-11-23 10:55:00,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {11206#false} assume !false; {11206#false} is VALID [2018-11-23 10:55:00,895 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,895 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:00,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:00,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:00,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:00,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:00,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:00,917 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:00,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:00,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:00,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:00,918 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2018-11-23 10:55:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:01,475 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2018-11-23 10:55:01,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:01,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 10:55:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 10:55:01,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 10:55:01,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:01,598 INFO L225 Difference]: With dead ends: 716 [2018-11-23 10:55:01,599 INFO L226 Difference]: Without dead ends: 714 [2018-11-23 10:55:01,599 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:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-23 10:55:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2018-11-23 10:55:01,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:01,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand 584 states. [2018-11-23 10:55:01,814 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand 584 states. [2018-11-23 10:55:01,814 INFO L87 Difference]: Start difference. First operand 714 states. Second operand 584 states. [2018-11-23 10:55:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:01,838 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2018-11-23 10:55:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1079 transitions. [2018-11-23 10:55:01,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:01,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:01,840 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 714 states. [2018-11-23 10:55:01,840 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 714 states. [2018-11-23 10:55:01,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:01,868 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2018-11-23 10:55:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1079 transitions. [2018-11-23 10:55:01,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:01,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:01,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:01,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-23 10:55:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2018-11-23 10:55:01,890 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2018-11-23 10:55:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:01,891 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2018-11-23 10:55:01,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2018-11-23 10:55:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:55:01,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:01,892 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:01,892 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:01,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:01,893 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2018-11-23 10:55:01,893 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:01,893 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:01,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:01,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:02,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {14063#true} call ULTIMATE.init(); {14063#true} is VALID [2018-11-23 10:55:02,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {14063#true} assume true; {14063#true} is VALID [2018-11-23 10:55:02,005 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14063#true} {14063#true} #163#return; {14063#true} is VALID [2018-11-23 10:55:02,006 INFO L256 TraceCheckUtils]: 3: Hoare triple {14063#true} call #t~ret9 := main(); {14063#true} is VALID [2018-11-23 10:55:02,006 INFO L273 TraceCheckUtils]: 4: Hoare triple {14063#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;havoc ~cond~0; {14063#true} is VALID [2018-11-23 10:55:02,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {14063#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {14063#true} is VALID [2018-11-23 10:55:02,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {14063#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; {14063#true} is VALID [2018-11-23 10:55:02,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {14063#true} assume !(0bv32 != ~p1~0); {14063#true} is VALID [2018-11-23 10:55:02,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {14063#true} assume !(0bv32 != ~p2~0); {14063#true} is VALID [2018-11-23 10:55:02,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {14063#true} assume !(0bv32 != ~p3~0); {14063#true} is VALID [2018-11-23 10:55:02,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {14063#true} assume !(0bv32 != ~p4~0); {14063#true} is VALID [2018-11-23 10:55:02,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {14063#true} assume !(0bv32 != ~p5~0); {14101#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:02,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {14101#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {14101#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:02,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {14101#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {14101#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:02,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {14101#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p8~0); {14101#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:02,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {14101#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {14101#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:02,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {14101#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {14101#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:02,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {14101#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {14101#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:02,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {14101#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {14101#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:55:02,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {14101#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {14064#false} is VALID [2018-11-23 10:55:02,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {14064#false} assume 1bv32 != ~lk5~0; {14064#false} is VALID [2018-11-23 10:55:02,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {14064#false} assume !false; {14064#false} is VALID [2018-11-23 10:55:02,015 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,015 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:02,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:02,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:02,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:02,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:02,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:02,039 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:02,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:02,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:02,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:02,040 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2018-11-23 10:55:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:02,622 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2018-11-23 10:55:02,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:02,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2018-11-23 10:55:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2018-11-23 10:55:02,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2018-11-23 10:55:02,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:02,834 INFO L225 Difference]: With dead ends: 1340 [2018-11-23 10:55:02,834 INFO L226 Difference]: Without dead ends: 778 [2018-11-23 10:55:02,835 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:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-11-23 10:55:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2018-11-23 10:55:03,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:03,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 778 states. Second operand 776 states. [2018-11-23 10:55:03,433 INFO L74 IsIncluded]: Start isIncluded. First operand 778 states. Second operand 776 states. [2018-11-23 10:55:03,434 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 776 states. [2018-11-23 10:55:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:03,458 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2018-11-23 10:55:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1111 transitions. [2018-11-23 10:55:03,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:03,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:03,460 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand 778 states. [2018-11-23 10:55:03,460 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 778 states. [2018-11-23 10:55:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:03,487 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2018-11-23 10:55:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1111 transitions. [2018-11-23 10:55:03,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:03,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:03,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:03,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-23 10:55:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2018-11-23 10:55:03,525 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2018-11-23 10:55:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:03,525 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2018-11-23 10:55:03,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2018-11-23 10:55:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:55:03,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:03,527 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:03,527 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:03,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2018-11-23 10:55:03,527 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:03,528 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:03,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:03,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:03,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {17897#true} call ULTIMATE.init(); {17897#true} is VALID [2018-11-23 10:55:03,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {17897#true} assume true; {17897#true} is VALID [2018-11-23 10:55:03,668 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17897#true} {17897#true} #163#return; {17897#true} is VALID [2018-11-23 10:55:03,668 INFO L256 TraceCheckUtils]: 3: Hoare triple {17897#true} call #t~ret9 := main(); {17897#true} is VALID [2018-11-23 10:55:03,668 INFO L273 TraceCheckUtils]: 4: Hoare triple {17897#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;havoc ~cond~0; {17897#true} is VALID [2018-11-23 10:55:03,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {17897#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {17897#true} is VALID [2018-11-23 10:55:03,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {17897#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; {17897#true} is VALID [2018-11-23 10:55:03,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {17897#true} assume !(0bv32 != ~p1~0); {17897#true} is VALID [2018-11-23 10:55:03,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {17897#true} assume !(0bv32 != ~p2~0); {17897#true} is VALID [2018-11-23 10:55:03,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {17897#true} assume !(0bv32 != ~p3~0); {17897#true} is VALID [2018-11-23 10:55:03,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {17897#true} assume !(0bv32 != ~p4~0); {17897#true} is VALID [2018-11-23 10:55:03,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {17897#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {17935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:03,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {17935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {17935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:03,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {17935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {17935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:03,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {17935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p8~0); {17935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:03,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {17935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p1~0); {17935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:03,673 INFO L273 TraceCheckUtils]: 16: Hoare triple {17935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p2~0); {17935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:03,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {17935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p3~0); {17935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:03,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {17935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p4~0); {17935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:03,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {17935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p5~0); {17898#false} is VALID [2018-11-23 10:55:03,677 INFO L273 TraceCheckUtils]: 20: Hoare triple {17898#false} assume 0bv32 != ~p6~0; {17898#false} is VALID [2018-11-23 10:55:03,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {17898#false} assume 1bv32 != ~lk6~0; {17898#false} is VALID [2018-11-23 10:55:03,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {17898#false} assume !false; {17898#false} is VALID [2018-11-23 10:55:03,679 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,679 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:03,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:03,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:03,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:03,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:03,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:03,732 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:03,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:03,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:03,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:03,733 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2018-11-23 10:55:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:04,727 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2018-11-23 10:55:04,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:04,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 10:55:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 10:55:04,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2018-11-23 10:55:04,867 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:55:04,898 INFO L225 Difference]: With dead ends: 1164 [2018-11-23 10:55:04,898 INFO L226 Difference]: Without dead ends: 794 [2018-11-23 10:55:04,899 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:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-23 10:55:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2018-11-23 10:55:05,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:05,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 794 states. Second operand 792 states. [2018-11-23 10:55:05,269 INFO L74 IsIncluded]: Start isIncluded. First operand 794 states. Second operand 792 states. [2018-11-23 10:55:05,269 INFO L87 Difference]: Start difference. First operand 794 states. Second operand 792 states. [2018-11-23 10:55:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:05,295 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2018-11-23 10:55:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2018-11-23 10:55:05,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:05,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:05,296 INFO L74 IsIncluded]: Start isIncluded. First operand 792 states. Second operand 794 states. [2018-11-23 10:55:05,296 INFO L87 Difference]: Start difference. First operand 792 states. Second operand 794 states. [2018-11-23 10:55:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:05,330 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2018-11-23 10:55:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2018-11-23 10:55:05,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:05,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:05,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:05,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-23 10:55:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2018-11-23 10:55:05,352 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2018-11-23 10:55:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:05,352 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2018-11-23 10:55:05,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2018-11-23 10:55:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:55:05,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:05,354 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:05,354 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:05,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:05,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2018-11-23 10:55:05,355 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:05,355 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:05,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:05,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:05,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {21606#true} call ULTIMATE.init(); {21606#true} is VALID [2018-11-23 10:55:05,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {21606#true} assume true; {21606#true} is VALID [2018-11-23 10:55:05,461 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21606#true} {21606#true} #163#return; {21606#true} is VALID [2018-11-23 10:55:05,461 INFO L256 TraceCheckUtils]: 3: Hoare triple {21606#true} call #t~ret9 := main(); {21606#true} is VALID [2018-11-23 10:55:05,462 INFO L273 TraceCheckUtils]: 4: Hoare triple {21606#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;havoc ~cond~0; {21606#true} is VALID [2018-11-23 10:55:05,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {21606#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {21606#true} is VALID [2018-11-23 10:55:05,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {21606#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; {21606#true} is VALID [2018-11-23 10:55:05,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {21606#true} assume !(0bv32 != ~p1~0); {21606#true} is VALID [2018-11-23 10:55:05,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {21606#true} assume !(0bv32 != ~p2~0); {21606#true} is VALID [2018-11-23 10:55:05,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {21606#true} assume !(0bv32 != ~p3~0); {21606#true} is VALID [2018-11-23 10:55:05,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {21606#true} assume !(0bv32 != ~p4~0); {21606#true} is VALID [2018-11-23 10:55:05,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {21606#true} assume !(0bv32 != ~p5~0); {21606#true} is VALID [2018-11-23 10:55:05,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {21606#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,472 INFO L273 TraceCheckUtils]: 17: Hoare triple {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,473 INFO L273 TraceCheckUtils]: 20: Hoare triple {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0; {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:05,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {21647#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk6~0; {21607#false} is VALID [2018-11-23 10:55:05,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {21607#false} assume !false; {21607#false} is VALID [2018-11-23 10:55:05,474 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,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:05,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:05,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:05,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:05,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:05,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:05,498 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:05,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:05,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:05,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:05,499 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2018-11-23 10:55:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:06,187 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2018-11-23 10:55:06,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:06,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 10:55:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 10:55:06,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2018-11-23 10:55:06,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:06,352 INFO L225 Difference]: With dead ends: 1356 [2018-11-23 10:55:06,352 INFO L226 Difference]: Without dead ends: 1354 [2018-11-23 10:55:06,353 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:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-23 10:55:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2018-11-23 10:55:06,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:06,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1354 states. Second operand 1160 states. [2018-11-23 10:55:06,850 INFO L74 IsIncluded]: Start isIncluded. First operand 1354 states. Second operand 1160 states. [2018-11-23 10:55:06,851 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 1160 states. [2018-11-23 10:55:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:06,916 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2018-11-23 10:55:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2018-11-23 10:55:06,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:06,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:06,917 INFO L74 IsIncluded]: Start isIncluded. First operand 1160 states. Second operand 1354 states. [2018-11-23 10:55:06,917 INFO L87 Difference]: Start difference. First operand 1160 states. Second operand 1354 states. [2018-11-23 10:55:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:06,984 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2018-11-23 10:55:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2018-11-23 10:55:06,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:06,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:06,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:06,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-23 10:55:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2018-11-23 10:55:07,027 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2018-11-23 10:55:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:07,027 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2018-11-23 10:55:07,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2018-11-23 10:55:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:55:07,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:07,029 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:07,029 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:07,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:07,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2018-11-23 10:55:07,030 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:07,030 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:07,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:07,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:07,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {27011#true} call ULTIMATE.init(); {27011#true} is VALID [2018-11-23 10:55:07,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {27011#true} assume true; {27011#true} is VALID [2018-11-23 10:55:07,122 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27011#true} {27011#true} #163#return; {27011#true} is VALID [2018-11-23 10:55:07,123 INFO L256 TraceCheckUtils]: 3: Hoare triple {27011#true} call #t~ret9 := main(); {27011#true} is VALID [2018-11-23 10:55:07,123 INFO L273 TraceCheckUtils]: 4: Hoare triple {27011#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;havoc ~cond~0; {27011#true} is VALID [2018-11-23 10:55:07,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {27011#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {27011#true} is VALID [2018-11-23 10:55:07,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {27011#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; {27011#true} is VALID [2018-11-23 10:55:07,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {27011#true} assume !(0bv32 != ~p1~0); {27011#true} is VALID [2018-11-23 10:55:07,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {27011#true} assume !(0bv32 != ~p2~0); {27011#true} is VALID [2018-11-23 10:55:07,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {27011#true} assume !(0bv32 != ~p3~0); {27011#true} is VALID [2018-11-23 10:55:07,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {27011#true} assume !(0bv32 != ~p4~0); {27011#true} is VALID [2018-11-23 10:55:07,124 INFO L273 TraceCheckUtils]: 11: Hoare triple {27011#true} assume !(0bv32 != ~p5~0); {27011#true} is VALID [2018-11-23 10:55:07,125 INFO L273 TraceCheckUtils]: 12: Hoare triple {27011#true} assume !(0bv32 != ~p6~0); {27052#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:07,126 INFO L273 TraceCheckUtils]: 13: Hoare triple {27052#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {27052#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:07,126 INFO L273 TraceCheckUtils]: 14: Hoare triple {27052#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p8~0); {27052#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:07,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {27052#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p1~0); {27052#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:07,127 INFO L273 TraceCheckUtils]: 16: Hoare triple {27052#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p2~0); {27052#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:07,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {27052#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p3~0); {27052#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:07,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {27052#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p4~0); {27052#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:07,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {27052#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p5~0); {27052#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:07,128 INFO L273 TraceCheckUtils]: 20: Hoare triple {27052#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p6~0; {27012#false} is VALID [2018-11-23 10:55:07,129 INFO L273 TraceCheckUtils]: 21: Hoare triple {27012#false} assume 1bv32 != ~lk6~0; {27012#false} is VALID [2018-11-23 10:55:07,129 INFO L273 TraceCheckUtils]: 22: Hoare triple {27012#false} assume !false; {27012#false} is VALID [2018-11-23 10:55:07,129 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,130 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:07,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:07,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:07,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:07,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:07,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:07,151 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,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:07,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:07,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:07,152 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2018-11-23 10:55:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:08,226 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2018-11-23 10:55:08,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:08,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-23 10:55:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-23 10:55:08,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2018-11-23 10:55:08,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:08,468 INFO L225 Difference]: With dead ends: 2636 [2018-11-23 10:55:08,468 INFO L226 Difference]: Without dead ends: 1514 [2018-11-23 10:55:08,470 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,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-11-23 10:55:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2018-11-23 10:55:09,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:09,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1514 states. Second operand 1512 states. [2018-11-23 10:55:09,210 INFO L74 IsIncluded]: Start isIncluded. First operand 1514 states. Second operand 1512 states. [2018-11-23 10:55:09,210 INFO L87 Difference]: Start difference. First operand 1514 states. Second operand 1512 states. [2018-11-23 10:55:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:09,277 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2018-11-23 10:55:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1991 transitions. [2018-11-23 10:55:09,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:09,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:09,278 INFO L74 IsIncluded]: Start isIncluded. First operand 1512 states. Second operand 1514 states. [2018-11-23 10:55:09,279 INFO L87 Difference]: Start difference. First operand 1512 states. Second operand 1514 states. [2018-11-23 10:55:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:09,345 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2018-11-23 10:55:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1991 transitions. [2018-11-23 10:55:09,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:09,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:09,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:09,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2018-11-23 10:55:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2018-11-23 10:55:09,412 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2018-11-23 10:55:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:09,413 INFO L480 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2018-11-23 10:55:09,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2018-11-23 10:55:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:55:09,414 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:09,414 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:09,414 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:09,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2018-11-23 10:55:09,415 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:09,415 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:09,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:09,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:09,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {34432#true} call ULTIMATE.init(); {34432#true} is VALID [2018-11-23 10:55:09,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {34432#true} assume true; {34432#true} is VALID [2018-11-23 10:55:09,542 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {34432#true} {34432#true} #163#return; {34432#true} is VALID [2018-11-23 10:55:09,543 INFO L256 TraceCheckUtils]: 3: Hoare triple {34432#true} call #t~ret9 := main(); {34432#true} is VALID [2018-11-23 10:55:09,543 INFO L273 TraceCheckUtils]: 4: Hoare triple {34432#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;havoc ~cond~0; {34432#true} is VALID [2018-11-23 10:55:09,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {34432#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {34432#true} is VALID [2018-11-23 10:55:09,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {34432#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; {34432#true} is VALID [2018-11-23 10:55:09,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {34432#true} assume !(0bv32 != ~p1~0); {34432#true} is VALID [2018-11-23 10:55:09,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {34432#true} assume !(0bv32 != ~p2~0); {34432#true} is VALID [2018-11-23 10:55:09,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {34432#true} assume !(0bv32 != ~p3~0); {34432#true} is VALID [2018-11-23 10:55:09,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {34432#true} assume !(0bv32 != ~p4~0); {34432#true} is VALID [2018-11-23 10:55:09,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {34432#true} assume !(0bv32 != ~p5~0); {34432#true} is VALID [2018-11-23 10:55:09,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {34432#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {34473#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:09,555 INFO L273 TraceCheckUtils]: 13: Hoare triple {34473#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {34473#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:09,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {34473#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p8~0); {34473#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:09,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {34473#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p1~0); {34473#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:09,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {34473#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p2~0); {34473#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:09,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {34473#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p3~0); {34473#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:09,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {34473#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p4~0); {34473#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:09,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {34473#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p5~0); {34473#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:09,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {34473#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p6~0); {34433#false} is VALID [2018-11-23 10:55:09,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {34433#false} assume 0bv32 != ~p7~0; {34433#false} is VALID [2018-11-23 10:55:09,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {34433#false} assume 1bv32 != ~lk7~0; {34433#false} is VALID [2018-11-23 10:55:09,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {34433#false} assume !false; {34433#false} is VALID [2018-11-23 10:55:09,560 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,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:09,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:09,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:09,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:09,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:09,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:09,586 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:09,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:09,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:09,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:09,587 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2018-11-23 10:55:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:11,165 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2018-11-23 10:55:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:11,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-23 10:55:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-23 10:55:11,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2018-11-23 10:55:11,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:11,439 INFO L225 Difference]: With dead ends: 2268 [2018-11-23 10:55:11,439 INFO L226 Difference]: Without dead ends: 1546 [2018-11-23 10:55:11,441 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:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-11-23 10:55:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2018-11-23 10:55:12,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:12,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1546 states. Second operand 1544 states. [2018-11-23 10:55:12,487 INFO L74 IsIncluded]: Start isIncluded. First operand 1546 states. Second operand 1544 states. [2018-11-23 10:55:12,487 INFO L87 Difference]: Start difference. First operand 1546 states. Second operand 1544 states. [2018-11-23 10:55:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:12,564 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2018-11-23 10:55:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1991 transitions. [2018-11-23 10:55:12,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:12,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:12,566 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand 1546 states. [2018-11-23 10:55:12,566 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 1546 states. [2018-11-23 10:55:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:12,638 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2018-11-23 10:55:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1991 transitions. [2018-11-23 10:55:12,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:12,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:12,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:12,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-23 10:55:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2018-11-23 10:55:12,711 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2018-11-23 10:55:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:12,711 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2018-11-23 10:55:12,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2018-11-23 10:55:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:55:12,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:12,712 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:12,712 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:12,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2018-11-23 10:55:12,715 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:12,715 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:12,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:12,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:12,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {41584#true} call ULTIMATE.init(); {41584#true} is VALID [2018-11-23 10:55:12,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {41584#true} assume true; {41584#true} is VALID [2018-11-23 10:55:12,810 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {41584#true} {41584#true} #163#return; {41584#true} is VALID [2018-11-23 10:55:12,810 INFO L256 TraceCheckUtils]: 3: Hoare triple {41584#true} call #t~ret9 := main(); {41584#true} is VALID [2018-11-23 10:55:12,810 INFO L273 TraceCheckUtils]: 4: Hoare triple {41584#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;havoc ~cond~0; {41584#true} is VALID [2018-11-23 10:55:12,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {41584#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {41584#true} is VALID [2018-11-23 10:55:12,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {41584#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; {41584#true} is VALID [2018-11-23 10:55:12,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {41584#true} assume !(0bv32 != ~p1~0); {41584#true} is VALID [2018-11-23 10:55:12,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {41584#true} assume !(0bv32 != ~p2~0); {41584#true} is VALID [2018-11-23 10:55:12,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {41584#true} assume !(0bv32 != ~p3~0); {41584#true} is VALID [2018-11-23 10:55:12,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {41584#true} assume !(0bv32 != ~p4~0); {41584#true} is VALID [2018-11-23 10:55:12,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {41584#true} assume !(0bv32 != ~p5~0); {41584#true} is VALID [2018-11-23 10:55:12,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {41584#true} assume !(0bv32 != ~p6~0); {41584#true} is VALID [2018-11-23 10:55:12,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {41584#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:12,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:12,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:12,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:12,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:12,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:12,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:12,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:12,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0; {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:12,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {41628#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk7~0; {41585#false} is VALID [2018-11-23 10:55:12,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {41585#false} assume !false; {41585#false} is VALID [2018-11-23 10:55:12,835 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,835 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:12,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:12,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:12,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:12,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:12,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:12,857 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,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:12,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:12,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:12,859 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2018-11-23 10:55:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:14,313 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2018-11-23 10:55:14,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:14,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 10:55:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 10:55:14,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 10:55:14,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:14,639 INFO L225 Difference]: With dead ends: 2572 [2018-11-23 10:55:14,639 INFO L226 Difference]: Without dead ends: 2570 [2018-11-23 10:55:14,640 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,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2018-11-23 10:55:15,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2018-11-23 10:55:15,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:15,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2570 states. Second operand 2312 states. [2018-11-23 10:55:15,464 INFO L74 IsIncluded]: Start isIncluded. First operand 2570 states. Second operand 2312 states. [2018-11-23 10:55:15,464 INFO L87 Difference]: Start difference. First operand 2570 states. Second operand 2312 states. [2018-11-23 10:55:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:15,694 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2018-11-23 10:55:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3271 transitions. [2018-11-23 10:55:15,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:15,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:15,697 INFO L74 IsIncluded]: Start isIncluded. First operand 2312 states. Second operand 2570 states. [2018-11-23 10:55:15,697 INFO L87 Difference]: Start difference. First operand 2312 states. Second operand 2570 states. [2018-11-23 10:55:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:15,942 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2018-11-23 10:55:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3271 transitions. [2018-11-23 10:55:15,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:15,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:15,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:15,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-23 10:55:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2018-11-23 10:55:16,123 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2018-11-23 10:55:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:16,124 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2018-11-23 10:55:16,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2018-11-23 10:55:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:55:16,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:16,125 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:16,126 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:16,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2018-11-23 10:55:16,126 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:16,126 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:16,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:16,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:16,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {51888#true} call ULTIMATE.init(); {51888#true} is VALID [2018-11-23 10:55:16,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {51888#true} assume true; {51888#true} is VALID [2018-11-23 10:55:16,224 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {51888#true} {51888#true} #163#return; {51888#true} is VALID [2018-11-23 10:55:16,224 INFO L256 TraceCheckUtils]: 3: Hoare triple {51888#true} call #t~ret9 := main(); {51888#true} is VALID [2018-11-23 10:55:16,225 INFO L273 TraceCheckUtils]: 4: Hoare triple {51888#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;havoc ~cond~0; {51888#true} is VALID [2018-11-23 10:55:16,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {51888#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {51888#true} is VALID [2018-11-23 10:55:16,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {51888#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; {51888#true} is VALID [2018-11-23 10:55:16,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {51888#true} assume !(0bv32 != ~p1~0); {51888#true} is VALID [2018-11-23 10:55:16,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {51888#true} assume !(0bv32 != ~p2~0); {51888#true} is VALID [2018-11-23 10:55:16,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {51888#true} assume !(0bv32 != ~p3~0); {51888#true} is VALID [2018-11-23 10:55:16,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {51888#true} assume !(0bv32 != ~p4~0); {51888#true} is VALID [2018-11-23 10:55:16,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {51888#true} assume !(0bv32 != ~p5~0); {51888#true} is VALID [2018-11-23 10:55:16,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {51888#true} assume !(0bv32 != ~p6~0); {51888#true} is VALID [2018-11-23 10:55:16,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {51888#true} assume !(0bv32 != ~p7~0); {51932#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:16,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {51932#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p8~0); {51932#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:16,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {51932#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p1~0); {51932#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:16,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {51932#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p2~0); {51932#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:16,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {51932#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p3~0); {51932#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:16,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {51932#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p4~0); {51932#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:16,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {51932#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p5~0); {51932#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:16,230 INFO L273 TraceCheckUtils]: 20: Hoare triple {51932#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p6~0); {51932#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:16,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {51932#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p7~0; {51889#false} is VALID [2018-11-23 10:55:16,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {51889#false} assume 1bv32 != ~lk7~0; {51889#false} is VALID [2018-11-23 10:55:16,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {51889#false} assume !false; {51889#false} is VALID [2018-11-23 10:55:16,231 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,232 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:16,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:16,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:16,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:16,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:16,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:16,254 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,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:16,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:16,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:16,255 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2018-11-23 10:55:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:18,953 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2018-11-23 10:55:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:18,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:55:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2018-11-23 10:55:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2018-11-23 10:55:18,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2018-11-23 10:55:19,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:19,426 INFO L225 Difference]: With dead ends: 5196 [2018-11-23 10:55:19,426 INFO L226 Difference]: Without dead ends: 2954 [2018-11-23 10:55:19,429 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:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-23 10:55:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2018-11-23 10:55:21,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:21,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2954 states. Second operand 2952 states. [2018-11-23 10:55:21,364 INFO L74 IsIncluded]: Start isIncluded. First operand 2954 states. Second operand 2952 states. [2018-11-23 10:55:21,364 INFO L87 Difference]: Start difference. First operand 2954 states. Second operand 2952 states. [2018-11-23 10:55:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:21,608 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2018-11-23 10:55:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3527 transitions. [2018-11-23 10:55:21,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:21,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:21,611 INFO L74 IsIncluded]: Start isIncluded. First operand 2952 states. Second operand 2954 states. [2018-11-23 10:55:21,611 INFO L87 Difference]: Start difference. First operand 2952 states. Second operand 2954 states. [2018-11-23 10:55:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:21,874 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2018-11-23 10:55:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3527 transitions. [2018-11-23 10:55:21,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:21,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:21,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:21,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2018-11-23 10:55:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2018-11-23 10:55:22,125 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2018-11-23 10:55:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:22,125 INFO L480 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2018-11-23 10:55:22,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2018-11-23 10:55:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:55:22,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:22,127 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:22,127 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:22,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2018-11-23 10:55:22,128 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:22,128 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:22,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:22,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:22,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {66352#true} call ULTIMATE.init(); {66352#true} is VALID [2018-11-23 10:55:22,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {66352#true} assume true; {66352#true} is VALID [2018-11-23 10:55:22,212 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {66352#true} {66352#true} #163#return; {66352#true} is VALID [2018-11-23 10:55:22,213 INFO L256 TraceCheckUtils]: 3: Hoare triple {66352#true} call #t~ret9 := main(); {66352#true} is VALID [2018-11-23 10:55:22,213 INFO L273 TraceCheckUtils]: 4: Hoare triple {66352#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;havoc ~cond~0; {66352#true} is VALID [2018-11-23 10:55:22,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {66352#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {66352#true} is VALID [2018-11-23 10:55:22,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {66352#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; {66352#true} is VALID [2018-11-23 10:55:22,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {66352#true} assume !(0bv32 != ~p1~0); {66352#true} is VALID [2018-11-23 10:55:22,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {66352#true} assume !(0bv32 != ~p2~0); {66352#true} is VALID [2018-11-23 10:55:22,214 INFO L273 TraceCheckUtils]: 9: Hoare triple {66352#true} assume !(0bv32 != ~p3~0); {66352#true} is VALID [2018-11-23 10:55:22,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {66352#true} assume !(0bv32 != ~p4~0); {66352#true} is VALID [2018-11-23 10:55:22,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {66352#true} assume !(0bv32 != ~p5~0); {66352#true} is VALID [2018-11-23 10:55:22,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {66352#true} assume !(0bv32 != ~p6~0); {66352#true} is VALID [2018-11-23 10:55:22,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {66352#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {66396#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:22,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {66396#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p8~0); {66396#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:22,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {66396#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p1~0); {66396#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:22,217 INFO L273 TraceCheckUtils]: 16: Hoare triple {66396#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p2~0); {66396#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:22,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {66396#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p3~0); {66396#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:22,220 INFO L273 TraceCheckUtils]: 18: Hoare triple {66396#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p4~0); {66396#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:22,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {66396#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p5~0); {66396#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:22,222 INFO L273 TraceCheckUtils]: 20: Hoare triple {66396#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p6~0); {66396#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:22,222 INFO L273 TraceCheckUtils]: 21: Hoare triple {66396#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p7~0); {66353#false} is VALID [2018-11-23 10:55:22,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {66353#false} assume 0bv32 != ~p8~0; {66353#false} is VALID [2018-11-23 10:55:22,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {66353#false} assume 1bv32 != ~lk8~0; {66353#false} is VALID [2018-11-23 10:55:22,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {66353#false} assume !false; {66353#false} is VALID [2018-11-23 10:55:22,223 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:22,223 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:22,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:22,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:22,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:22,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:22,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:22,248 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,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:22,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:22,249 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2018-11-23 10:55:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:24,183 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2018-11-23 10:55:24,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:24,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-23 10:55:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-23 10:55:24,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2018-11-23 10:55:24,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:24,719 INFO L225 Difference]: With dead ends: 4428 [2018-11-23 10:55:24,719 INFO L226 Difference]: Without dead ends: 3018 [2018-11-23 10:55:24,722 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,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2018-11-23 10:55:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2018-11-23 10:55:26,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:26,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3018 states. Second operand 3016 states. [2018-11-23 10:55:26,319 INFO L74 IsIncluded]: Start isIncluded. First operand 3018 states. Second operand 3016 states. [2018-11-23 10:55:26,319 INFO L87 Difference]: Start difference. First operand 3018 states. Second operand 3016 states. [2018-11-23 10:55:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:26,637 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2018-11-23 10:55:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3527 transitions. [2018-11-23 10:55:26,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:26,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:26,640 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3018 states. [2018-11-23 10:55:26,641 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3018 states. [2018-11-23 10:55:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:26,905 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2018-11-23 10:55:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3527 transitions. [2018-11-23 10:55:26,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:26,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:26,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:26,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-11-23 10:55:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2018-11-23 10:55:27,195 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2018-11-23 10:55:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:27,195 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2018-11-23 10:55:27,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2018-11-23 10:55:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:55:27,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:27,197 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:27,197 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:27,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:27,198 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2018-11-23 10:55:27,198 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:27,198 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:27,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:27,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:27,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {80243#true} call ULTIMATE.init(); {80243#true} is VALID [2018-11-23 10:55:27,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {80243#true} assume true; {80243#true} is VALID [2018-11-23 10:55:27,290 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {80243#true} {80243#true} #163#return; {80243#true} is VALID [2018-11-23 10:55:27,291 INFO L256 TraceCheckUtils]: 3: Hoare triple {80243#true} call #t~ret9 := main(); {80243#true} is VALID [2018-11-23 10:55:27,291 INFO L273 TraceCheckUtils]: 4: Hoare triple {80243#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;havoc ~cond~0; {80243#true} is VALID [2018-11-23 10:55:27,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {80243#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {80243#true} is VALID [2018-11-23 10:55:27,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {80243#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; {80243#true} is VALID [2018-11-23 10:55:27,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {80243#true} assume !(0bv32 != ~p1~0); {80243#true} is VALID [2018-11-23 10:55:27,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {80243#true} assume !(0bv32 != ~p2~0); {80243#true} is VALID [2018-11-23 10:55:27,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {80243#true} assume !(0bv32 != ~p3~0); {80243#true} is VALID [2018-11-23 10:55:27,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {80243#true} assume !(0bv32 != ~p4~0); {80243#true} is VALID [2018-11-23 10:55:27,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {80243#true} assume !(0bv32 != ~p5~0); {80243#true} is VALID [2018-11-23 10:55:27,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {80243#true} assume !(0bv32 != ~p6~0); {80243#true} is VALID [2018-11-23 10:55:27,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {80243#true} assume !(0bv32 != ~p7~0); {80243#true} is VALID [2018-11-23 10:55:27,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {80243#true} assume !(0bv32 != ~p8~0); {80290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:27,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {80290#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p1~0); {80290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:27,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {80290#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p2~0); {80290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:27,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {80290#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p3~0); {80290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:27,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {80290#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p4~0); {80290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:27,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {80290#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p5~0); {80290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:27,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {80290#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p6~0); {80290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:27,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {80290#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p7~0); {80290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:27,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {80290#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p8~0; {80244#false} is VALID [2018-11-23 10:55:27,314 INFO L273 TraceCheckUtils]: 23: Hoare triple {80244#false} assume 1bv32 != ~lk8~0; {80244#false} is VALID [2018-11-23 10:55:27,314 INFO L273 TraceCheckUtils]: 24: Hoare triple {80244#false} assume !false; {80244#false} is VALID [2018-11-23 10:55:27,314 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:27,314 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:27,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:27,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:27,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:27,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:27,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:27,338 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:27,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:27,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:27,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:27,339 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2018-11-23 10:55:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:34,359 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2018-11-23 10:55:34,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:34,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 10:55:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 10:55:34,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 10:55:34,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:34,895 INFO L225 Difference]: With dead ends: 8650 [2018-11-23 10:55:34,896 INFO L226 Difference]: Without dead ends: 3016 [2018-11-23 10:55:34,901 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:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-11-23 10:55:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2018-11-23 10:55:36,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:36,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3016 states. Second operand 3016 states. [2018-11-23 10:55:36,108 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3016 states. [2018-11-23 10:55:36,109 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3016 states. [2018-11-23 10:55:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:36,428 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-11-23 10:55:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-11-23 10:55:36,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:36,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:36,432 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3016 states. [2018-11-23 10:55:36,432 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3016 states. [2018-11-23 10:55:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:36,758 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-11-23 10:55:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-11-23 10:55:36,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:36,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:36,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:36,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-11-23 10:55:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2018-11-23 10:55:37,113 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2018-11-23 10:55:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:37,113 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2018-11-23 10:55:37,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-11-23 10:55:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:55:37,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:37,116 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:37,116 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:37,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2018-11-23 10:55:37,117 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:37,117 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:37,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:37,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:37,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {98543#true} call ULTIMATE.init(); {98543#true} is VALID [2018-11-23 10:55:37,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {98543#true} assume true; {98543#true} is VALID [2018-11-23 10:55:37,218 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {98543#true} {98543#true} #163#return; {98543#true} is VALID [2018-11-23 10:55:37,218 INFO L256 TraceCheckUtils]: 3: Hoare triple {98543#true} call #t~ret9 := main(); {98543#true} is VALID [2018-11-23 10:55:37,219 INFO L273 TraceCheckUtils]: 4: Hoare triple {98543#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;havoc ~cond~0; {98543#true} is VALID [2018-11-23 10:55:37,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {98543#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {98543#true} is VALID [2018-11-23 10:55:37,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {98543#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; {98543#true} is VALID [2018-11-23 10:55:37,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {98543#true} assume !(0bv32 != ~p1~0); {98543#true} is VALID [2018-11-23 10:55:37,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {98543#true} assume !(0bv32 != ~p2~0); {98543#true} is VALID [2018-11-23 10:55:37,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {98543#true} assume !(0bv32 != ~p3~0); {98543#true} is VALID [2018-11-23 10:55:37,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {98543#true} assume !(0bv32 != ~p4~0); {98543#true} is VALID [2018-11-23 10:55:37,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {98543#true} assume !(0bv32 != ~p5~0); {98543#true} is VALID [2018-11-23 10:55:37,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {98543#true} assume !(0bv32 != ~p6~0); {98543#true} is VALID [2018-11-23 10:55:37,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {98543#true} assume !(0bv32 != ~p7~0); {98543#true} is VALID [2018-11-23 10:55:37,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {98543#true} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:37,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:37,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:37,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:37,222 INFO L273 TraceCheckUtils]: 18: Hoare triple {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:37,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:37,222 INFO L273 TraceCheckUtils]: 20: Hoare triple {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:37,222 INFO L273 TraceCheckUtils]: 21: Hoare triple {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:37,223 INFO L273 TraceCheckUtils]: 22: Hoare triple {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0; {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:37,223 INFO L273 TraceCheckUtils]: 23: Hoare triple {98590#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk8~0; {98544#false} is VALID [2018-11-23 10:55:37,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {98544#false} assume !false; {98544#false} is VALID [2018-11-23 10:55:37,224 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:37,225 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:37,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:37,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:37,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:37,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:37,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:37,250 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:37,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:37,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:37,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:37,250 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2018-11-23 10:55:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:39,736 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-11-23 10:55:39,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:39,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:55:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 10:55:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 10:55:39,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-23 10:55:39,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:39,807 INFO L225 Difference]: With dead ends: 3016 [2018-11-23 10:55:39,807 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 10:55:39,813 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:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 10:55:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 10:55:39,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:39,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 10:55:39,814 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:55:39,814 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:55:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:39,814 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:55:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:55:39,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:39,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:39,815 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:55:39,815 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:55:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:39,815 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:55:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:55:39,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:39,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:39,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:39,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 10:55:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 10:55:39,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-23 10:55:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:39,817 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 10:55:39,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:55:39,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:39,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 10:55:39,986 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 10:55:39,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:55:39,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:55:39,986 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 10:55:39,986 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:55:39,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:55:39,986 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-23 10:55:39,986 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-23 10:55:39,987 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,987 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-23 10:55:39,987 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,987 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-23 10:55:39,987 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,987 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,987 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-23 10:55:39,987 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-23 10:55:39,987 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-23 10:55:39,987 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-23 10:55:39,988 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,988 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,988 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,988 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,988 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-23 10:55:39,988 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,988 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-23 10:55:39,988 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-23 10:55:39,988 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,988 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,989 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-23 10:55:39,989 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-23 10:55:39,989 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-23 10:55:39,989 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,989 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-23 10:55:39,989 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,989 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,989 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-23 10:55:39,989 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-23 10:55:39,989 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 10:55:39,991 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:55:39,991 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:55:39,991 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:55:39,991 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 10:55:39,991 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:55:39,991 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:55:39,991 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 10:55:39,991 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-23 10:55:39,992 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2018-11-23 10:55:39,993 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2018-11-23 10:55:39,994 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2018-11-23 10:55:39,995 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2018-11-23 10:55:39,995 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2018-11-23 10:55:39,995 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2018-11-23 10:55:39,995 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2018-11-23 10:55:39,995 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2018-11-23 10:55:39,995 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2018-11-23 10:55:39,995 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2018-11-23 10:55:39,995 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:55:40,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:55:40 BoogieIcfgContainer [2018-11-23 10:55:40,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:55:40,001 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:55:40,001 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:55:40,001 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:55:40,002 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:47" (3/4) ... [2018-11-23 10:55:40,004 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 10:55:40,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 10:55:40,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 10:55:40,015 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 10:55:40,015 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 10:55:40,016 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 10:55:40,088 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c-witness.graphml [2018-11-23 10:55:40,088 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:55:40,092 INFO L168 Benchmark]: Toolchain (without parser) took 54220.70 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -395.7 MB). Peak memory consumption was 749.9 MB. Max. memory is 7.1 GB. [2018-11-23 10:55:40,093 INFO L168 Benchmark]: CDTParser took 0.25 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:55:40,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.67 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:55:40,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.27 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:55:40,094 INFO L168 Benchmark]: Boogie Preprocessor took 38.70 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:55:40,094 INFO L168 Benchmark]: RCFGBuilder took 887.03 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -735.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-23 10:55:40,095 INFO L168 Benchmark]: TraceAbstraction took 52776.89 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 434.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 326.8 MB). Peak memory consumption was 761.4 MB. Max. memory is 7.1 GB. [2018-11-23 10:55:40,095 INFO L168 Benchmark]: Witness Printer took 87.06 ms. Allocated memory is still 2.7 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2018-11-23 10:55:40,097 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.25 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 399.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.27 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 38.70 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 887.03 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -735.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52776.89 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 434.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 326.8 MB). Peak memory consumption was 761.4 MB. Max. memory is 7.1 GB. * Witness Printer took 87.06 ms. Allocated memory is still 2.7 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. SAFE Result, 52.7s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 32.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 475 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, 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: 14.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 21979 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1059 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...