/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:58:31,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:58:31,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:58:31,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:58:31,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:58:31,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:58:31,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:58:31,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:58:31,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:58:31,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:58:31,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:58:31,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:58:31,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:58:31,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:58:31,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:58:31,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:58:31,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:58:31,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:58:31,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:58:31,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:58:31,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:58:31,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:58:31,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:58:31,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:58:31,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:58:31,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:58:31,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:58:31,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:58:31,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:58:31,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:58:31,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:58:31,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:58:31,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:58:31,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:58:31,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:58:31,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:58:31,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:58:31,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:58:31,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:58:31,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:58:31,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:58:31,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:58:31,831 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:58:31,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:58:31,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:58:31,832 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:58:31,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:58:31,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:58:31,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:58:31,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:58:31,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:58:31,834 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:58:31,834 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:58:31,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:58:31,834 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:58:31,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:58:31,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:58:31,835 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:58:31,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:58:31,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:58:31,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:58:31,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:58:31,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:58:31,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:58:31,838 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:58:32,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:58:32,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:58:32,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:58:32,128 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:58:32,128 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:58:32,129 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c [2020-07-11 00:58:32,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24771ca8f/ec6a700639834ad2bb17303211f4e953/FLAGde2d34cc6 [2020-07-11 00:58:32,650 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:58:32,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c [2020-07-11 00:58:32,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24771ca8f/ec6a700639834ad2bb17303211f4e953/FLAGde2d34cc6 [2020-07-11 00:58:32,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24771ca8f/ec6a700639834ad2bb17303211f4e953 [2020-07-11 00:58:33,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:58:33,003 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:58:33,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:58:33,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:58:33,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:58:33,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:58:32" (1/1) ... [2020-07-11 00:58:33,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27525079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33, skipping insertion in model container [2020-07-11 00:58:33,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:58:32" (1/1) ... [2020-07-11 00:58:33,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:58:33,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:58:33,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:58:33,229 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:58:33,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:58:33,266 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:58:33,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33 WrapperNode [2020-07-11 00:58:33,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:58:33,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:58:33,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:58:33,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:58:33,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33" (1/1) ... [2020-07-11 00:58:33,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33" (1/1) ... [2020-07-11 00:58:33,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33" (1/1) ... [2020-07-11 00:58:33,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33" (1/1) ... [2020-07-11 00:58:33,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33" (1/1) ... [2020-07-11 00:58:33,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33" (1/1) ... [2020-07-11 00:58:33,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33" (1/1) ... [2020-07-11 00:58:33,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:58:33,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:58:33,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:58:33,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:58:33,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33" (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 [2020-07-11 00:58:33,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:58:33,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:58:33,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:58:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:58:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-11 00:58:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:58:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-07-11 00:58:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:58:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:58:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:58:33,855 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:58:33,855 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 00:58:33,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:58:33 BoogieIcfgContainer [2020-07-11 00:58:33,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:58:33,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:58:33,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:58:33,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:58:33,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:58:32" (1/3) ... [2020-07-11 00:58:33,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db7565f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:58:33, skipping insertion in model container [2020-07-11 00:58:33,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:58:33" (2/3) ... [2020-07-11 00:58:33,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db7565f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:58:33, skipping insertion in model container [2020-07-11 00:58:33,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:58:33" (3/3) ... [2020-07-11 00:58:33,867 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2020-07-11 00:58:33,878 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:58:33,886 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:58:33,898 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:58:33,920 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:58:33,920 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:58:33,920 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:58:33,920 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:58:33,920 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:58:33,921 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:58:33,921 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:58:33,921 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:58:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-07-11 00:58:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-11 00:58:33,947 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:58:33,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:58:33,948 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:58:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:58:33,954 INFO L82 PathProgramCache]: Analyzing trace with hash -936940309, now seen corresponding path program 1 times [2020-07-11 00:58:33,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:58:33,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [645917320] [2020-07-11 00:58:33,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:58:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:34,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-11 00:58:34,144 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {51#true} {51#true} #125#return; {51#true} is VALID [2020-07-11 00:58:34,147 INFO L263 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {51#true} is VALID [2020-07-11 00:58:34,147 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-11 00:58:34,147 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #125#return; {51#true} is VALID [2020-07-11 00:58:34,148 INFO L263 TraceCheckUtils]: 3: Hoare triple {51#true} call #t~ret2 := main(); {51#true} is VALID [2020-07-11 00:58:34,148 INFO L280 TraceCheckUtils]: 4: Hoare triple {51#true} havoc ~s__state~0; {51#true} is VALID [2020-07-11 00:58:34,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {51#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {51#true} is VALID [2020-07-11 00:58:34,149 INFO L280 TraceCheckUtils]: 6: Hoare triple {51#true} ~s__hit~0 := #t~nondet0; {51#true} is VALID [2020-07-11 00:58:34,150 INFO L280 TraceCheckUtils]: 7: Hoare triple {51#true} havoc #t~nondet0; {51#true} is VALID [2020-07-11 00:58:34,150 INFO L280 TraceCheckUtils]: 8: Hoare triple {51#true} havoc ~blastFlag~0; {51#true} is VALID [2020-07-11 00:58:34,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {51#true} havoc ~tmp___1~0; {51#true} is VALID [2020-07-11 00:58:34,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {51#true} ~s__state~0 := 8466; {51#true} is VALID [2020-07-11 00:58:34,153 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#true} ~blastFlag~0 := 0; {55#(<= main_~blastFlag~0 0)} is VALID [2020-07-11 00:58:34,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {55#(<= main_~blastFlag~0 0)} assume !false; {55#(<= main_~blastFlag~0 0)} is VALID [2020-07-11 00:58:34,155 INFO L280 TraceCheckUtils]: 13: Hoare triple {55#(<= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {52#false} is VALID [2020-07-11 00:58:34,156 INFO L280 TraceCheckUtils]: 14: Hoare triple {52#false} assume !false; {52#false} is VALID [2020-07-11 00:58:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:58:34,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [645917320] [2020-07-11 00:58:34,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:58:34,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 00:58:34,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293004233] [2020-07-11 00:58:34,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-11 00:58:34,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:58:34,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 00:58:34,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:34,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 00:58:34,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:58:34,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 00:58:34,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:34,255 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2020-07-11 00:58:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:34,696 INFO L93 Difference]: Finished difference Result 110 states and 156 transitions. [2020-07-11 00:58:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 00:58:34,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-11 00:58:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:58:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-11 00:58:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-11 00:58:34,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-11 00:58:34,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:34,988 INFO L225 Difference]: With dead ends: 110 [2020-07-11 00:58:34,988 INFO L226 Difference]: Without dead ends: 66 [2020-07-11 00:58:34,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-11 00:58:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-11 00:58:35,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:58:35,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2020-07-11 00:58:35,086 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-11 00:58:35,086 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-11 00:58:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:35,093 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2020-07-11 00:58:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2020-07-11 00:58:35,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:35,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:35,094 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-11 00:58:35,095 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-11 00:58:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:35,101 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2020-07-11 00:58:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2020-07-11 00:58:35,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:35,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:35,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:58:35,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:58:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-11 00:58:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2020-07-11 00:58:35,110 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 15 [2020-07-11 00:58:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:58:35,110 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2020-07-11 00:58:35,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 00:58:35,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 82 transitions. [2020-07-11 00:58:35,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2020-07-11 00:58:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-11 00:58:35,207 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:58:35,207 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:58:35,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:58:35,208 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:58:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:58:35,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763386, now seen corresponding path program 1 times [2020-07-11 00:58:35,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:58:35,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [442383570] [2020-07-11 00:58:35,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:58:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:35,249 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#true} assume true; {542#true} is VALID [2020-07-11 00:58:35,250 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {542#true} {542#true} #125#return; {542#true} is VALID [2020-07-11 00:58:35,250 INFO L263 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2020-07-11 00:58:35,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {542#true} assume true; {542#true} is VALID [2020-07-11 00:58:35,251 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {542#true} {542#true} #125#return; {542#true} is VALID [2020-07-11 00:58:35,251 INFO L263 TraceCheckUtils]: 3: Hoare triple {542#true} call #t~ret2 := main(); {542#true} is VALID [2020-07-11 00:58:35,251 INFO L280 TraceCheckUtils]: 4: Hoare triple {542#true} havoc ~s__state~0; {542#true} is VALID [2020-07-11 00:58:35,252 INFO L280 TraceCheckUtils]: 5: Hoare triple {542#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {542#true} is VALID [2020-07-11 00:58:35,252 INFO L280 TraceCheckUtils]: 6: Hoare triple {542#true} ~s__hit~0 := #t~nondet0; {542#true} is VALID [2020-07-11 00:58:35,252 INFO L280 TraceCheckUtils]: 7: Hoare triple {542#true} havoc #t~nondet0; {542#true} is VALID [2020-07-11 00:58:35,253 INFO L280 TraceCheckUtils]: 8: Hoare triple {542#true} havoc ~blastFlag~0; {542#true} is VALID [2020-07-11 00:58:35,253 INFO L280 TraceCheckUtils]: 9: Hoare triple {542#true} havoc ~tmp___1~0; {542#true} is VALID [2020-07-11 00:58:35,253 INFO L280 TraceCheckUtils]: 10: Hoare triple {542#true} ~s__state~0 := 8466; {542#true} is VALID [2020-07-11 00:58:35,254 INFO L280 TraceCheckUtils]: 11: Hoare triple {542#true} ~blastFlag~0 := 0; {542#true} is VALID [2020-07-11 00:58:35,254 INFO L280 TraceCheckUtils]: 12: Hoare triple {542#true} assume !false; {542#true} is VALID [2020-07-11 00:58:35,254 INFO L280 TraceCheckUtils]: 13: Hoare triple {542#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {542#true} is VALID [2020-07-11 00:58:35,255 INFO L280 TraceCheckUtils]: 14: Hoare triple {542#true} assume 8466 == ~s__state~0; {542#true} is VALID [2020-07-11 00:58:35,255 INFO L280 TraceCheckUtils]: 15: Hoare triple {542#true} assume 0 == ~blastFlag~0; {542#true} is VALID [2020-07-11 00:58:35,255 INFO L280 TraceCheckUtils]: 16: Hoare triple {542#true} ~blastFlag~0 := 2; {542#true} is VALID [2020-07-11 00:58:35,256 INFO L280 TraceCheckUtils]: 17: Hoare triple {542#true} assume 0 != ~s__hit~0; {542#true} is VALID [2020-07-11 00:58:35,257 INFO L280 TraceCheckUtils]: 18: Hoare triple {542#true} ~s__state~0 := 8656; {546#(<= 8656 main_~s__state~0)} is VALID [2020-07-11 00:58:35,258 INFO L280 TraceCheckUtils]: 19: Hoare triple {546#(<= 8656 main_~s__state~0)} assume !false; {546#(<= 8656 main_~s__state~0)} is VALID [2020-07-11 00:58:35,258 INFO L280 TraceCheckUtils]: 20: Hoare triple {546#(<= 8656 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {543#false} is VALID [2020-07-11 00:58:35,259 INFO L280 TraceCheckUtils]: 21: Hoare triple {543#false} assume !false; {543#false} is VALID [2020-07-11 00:58:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:58:35,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [442383570] [2020-07-11 00:58:35,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:58:35,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 00:58:35,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792119609] [2020-07-11 00:58:35,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-11 00:58:35,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:58:35,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 00:58:35,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:35,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 00:58:35,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:58:35,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 00:58:35,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:35,292 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 3 states. [2020-07-11 00:58:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:35,519 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2020-07-11 00:58:35,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 00:58:35,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-11 00:58:35,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:58:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-11 00:58:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-11 00:58:35,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2020-07-11 00:58:35,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:35,680 INFO L225 Difference]: With dead ends: 134 [2020-07-11 00:58:35,680 INFO L226 Difference]: Without dead ends: 80 [2020-07-11 00:58:35,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-11 00:58:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2020-07-11 00:58:35,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:58:35,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 76 states. [2020-07-11 00:58:35,770 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 76 states. [2020-07-11 00:58:35,770 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 76 states. [2020-07-11 00:58:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:35,775 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2020-07-11 00:58:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2020-07-11 00:58:35,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:35,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:35,784 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 80 states. [2020-07-11 00:58:35,784 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 80 states. [2020-07-11 00:58:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:35,789 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2020-07-11 00:58:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2020-07-11 00:58:35,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:35,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:35,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:58:35,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:58:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-11 00:58:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2020-07-11 00:58:35,800 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 22 [2020-07-11 00:58:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:58:35,800 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2020-07-11 00:58:35,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 00:58:35,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 92 transitions. [2020-07-11 00:58:35,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2020-07-11 00:58:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-11 00:58:35,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:58:35,910 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:58:35,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:58:35,914 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:58:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:58:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1258903450, now seen corresponding path program 1 times [2020-07-11 00:58:35,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:58:35,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1705032541] [2020-07-11 00:58:35,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:58:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:35,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {1129#true} assume true; {1129#true} is VALID [2020-07-11 00:58:35,950 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1129#true} {1129#true} #125#return; {1129#true} is VALID [2020-07-11 00:58:35,950 INFO L263 TraceCheckUtils]: 0: Hoare triple {1129#true} call ULTIMATE.init(); {1129#true} is VALID [2020-07-11 00:58:35,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {1129#true} assume true; {1129#true} is VALID [2020-07-11 00:58:35,951 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1129#true} {1129#true} #125#return; {1129#true} is VALID [2020-07-11 00:58:35,951 INFO L263 TraceCheckUtils]: 3: Hoare triple {1129#true} call #t~ret2 := main(); {1129#true} is VALID [2020-07-11 00:58:35,951 INFO L280 TraceCheckUtils]: 4: Hoare triple {1129#true} havoc ~s__state~0; {1129#true} is VALID [2020-07-11 00:58:35,952 INFO L280 TraceCheckUtils]: 5: Hoare triple {1129#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1129#true} is VALID [2020-07-11 00:58:35,952 INFO L280 TraceCheckUtils]: 6: Hoare triple {1129#true} ~s__hit~0 := #t~nondet0; {1129#true} is VALID [2020-07-11 00:58:35,952 INFO L280 TraceCheckUtils]: 7: Hoare triple {1129#true} havoc #t~nondet0; {1129#true} is VALID [2020-07-11 00:58:35,953 INFO L280 TraceCheckUtils]: 8: Hoare triple {1129#true} havoc ~blastFlag~0; {1129#true} is VALID [2020-07-11 00:58:35,953 INFO L280 TraceCheckUtils]: 9: Hoare triple {1129#true} havoc ~tmp___1~0; {1129#true} is VALID [2020-07-11 00:58:35,953 INFO L280 TraceCheckUtils]: 10: Hoare triple {1129#true} ~s__state~0 := 8466; {1129#true} is VALID [2020-07-11 00:58:35,953 INFO L280 TraceCheckUtils]: 11: Hoare triple {1129#true} ~blastFlag~0 := 0; {1129#true} is VALID [2020-07-11 00:58:35,954 INFO L280 TraceCheckUtils]: 12: Hoare triple {1129#true} assume !false; {1129#true} is VALID [2020-07-11 00:58:35,954 INFO L280 TraceCheckUtils]: 13: Hoare triple {1129#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1129#true} is VALID [2020-07-11 00:58:35,954 INFO L280 TraceCheckUtils]: 14: Hoare triple {1129#true} assume 8466 == ~s__state~0; {1129#true} is VALID [2020-07-11 00:58:35,955 INFO L280 TraceCheckUtils]: 15: Hoare triple {1129#true} assume 0 == ~blastFlag~0; {1129#true} is VALID [2020-07-11 00:58:35,956 INFO L280 TraceCheckUtils]: 16: Hoare triple {1129#true} ~blastFlag~0 := 2; {1133#(<= main_~blastFlag~0 2)} is VALID [2020-07-11 00:58:35,956 INFO L280 TraceCheckUtils]: 17: Hoare triple {1133#(<= main_~blastFlag~0 2)} assume !(0 != ~s__hit~0); {1133#(<= main_~blastFlag~0 2)} is VALID [2020-07-11 00:58:35,957 INFO L280 TraceCheckUtils]: 18: Hoare triple {1133#(<= main_~blastFlag~0 2)} ~s__state~0 := 8512; {1133#(<= main_~blastFlag~0 2)} is VALID [2020-07-11 00:58:35,958 INFO L280 TraceCheckUtils]: 19: Hoare triple {1133#(<= main_~blastFlag~0 2)} assume !false; {1133#(<= main_~blastFlag~0 2)} is VALID [2020-07-11 00:58:35,958 INFO L280 TraceCheckUtils]: 20: Hoare triple {1133#(<= main_~blastFlag~0 2)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1130#false} is VALID [2020-07-11 00:58:35,959 INFO L280 TraceCheckUtils]: 21: Hoare triple {1130#false} assume !false; {1130#false} is VALID [2020-07-11 00:58:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:58:35,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1705032541] [2020-07-11 00:58:35,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:58:35,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 00:58:35,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233802502] [2020-07-11 00:58:35,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-11 00:58:35,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:58:35,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 00:58:35,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:35,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 00:58:35,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:58:35,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 00:58:35,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:35,986 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand 3 states. [2020-07-11 00:58:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:36,232 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2020-07-11 00:58:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 00:58:36,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-11 00:58:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:58:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2020-07-11 00:58:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2020-07-11 00:58:36,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2020-07-11 00:58:36,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:36,370 INFO L225 Difference]: With dead ends: 140 [2020-07-11 00:58:36,370 INFO L226 Difference]: Without dead ends: 105 [2020-07-11 00:58:36,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-11 00:58:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-07-11 00:58:36,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:58:36,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 105 states. [2020-07-11 00:58:36,509 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2020-07-11 00:58:36,509 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2020-07-11 00:58:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:36,514 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2020-07-11 00:58:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2020-07-11 00:58:36,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:36,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:36,516 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2020-07-11 00:58:36,516 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2020-07-11 00:58:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:36,521 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2020-07-11 00:58:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2020-07-11 00:58:36,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:36,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:36,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:58:36,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:58:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-11 00:58:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2020-07-11 00:58:36,527 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 22 [2020-07-11 00:58:36,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:58:36,528 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2020-07-11 00:58:36,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 00:58:36,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 105 states and 128 transitions. [2020-07-11 00:58:36,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2020-07-11 00:58:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-11 00:58:36,694 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:58:36,695 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:58:36,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:58:36,695 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:58:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:58:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash 122238776, now seen corresponding path program 1 times [2020-07-11 00:58:36,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:58:36,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [607318823] [2020-07-11 00:58:36,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:58:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:36,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {1836#true} assume true; {1836#true} is VALID [2020-07-11 00:58:36,738 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1836#true} {1836#true} #125#return; {1836#true} is VALID [2020-07-11 00:58:36,739 INFO L263 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2020-07-11 00:58:36,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {1836#true} assume true; {1836#true} is VALID [2020-07-11 00:58:36,739 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1836#true} {1836#true} #125#return; {1836#true} is VALID [2020-07-11 00:58:36,739 INFO L263 TraceCheckUtils]: 3: Hoare triple {1836#true} call #t~ret2 := main(); {1836#true} is VALID [2020-07-11 00:58:36,740 INFO L280 TraceCheckUtils]: 4: Hoare triple {1836#true} havoc ~s__state~0; {1836#true} is VALID [2020-07-11 00:58:36,740 INFO L280 TraceCheckUtils]: 5: Hoare triple {1836#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1836#true} is VALID [2020-07-11 00:58:36,740 INFO L280 TraceCheckUtils]: 6: Hoare triple {1836#true} ~s__hit~0 := #t~nondet0; {1836#true} is VALID [2020-07-11 00:58:36,741 INFO L280 TraceCheckUtils]: 7: Hoare triple {1836#true} havoc #t~nondet0; {1836#true} is VALID [2020-07-11 00:58:36,741 INFO L280 TraceCheckUtils]: 8: Hoare triple {1836#true} havoc ~blastFlag~0; {1836#true} is VALID [2020-07-11 00:58:36,741 INFO L280 TraceCheckUtils]: 9: Hoare triple {1836#true} havoc ~tmp___1~0; {1836#true} is VALID [2020-07-11 00:58:36,741 INFO L280 TraceCheckUtils]: 10: Hoare triple {1836#true} ~s__state~0 := 8466; {1836#true} is VALID [2020-07-11 00:58:36,742 INFO L280 TraceCheckUtils]: 11: Hoare triple {1836#true} ~blastFlag~0 := 0; {1836#true} is VALID [2020-07-11 00:58:36,742 INFO L280 TraceCheckUtils]: 12: Hoare triple {1836#true} assume !false; {1836#true} is VALID [2020-07-11 00:58:36,742 INFO L280 TraceCheckUtils]: 13: Hoare triple {1836#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1836#true} is VALID [2020-07-11 00:58:36,743 INFO L280 TraceCheckUtils]: 14: Hoare triple {1836#true} assume 8466 == ~s__state~0; {1836#true} is VALID [2020-07-11 00:58:36,743 INFO L280 TraceCheckUtils]: 15: Hoare triple {1836#true} assume 0 == ~blastFlag~0; {1836#true} is VALID [2020-07-11 00:58:36,743 INFO L280 TraceCheckUtils]: 16: Hoare triple {1836#true} ~blastFlag~0 := 2; {1836#true} is VALID [2020-07-11 00:58:36,743 INFO L280 TraceCheckUtils]: 17: Hoare triple {1836#true} assume 0 != ~s__hit~0; {1836#true} is VALID [2020-07-11 00:58:36,744 INFO L280 TraceCheckUtils]: 18: Hoare triple {1836#true} ~s__state~0 := 8656; {1836#true} is VALID [2020-07-11 00:58:36,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {1836#true} assume !false; {1836#true} is VALID [2020-07-11 00:58:36,744 INFO L280 TraceCheckUtils]: 20: Hoare triple {1836#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1836#true} is VALID [2020-07-11 00:58:36,745 INFO L280 TraceCheckUtils]: 21: Hoare triple {1836#true} assume !(8466 == ~s__state~0); {1836#true} is VALID [2020-07-11 00:58:36,745 INFO L280 TraceCheckUtils]: 22: Hoare triple {1836#true} assume !(8512 == ~s__state~0); {1836#true} is VALID [2020-07-11 00:58:36,745 INFO L280 TraceCheckUtils]: 23: Hoare triple {1836#true} assume !(8640 == ~s__state~0); {1836#true} is VALID [2020-07-11 00:58:36,745 INFO L280 TraceCheckUtils]: 24: Hoare triple {1836#true} assume 8656 == ~s__state~0; {1836#true} is VALID [2020-07-11 00:58:36,746 INFO L280 TraceCheckUtils]: 25: Hoare triple {1836#true} assume 2 == ~blastFlag~0; {1836#true} is VALID [2020-07-11 00:58:36,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {1836#true} ~blastFlag~0 := 3; {1840#(<= main_~blastFlag~0 3)} is VALID [2020-07-11 00:58:36,747 INFO L280 TraceCheckUtils]: 27: Hoare triple {1840#(<= main_~blastFlag~0 3)} assume !(4 == ~blastFlag~0); {1840#(<= main_~blastFlag~0 3)} is VALID [2020-07-11 00:58:36,748 INFO L280 TraceCheckUtils]: 28: Hoare triple {1840#(<= main_~blastFlag~0 3)} assume 5 == ~blastFlag~0; {1837#false} is VALID [2020-07-11 00:58:36,749 INFO L280 TraceCheckUtils]: 29: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2020-07-11 00:58:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-11 00:58:36,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [607318823] [2020-07-11 00:58:36,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:58:36,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 00:58:36,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976948477] [2020-07-11 00:58:36,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-11 00:58:36,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:58:36,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 00:58:36,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:36,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 00:58:36,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:58:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 00:58:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:36,778 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 3 states. [2020-07-11 00:58:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:37,077 INFO L93 Difference]: Finished difference Result 200 states and 250 transitions. [2020-07-11 00:58:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 00:58:37,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-11 00:58:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:58:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2020-07-11 00:58:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2020-07-11 00:58:37,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2020-07-11 00:58:37,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:37,196 INFO L225 Difference]: With dead ends: 200 [2020-07-11 00:58:37,196 INFO L226 Difference]: Without dead ends: 136 [2020-07-11 00:58:37,197 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-11 00:58:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2020-07-11 00:58:37,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:58:37,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2020-07-11 00:58:37,344 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2020-07-11 00:58:37,344 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2020-07-11 00:58:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:37,354 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2020-07-11 00:58:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2020-07-11 00:58:37,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:37,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:37,355 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2020-07-11 00:58:37,355 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2020-07-11 00:58:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:37,364 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2020-07-11 00:58:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2020-07-11 00:58:37,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:37,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:37,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:58:37,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:58:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-07-11 00:58:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2020-07-11 00:58:37,374 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 30 [2020-07-11 00:58:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:58:37,374 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2020-07-11 00:58:37,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 00:58:37,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 134 states and 166 transitions. [2020-07-11 00:58:37,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2020-07-11 00:58:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 00:58:37,560 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:58:37,561 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:58:37,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:58:37,561 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:58:37,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:58:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1207592178, now seen corresponding path program 1 times [2020-07-11 00:58:37,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:58:37,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777464283] [2020-07-11 00:58:37,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:58:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:37,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {2783#true} assume true; {2783#true} is VALID [2020-07-11 00:58:37,604 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2783#true} {2783#true} #125#return; {2783#true} is VALID [2020-07-11 00:58:37,605 INFO L263 TraceCheckUtils]: 0: Hoare triple {2783#true} call ULTIMATE.init(); {2783#true} is VALID [2020-07-11 00:58:37,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {2783#true} assume true; {2783#true} is VALID [2020-07-11 00:58:37,605 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2783#true} {2783#true} #125#return; {2783#true} is VALID [2020-07-11 00:58:37,605 INFO L263 TraceCheckUtils]: 3: Hoare triple {2783#true} call #t~ret2 := main(); {2783#true} is VALID [2020-07-11 00:58:37,605 INFO L280 TraceCheckUtils]: 4: Hoare triple {2783#true} havoc ~s__state~0; {2783#true} is VALID [2020-07-11 00:58:37,606 INFO L280 TraceCheckUtils]: 5: Hoare triple {2783#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2783#true} is VALID [2020-07-11 00:58:37,606 INFO L280 TraceCheckUtils]: 6: Hoare triple {2783#true} ~s__hit~0 := #t~nondet0; {2783#true} is VALID [2020-07-11 00:58:37,607 INFO L280 TraceCheckUtils]: 7: Hoare triple {2783#true} havoc #t~nondet0; {2783#true} is VALID [2020-07-11 00:58:37,607 INFO L280 TraceCheckUtils]: 8: Hoare triple {2783#true} havoc ~blastFlag~0; {2783#true} is VALID [2020-07-11 00:58:37,608 INFO L280 TraceCheckUtils]: 9: Hoare triple {2783#true} havoc ~tmp___1~0; {2783#true} is VALID [2020-07-11 00:58:37,608 INFO L280 TraceCheckUtils]: 10: Hoare triple {2783#true} ~s__state~0 := 8466; {2783#true} is VALID [2020-07-11 00:58:37,608 INFO L280 TraceCheckUtils]: 11: Hoare triple {2783#true} ~blastFlag~0 := 0; {2783#true} is VALID [2020-07-11 00:58:37,608 INFO L280 TraceCheckUtils]: 12: Hoare triple {2783#true} assume !false; {2783#true} is VALID [2020-07-11 00:58:37,609 INFO L280 TraceCheckUtils]: 13: Hoare triple {2783#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2783#true} is VALID [2020-07-11 00:58:37,609 INFO L280 TraceCheckUtils]: 14: Hoare triple {2783#true} assume 8466 == ~s__state~0; {2783#true} is VALID [2020-07-11 00:58:37,609 INFO L280 TraceCheckUtils]: 15: Hoare triple {2783#true} assume 0 == ~blastFlag~0; {2783#true} is VALID [2020-07-11 00:58:37,609 INFO L280 TraceCheckUtils]: 16: Hoare triple {2783#true} ~blastFlag~0 := 2; {2783#true} is VALID [2020-07-11 00:58:37,610 INFO L280 TraceCheckUtils]: 17: Hoare triple {2783#true} assume 0 != ~s__hit~0; {2783#true} is VALID [2020-07-11 00:58:37,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {2783#true} ~s__state~0 := 8656; {2783#true} is VALID [2020-07-11 00:58:37,610 INFO L280 TraceCheckUtils]: 19: Hoare triple {2783#true} assume !false; {2783#true} is VALID [2020-07-11 00:58:37,610 INFO L280 TraceCheckUtils]: 20: Hoare triple {2783#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2783#true} is VALID [2020-07-11 00:58:37,611 INFO L280 TraceCheckUtils]: 21: Hoare triple {2783#true} assume !(8466 == ~s__state~0); {2783#true} is VALID [2020-07-11 00:58:37,611 INFO L280 TraceCheckUtils]: 22: Hoare triple {2783#true} assume !(8512 == ~s__state~0); {2783#true} is VALID [2020-07-11 00:58:37,611 INFO L280 TraceCheckUtils]: 23: Hoare triple {2783#true} assume !(8640 == ~s__state~0); {2783#true} is VALID [2020-07-11 00:58:37,611 INFO L280 TraceCheckUtils]: 24: Hoare triple {2783#true} assume 8656 == ~s__state~0; {2783#true} is VALID [2020-07-11 00:58:37,612 INFO L280 TraceCheckUtils]: 25: Hoare triple {2783#true} assume 2 == ~blastFlag~0; {2783#true} is VALID [2020-07-11 00:58:37,612 INFO L280 TraceCheckUtils]: 26: Hoare triple {2783#true} ~blastFlag~0 := 3; {2783#true} is VALID [2020-07-11 00:58:37,612 INFO L280 TraceCheckUtils]: 27: Hoare triple {2783#true} assume !(4 == ~blastFlag~0); {2783#true} is VALID [2020-07-11 00:58:37,612 INFO L280 TraceCheckUtils]: 28: Hoare triple {2783#true} assume !(5 == ~blastFlag~0); {2783#true} is VALID [2020-07-11 00:58:37,613 INFO L280 TraceCheckUtils]: 29: Hoare triple {2783#true} assume 0 != ~s__hit~0; {2783#true} is VALID [2020-07-11 00:58:37,618 INFO L280 TraceCheckUtils]: 30: Hoare triple {2783#true} ~s__state~0 := 8640; {2787#(<= 8640 main_~s__state~0)} is VALID [2020-07-11 00:58:37,619 INFO L280 TraceCheckUtils]: 31: Hoare triple {2787#(<= 8640 main_~s__state~0)} assume !false; {2787#(<= 8640 main_~s__state~0)} is VALID [2020-07-11 00:58:37,620 INFO L280 TraceCheckUtils]: 32: Hoare triple {2787#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2784#false} is VALID [2020-07-11 00:58:37,621 INFO L280 TraceCheckUtils]: 33: Hoare triple {2784#false} assume !false; {2784#false} is VALID [2020-07-11 00:58:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-11 00:58:37,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777464283] [2020-07-11 00:58:37,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:58:37,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 00:58:37,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462379866] [2020-07-11 00:58:37,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-07-11 00:58:37,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:58:37,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 00:58:37,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:37,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 00:58:37,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:58:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 00:58:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:37,661 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand 3 states. [2020-07-11 00:58:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:38,006 INFO L93 Difference]: Finished difference Result 248 states and 312 transitions. [2020-07-11 00:58:38,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 00:58:38,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-07-11 00:58:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:58:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-07-11 00:58:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-07-11 00:58:38,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2020-07-11 00:58:38,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:38,110 INFO L225 Difference]: With dead ends: 248 [2020-07-11 00:58:38,110 INFO L226 Difference]: Without dead ends: 103 [2020-07-11 00:58:38,111 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-11 00:58:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2020-07-11 00:58:38,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:58:38,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2020-07-11 00:58:38,268 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2020-07-11 00:58:38,268 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2020-07-11 00:58:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:38,273 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2020-07-11 00:58:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2020-07-11 00:58:38,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:38,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:38,274 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2020-07-11 00:58:38,274 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2020-07-11 00:58:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:38,278 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2020-07-11 00:58:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2020-07-11 00:58:38,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:38,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:38,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:58:38,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:58:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-11 00:58:38,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2020-07-11 00:58:38,283 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 34 [2020-07-11 00:58:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:58:38,283 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2020-07-11 00:58:38,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 00:58:38,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 101 states and 117 transitions. [2020-07-11 00:58:38,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2020-07-11 00:58:38,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-11 00:58:38,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:58:38,407 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:58:38,407 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:58:38,407 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:58:38,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:58:38,408 INFO L82 PathProgramCache]: Analyzing trace with hash 340924863, now seen corresponding path program 1 times [2020-07-11 00:58:38,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:58:38,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [657084688] [2020-07-11 00:58:38,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:58:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:58:38,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {3694#true} assume true; {3694#true} is VALID [2020-07-11 00:58:38,475 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3694#true} {3694#true} #125#return; {3694#true} is VALID [2020-07-11 00:58:38,475 INFO L263 TraceCheckUtils]: 0: Hoare triple {3694#true} call ULTIMATE.init(); {3694#true} is VALID [2020-07-11 00:58:38,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {3694#true} assume true; {3694#true} is VALID [2020-07-11 00:58:38,476 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3694#true} {3694#true} #125#return; {3694#true} is VALID [2020-07-11 00:58:38,476 INFO L263 TraceCheckUtils]: 3: Hoare triple {3694#true} call #t~ret2 := main(); {3694#true} is VALID [2020-07-11 00:58:38,476 INFO L280 TraceCheckUtils]: 4: Hoare triple {3694#true} havoc ~s__state~0; {3694#true} is VALID [2020-07-11 00:58:38,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {3694#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3694#true} is VALID [2020-07-11 00:58:38,477 INFO L280 TraceCheckUtils]: 6: Hoare triple {3694#true} ~s__hit~0 := #t~nondet0; {3694#true} is VALID [2020-07-11 00:58:38,477 INFO L280 TraceCheckUtils]: 7: Hoare triple {3694#true} havoc #t~nondet0; {3694#true} is VALID [2020-07-11 00:58:38,477 INFO L280 TraceCheckUtils]: 8: Hoare triple {3694#true} havoc ~blastFlag~0; {3694#true} is VALID [2020-07-11 00:58:38,477 INFO L280 TraceCheckUtils]: 9: Hoare triple {3694#true} havoc ~tmp___1~0; {3694#true} is VALID [2020-07-11 00:58:38,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {3694#true} ~s__state~0 := 8466; {3694#true} is VALID [2020-07-11 00:58:38,478 INFO L280 TraceCheckUtils]: 11: Hoare triple {3694#true} ~blastFlag~0 := 0; {3694#true} is VALID [2020-07-11 00:58:38,478 INFO L280 TraceCheckUtils]: 12: Hoare triple {3694#true} assume !false; {3694#true} is VALID [2020-07-11 00:58:38,478 INFO L280 TraceCheckUtils]: 13: Hoare triple {3694#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3694#true} is VALID [2020-07-11 00:58:38,478 INFO L280 TraceCheckUtils]: 14: Hoare triple {3694#true} assume 8466 == ~s__state~0; {3694#true} is VALID [2020-07-11 00:58:38,479 INFO L280 TraceCheckUtils]: 15: Hoare triple {3694#true} assume 0 == ~blastFlag~0; {3694#true} is VALID [2020-07-11 00:58:38,479 INFO L280 TraceCheckUtils]: 16: Hoare triple {3694#true} ~blastFlag~0 := 2; {3694#true} is VALID [2020-07-11 00:58:38,479 INFO L280 TraceCheckUtils]: 17: Hoare triple {3694#true} assume 0 != ~s__hit~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,480 INFO L280 TraceCheckUtils]: 18: Hoare triple {3698#(not (= 0 main_~s__hit~0))} ~s__state~0 := 8656; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,480 INFO L280 TraceCheckUtils]: 19: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !false; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,481 INFO L280 TraceCheckUtils]: 20: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,481 INFO L280 TraceCheckUtils]: 21: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,481 INFO L280 TraceCheckUtils]: 22: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,482 INFO L280 TraceCheckUtils]: 23: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(8640 == ~s__state~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,483 INFO L280 TraceCheckUtils]: 24: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume 8656 == ~s__state~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,483 INFO L280 TraceCheckUtils]: 25: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume 2 == ~blastFlag~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,484 INFO L280 TraceCheckUtils]: 26: Hoare triple {3698#(not (= 0 main_~s__hit~0))} ~blastFlag~0 := 3; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,484 INFO L280 TraceCheckUtils]: 27: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(4 == ~blastFlag~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,487 INFO L280 TraceCheckUtils]: 28: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(5 == ~blastFlag~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,489 INFO L280 TraceCheckUtils]: 29: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume 0 != ~s__hit~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,491 INFO L280 TraceCheckUtils]: 30: Hoare triple {3698#(not (= 0 main_~s__hit~0))} ~s__state~0 := 8640; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,493 INFO L280 TraceCheckUtils]: 31: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !false; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,493 INFO L280 TraceCheckUtils]: 32: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,494 INFO L280 TraceCheckUtils]: 33: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,494 INFO L280 TraceCheckUtils]: 34: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,495 INFO L280 TraceCheckUtils]: 35: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume 8640 == ~s__state~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,496 INFO L280 TraceCheckUtils]: 36: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume 3 == ~blastFlag~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,496 INFO L280 TraceCheckUtils]: 37: Hoare triple {3698#(not (= 0 main_~s__hit~0))} ~blastFlag~0 := 4; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-11 00:58:38,497 INFO L280 TraceCheckUtils]: 38: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(0 != ~s__hit~0); {3695#false} is VALID [2020-07-11 00:58:38,497 INFO L280 TraceCheckUtils]: 39: Hoare triple {3695#false} ~s__state~0 := 8656; {3695#false} is VALID [2020-07-11 00:58:38,497 INFO L280 TraceCheckUtils]: 40: Hoare triple {3695#false} assume !false; {3695#false} is VALID [2020-07-11 00:58:38,498 INFO L280 TraceCheckUtils]: 41: Hoare triple {3695#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3695#false} is VALID [2020-07-11 00:58:38,498 INFO L280 TraceCheckUtils]: 42: Hoare triple {3695#false} assume !(8466 == ~s__state~0); {3695#false} is VALID [2020-07-11 00:58:38,498 INFO L280 TraceCheckUtils]: 43: Hoare triple {3695#false} assume !(8512 == ~s__state~0); {3695#false} is VALID [2020-07-11 00:58:38,498 INFO L280 TraceCheckUtils]: 44: Hoare triple {3695#false} assume !(8640 == ~s__state~0); {3695#false} is VALID [2020-07-11 00:58:38,499 INFO L280 TraceCheckUtils]: 45: Hoare triple {3695#false} assume 8656 == ~s__state~0; {3695#false} is VALID [2020-07-11 00:58:38,499 INFO L280 TraceCheckUtils]: 46: Hoare triple {3695#false} assume !(2 == ~blastFlag~0); {3695#false} is VALID [2020-07-11 00:58:38,499 INFO L280 TraceCheckUtils]: 47: Hoare triple {3695#false} assume !(4 == ~blastFlag~0); {3695#false} is VALID [2020-07-11 00:58:38,499 INFO L280 TraceCheckUtils]: 48: Hoare triple {3695#false} assume 5 == ~blastFlag~0; {3695#false} is VALID [2020-07-11 00:58:38,500 INFO L280 TraceCheckUtils]: 49: Hoare triple {3695#false} assume !false; {3695#false} is VALID [2020-07-11 00:58:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-11 00:58:38,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [657084688] [2020-07-11 00:58:38,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:58:38,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 00:58:38,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350574577] [2020-07-11 00:58:38,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-11 00:58:38,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:58:38,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 00:58:38,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:38,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 00:58:38,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:58:38,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 00:58:38,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:38,548 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 3 states. [2020-07-11 00:58:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:38,810 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2020-07-11 00:58:38,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 00:58:38,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-11 00:58:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:58:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2020-07-11 00:58:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 00:58:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2020-07-11 00:58:38,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2020-07-11 00:58:38,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:38,886 INFO L225 Difference]: With dead ends: 157 [2020-07-11 00:58:38,895 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:58:38,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:58:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:58:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:58:38,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:58:38,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:58:38,897 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:58:38,897 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:58:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:38,898 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:58:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:58:38,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:38,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:38,898 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:58:38,898 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:58:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:58:38,899 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:58:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:58:38,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:38,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:58:38,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:58:38,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:58:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:58:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:58:38,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2020-07-11 00:58:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:58:38,900 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:58:38,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 00:58:38,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:58:38,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:58:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:58:38,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:58:38,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:58:38,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:58:39,558 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:58:39,558 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:58:39,558 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:58:39,559 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:58:39,559 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:58:39,559 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:58:39,559 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: false [2020-07-11 00:58:39,559 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 8 140) the Hoare annotation is: true [2020-07-11 00:58:39,559 INFO L264 CegarLoopResult]: At program point L77-1(lines 53 106) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (<= main_~blastFlag~0 2) .cse0) (and (not (= 0 main_~s__hit~0)) .cse0))) [2020-07-11 00:58:39,559 INFO L271 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-07-11 00:58:39,560 INFO L264 CegarLoopResult]: At program point L69(lines 69 73) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-11 00:58:39,560 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (or (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 2)) (<= main_~blastFlag~0 0)) [2020-07-11 00:58:39,560 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) (<= 8640 main_~s__state~0)) [2020-07-11 00:58:39,560 INFO L264 CegarLoopResult]: At program point L45(lines 45 110) the Hoare annotation is: (or (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) (<= 8640 main_~s__state~0)) (<= main_~blastFlag~0 2)) [2020-07-11 00:58:39,561 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-11 00:58:39,561 INFO L271 CegarLoopResult]: At program point L136(lines 8 140) the Hoare annotation is: true [2020-07-11 00:58:39,561 INFO L264 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-11 00:58:39,561 INFO L264 CegarLoopResult]: At program point L95(lines 95 97) the Hoare annotation is: (and (<= 8656 main_~s__state~0) (<= main_~blastFlag~0 3)) [2020-07-11 00:58:39,561 INFO L264 CegarLoopResult]: At program point L29(lines 29 124) the Hoare annotation is: (or (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) (<= 8640 main_~s__state~0)) (<= main_~blastFlag~0 2)) [2020-07-11 00:58:39,562 INFO L264 CegarLoopResult]: At program point L46(lines 45 110) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (<= main_~blastFlag~0 2) .cse0) (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) .cse0))) [2020-07-11 00:58:39,562 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 8 140) the Hoare annotation is: true [2020-07-11 00:58:39,562 INFO L264 CegarLoopResult]: At program point L96(lines 8 140) the Hoare annotation is: false [2020-07-11 00:58:39,562 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 138) the Hoare annotation is: false [2020-07-11 00:58:39,562 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-11 00:58:39,562 INFO L264 CegarLoopResult]: At program point L30(lines 29 124) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-11 00:58:39,562 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 8 140) the Hoare annotation is: true [2020-07-11 00:58:39,562 INFO L264 CegarLoopResult]: At program point L88-1(lines 53 106) the Hoare annotation is: (and (<= 8656 main_~s__state~0) (<= main_~blastFlag~0 3)) [2020-07-11 00:58:39,563 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-11 00:58:39,563 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-11 00:58:39,563 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (and (<= 8656 main_~s__state~0) (<= main_~blastFlag~0 2)) [2020-07-11 00:58:39,563 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 00:58:39,563 INFO L264 CegarLoopResult]: At program point L139(line 139) the Hoare annotation is: false [2020-07-11 00:58:39,563 INFO L264 CegarLoopResult]: At program point L24(lines 24 127) the Hoare annotation is: (or (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) (<= 8640 main_~s__state~0)) (<= main_~blastFlag~0 2)) [2020-07-11 00:58:39,563 INFO L264 CegarLoopResult]: At program point L57-1(lines 53 106) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-11 00:58:39,563 INFO L264 CegarLoopResult]: At program point L49(lines 49 108) the Hoare annotation is: (or (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) (<= 8640 main_~s__state~0)) (<= main_~blastFlag~0 2)) [2020-07-11 00:58:39,564 INFO L264 CegarLoopResult]: At program point L99(lines 17 134) the Hoare annotation is: (or (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) (<= 8640 main_~s__state~0)) (<= main_~blastFlag~0 2)) [2020-07-11 00:58:39,564 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (<= main_~blastFlag~0 0) [2020-07-11 00:58:39,564 INFO L264 CegarLoopResult]: At program point L25(lines 24 127) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-11 00:58:39,564 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (and (<= main_~blastFlag~0 2) (<= 8640 main_~s__state~0)) [2020-07-11 00:58:39,564 INFO L264 CegarLoopResult]: At program point L50(lines 49 108) the Hoare annotation is: (let ((.cse0 (<= 8656 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 2)) (and .cse0 (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3)))) [2020-07-11 00:58:39,564 INFO L264 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (let ((.cse0 (<= 8656 main_~s__state~0))) (or (and .cse0 (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3)) (and .cse0 (<= main_~blastFlag~0 0)))) [2020-07-11 00:58:39,565 INFO L264 CegarLoopResult]: At program point L92-1(lines 53 106) the Hoare annotation is: (and (<= 8656 main_~s__state~0) (<= main_~blastFlag~0 3)) [2020-07-11 00:58:39,565 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) (<= 8640 main_~s__state~0)) (<= main_~blastFlag~0 2)) [2020-07-11 00:58:39,565 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-11 00:58:39,565 INFO L271 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-07-11 00:58:39,565 INFO L271 CegarLoopResult]: At program point L10-2(line 10) the Hoare annotation is: true [2020-07-11 00:58:39,565 INFO L264 CegarLoopResult]: At program point L68(line 68) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-11 00:58:39,565 INFO L264 CegarLoopResult]: At program point L68-1(line 68) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-11 00:58:39,590 INFO L163 areAnnotationChecker]: CFG has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:58:39,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:58:39 BoogieIcfgContainer [2020-07-11 00:58:39,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:58:39,607 INFO L168 Benchmark]: Toolchain (without parser) took 6603.77 ms. Allocated memory was 145.8 MB in the beginning and 290.5 MB in the end (delta: 144.7 MB). Free memory was 103.6 MB in the beginning and 164.2 MB in the end (delta: -60.6 MB). Peak memory consumption was 84.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:58:39,608 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:58:39,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.45 ms. Allocated memory is still 145.8 MB. Free memory was 103.4 MB in the beginning and 92.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:58:39,610 INFO L168 Benchmark]: Boogie Preprocessor took 142.51 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 92.8 MB in the beginning and 182.1 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:58:39,611 INFO L168 Benchmark]: RCFGBuilder took 449.45 ms. Allocated memory is still 203.9 MB. Free memory was 182.1 MB in the beginning and 159.2 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:58:39,612 INFO L168 Benchmark]: TraceAbstraction took 5743.76 ms. Allocated memory was 203.9 MB in the beginning and 290.5 MB in the end (delta: 86.5 MB). Free memory was 159.2 MB in the beginning and 164.2 MB in the end (delta: -5.0 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:58:39,616 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 262.45 ms. Allocated memory is still 145.8 MB. Free memory was 103.4 MB in the beginning and 92.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.51 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 92.8 MB in the beginning and 182.1 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 449.45 ms. Allocated memory is still 203.9 MB. Free memory was 182.1 MB in the beginning and 159.2 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5743.76 ms. Allocated memory was 203.9 MB in the beginning and 290.5 MB in the end (delta: 86.5 MB). Free memory was 159.2 MB in the beginning and 164.2 MB in the end (delta: -5.0 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 138]: 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: 49]: Loop Invariant Derived loop invariant: (8656 <= s__state && blastFlag <= 2) || ((8656 <= s__state && !(0 == s__hit)) && blastFlag <= 3) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((!(0 == s__hit) && blastFlag <= 3) && 8640 <= s__state) || blastFlag <= 2 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8640 <= s__state) || ((!(0 == s__hit) && blastFlag <= 3) && 8640 <= s__state) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 8]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.9s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 295 SDtfs, 129 SDslu, 194 SDs, 0 SdLazy, 106 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 48 PreInvPairs, 162 NumberOfFragments, 272 HoareAnnotationTreeSize, 48 FomulaSimplifications, 975 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 48 FomulaSimplificationsInter, 122 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 9052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...