/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:21,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:21,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:21,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:21,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:21,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:21,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:21,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:21,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:21,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:21,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:21,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:21,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:21,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:21,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:21,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:21,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:21,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:21,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:21,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:21,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:21,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:21,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:21,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:21,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:21,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:21,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:21,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:21,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:21,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:21,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:21,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:21,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:21,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:21,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:21,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:21,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:21,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:21,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:21,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:21,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:21,124 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:21,137 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:21,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:21,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:21,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:21,139 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:21,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:21,139 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:21,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:21,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:21,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:21,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:21,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:21,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:21,141 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:21,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:21,141 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:21,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:21,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:21,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:21,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:21,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:21,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:21,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:21,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:21,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:21,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:21,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:21,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:21,143 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:21,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:21,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:21,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:21,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:21,495 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:21,495 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:21,496 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-10 15:27:21,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284a1d24d/ed68bbe71ab742c991266755f6cb53a3/FLAG7e5d0069f [2020-07-10 15:27:22,031 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:22,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-10 15:27:22,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284a1d24d/ed68bbe71ab742c991266755f6cb53a3/FLAG7e5d0069f [2020-07-10 15:27:22,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284a1d24d/ed68bbe71ab742c991266755f6cb53a3 [2020-07-10 15:27:22,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:22,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:22,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:22,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:22,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:22,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:22" (1/1) ... [2020-07-10 15:27:22,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2a1c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22, skipping insertion in model container [2020-07-10 15:27:22,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:22" (1/1) ... [2020-07-10 15:27:22,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:22,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:22,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:22,626 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:22,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:22,660 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:22,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22 WrapperNode [2020-07-10 15:27:22,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:22,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:22,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:22,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:22,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22" (1/1) ... [2020-07-10 15:27:22,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22" (1/1) ... [2020-07-10 15:27:22,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22" (1/1) ... [2020-07-10 15:27:22,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22" (1/1) ... [2020-07-10 15:27:22,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22" (1/1) ... [2020-07-10 15:27:22,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22" (1/1) ... [2020-07-10 15:27:22,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22" (1/1) ... [2020-07-10 15:27:22,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:22,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:22,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:22,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:22,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22" (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-10 15:27:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:27:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:22,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:27:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:27:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:23,111 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:23,111 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:27:23,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:23 BoogieIcfgContainer [2020-07-10 15:27:23,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:23,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:23,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:23,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:23,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:22" (1/3) ... [2020-07-10 15:27:23,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0edc9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:23, skipping insertion in model container [2020-07-10 15:27:23,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:22" (2/3) ... [2020-07-10 15:27:23,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0edc9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:23, skipping insertion in model container [2020-07-10 15:27:23,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:23" (3/3) ... [2020-07-10 15:27:23,140 INFO L109 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2020-07-10 15:27:23,168 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:23,181 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:23,211 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:23,234 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:23,234 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:23,235 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:23,235 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:23,235 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:23,235 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:23,235 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:23,235 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-10 15:27:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:27:23,259 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:23,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:23,260 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:23,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:23,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1474053726, now seen corresponding path program 1 times [2020-07-10 15:27:23,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:23,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117764617] [2020-07-10 15:27:23,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:23,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 15:27:23,397 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #51#return; {26#true} is VALID [2020-07-10 15:27:23,399 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-10 15:27:23,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 15:27:23,400 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #51#return; {26#true} is VALID [2020-07-10 15:27:23,401 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret3 := main(); {26#true} is VALID [2020-07-10 15:27:23,401 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {26#true} is VALID [2020-07-10 15:27:23,401 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} assume !!(~n~0 > 0);~i~0 := 0; {26#true} is VALID [2020-07-10 15:27:23,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2020-07-10 15:27:23,404 INFO L263 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {27#false} is VALID [2020-07-10 15:27:23,404 INFO L280 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-10 15:27:23,405 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-10 15:27:23,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-10 15:27:23,406 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-10 15:27:23,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117764617] [2020-07-10 15:27:23,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:23,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:27:23,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997776842] [2020-07-10 15:27:23,415 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-10 15:27:23,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:23,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:27:23,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:23,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:27:23,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:23,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:27:23,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:27:23,463 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2020-07-10 15:27:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:23,586 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2020-07-10 15:27:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:27:23,587 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-10 15:27:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2020-07-10 15:27:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2020-07-10 15:27:23,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2020-07-10 15:27:23,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:23,746 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:27:23,746 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 15:27:23,750 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:27:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 15:27:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 15:27:23,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:23,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 15:27:23,792 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 15:27:23,792 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 15:27:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:23,797 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-10 15:27:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 15:27:23,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:23,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:23,798 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 15:27:23,799 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 15:27:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:23,803 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-10 15:27:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 15:27:23,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:23,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:23,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:23,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:27:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-10 15:27:23,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2020-07-10 15:27:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:23,810 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-10 15:27:23,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:27:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 15:27:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:27:23,811 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:23,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:23,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:23,812 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1462047953, now seen corresponding path program 1 times [2020-07-10 15:27:23,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:23,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370564316] [2020-07-10 15:27:23,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:23,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {152#true} assume true; {152#true} is VALID [2020-07-10 15:27:23,886 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {152#true} {152#true} #51#return; {152#true} is VALID [2020-07-10 15:27:23,887 INFO L263 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2020-07-10 15:27:23,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {152#true} assume true; {152#true} is VALID [2020-07-10 15:27:23,887 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {152#true} {152#true} #51#return; {152#true} is VALID [2020-07-10 15:27:23,888 INFO L263 TraceCheckUtils]: 3: Hoare triple {152#true} call #t~ret3 := main(); {152#true} is VALID [2020-07-10 15:27:23,888 INFO L280 TraceCheckUtils]: 4: Hoare triple {152#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {152#true} is VALID [2020-07-10 15:27:23,890 INFO L280 TraceCheckUtils]: 5: Hoare triple {152#true} assume !!(~n~0 > 0);~i~0 := 0; {156#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2020-07-10 15:27:23,893 INFO L280 TraceCheckUtils]: 6: Hoare triple {156#(<= (+ main_~i~0 1) main_~n~0)} assume !(~i~0 < ~n~0); {153#false} is VALID [2020-07-10 15:27:23,893 INFO L263 TraceCheckUtils]: 7: Hoare triple {153#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {153#false} is VALID [2020-07-10 15:27:23,894 INFO L280 TraceCheckUtils]: 8: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2020-07-10 15:27:23,894 INFO L280 TraceCheckUtils]: 9: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2020-07-10 15:27:23,894 INFO L280 TraceCheckUtils]: 10: Hoare triple {153#false} assume !false; {153#false} is VALID [2020-07-10 15:27:23,895 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-10 15:27:23,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370564316] [2020-07-10 15:27:23,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:23,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:23,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393192151] [2020-07-10 15:27:23,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-10 15:27:23,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:23,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:23,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:23,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:23,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:23,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:23,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:23,916 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2020-07-10 15:27:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:23,979 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-10 15:27:23,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:23,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-10 15:27:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-10 15:27:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-10 15:27:23,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2020-07-10 15:27:24,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:24,030 INFO L225 Difference]: With dead ends: 27 [2020-07-10 15:27:24,030 INFO L226 Difference]: Without dead ends: 20 [2020-07-10 15:27:24,032 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-10 15:27:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-10 15:27:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-10 15:27:24,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:24,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-10 15:27:24,044 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 15:27:24,045 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 15:27:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:24,047 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-10 15:27:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-10 15:27:24,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:24,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:24,049 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 15:27:24,049 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 15:27:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:24,052 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-10 15:27:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-10 15:27:24,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:24,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:24,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:24,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:27:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-07-10 15:27:24,056 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2020-07-10 15:27:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:24,057 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-10 15:27:24,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-10 15:27:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:27:24,058 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:24,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:24,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:24,059 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:24,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1463775831, now seen corresponding path program 1 times [2020-07-10 15:27:24,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:24,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972568912] [2020-07-10 15:27:24,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:24,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-10 15:27:24,203 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {268#true} {268#true} #51#return; {268#true} is VALID [2020-07-10 15:27:24,204 INFO L263 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2020-07-10 15:27:24,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-10 15:27:24,204 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} #51#return; {268#true} is VALID [2020-07-10 15:27:24,205 INFO L263 TraceCheckUtils]: 3: Hoare triple {268#true} call #t~ret3 := main(); {268#true} is VALID [2020-07-10 15:27:24,206 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 15:27:24,207 INFO L280 TraceCheckUtils]: 5: Hoare triple {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0);~i~0 := 0; {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 15:27:24,208 INFO L280 TraceCheckUtils]: 6: Hoare triple {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {273#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 15:27:24,210 INFO L263 TraceCheckUtils]: 7: Hoare triple {273#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {274#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:27:24,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {274#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {275#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:27:24,211 INFO L280 TraceCheckUtils]: 9: Hoare triple {275#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {269#false} is VALID [2020-07-10 15:27:24,211 INFO L280 TraceCheckUtils]: 10: Hoare triple {269#false} assume !false; {269#false} is VALID [2020-07-10 15:27:24,213 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-10 15:27:24,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972568912] [2020-07-10 15:27:24,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:24,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:27:24,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840162968] [2020-07-10 15:27:24,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-10 15:27:24,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:24,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:27:24,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:24,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:27:24,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:24,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:27:24,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:24,231 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2020-07-10 15:27:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:24,443 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-10 15:27:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:27:24,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-10 15:27:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-10 15:27:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-10 15:27:24,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2020-07-10 15:27:24,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:24,491 INFO L225 Difference]: With dead ends: 28 [2020-07-10 15:27:24,491 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 15:27:24,492 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:27:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 15:27:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-10 15:27:24,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:24,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-10 15:27:24,511 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-10 15:27:24,511 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-10 15:27:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:24,514 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-10 15:27:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-10 15:27:24,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:24,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:24,515 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-10 15:27:24,515 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-10 15:27:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:24,518 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-10 15:27:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-10 15:27:24,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:24,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:24,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:24,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 15:27:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-10 15:27:24,522 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 11 [2020-07-10 15:27:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:24,523 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-10 15:27:24,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:27:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 15:27:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:27:24,524 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:24,524 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:24,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:27:24,525 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash -541842987, now seen corresponding path program 1 times [2020-07-10 15:27:24,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:24,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533825463] [2020-07-10 15:27:24,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:24,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-10 15:27:24,664 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {409#true} {409#true} #51#return; {409#true} is VALID [2020-07-10 15:27:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:24,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2020-07-10 15:27:24,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume !(0 == ~cond); {409#true} is VALID [2020-07-10 15:27:24,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-10 15:27:24,675 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {409#true} {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #55#return; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 15:27:24,676 INFO L263 TraceCheckUtils]: 0: Hoare triple {409#true} call ULTIMATE.init(); {409#true} is VALID [2020-07-10 15:27:24,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-10 15:27:24,676 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {409#true} {409#true} #51#return; {409#true} is VALID [2020-07-10 15:27:24,677 INFO L263 TraceCheckUtils]: 3: Hoare triple {409#true} call #t~ret3 := main(); {409#true} is VALID [2020-07-10 15:27:24,678 INFO L280 TraceCheckUtils]: 4: Hoare triple {409#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 15:27:24,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0);~i~0 := 0; {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 15:27:24,680 INFO L280 TraceCheckUtils]: 6: Hoare triple {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 15:27:24,680 INFO L263 TraceCheckUtils]: 7: Hoare triple {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {409#true} is VALID [2020-07-10 15:27:24,681 INFO L280 TraceCheckUtils]: 8: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2020-07-10 15:27:24,681 INFO L280 TraceCheckUtils]: 9: Hoare triple {409#true} assume !(0 == ~cond); {409#true} is VALID [2020-07-10 15:27:24,681 INFO L280 TraceCheckUtils]: 10: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-10 15:27:24,682 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {409#true} {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #55#return; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 15:27:24,683 INFO L280 TraceCheckUtils]: 12: Hoare triple {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 15:27:24,685 INFO L280 TraceCheckUtils]: 13: Hoare triple {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; {419#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} is VALID [2020-07-10 15:27:24,686 INFO L263 TraceCheckUtils]: 14: Hoare triple {419#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {420#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:27:24,687 INFO L280 TraceCheckUtils]: 15: Hoare triple {420#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {421#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:27:24,688 INFO L280 TraceCheckUtils]: 16: Hoare triple {421#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {410#false} is VALID [2020-07-10 15:27:24,688 INFO L280 TraceCheckUtils]: 17: Hoare triple {410#false} assume !false; {410#false} is VALID [2020-07-10 15:27:24,690 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-10 15:27:24,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533825463] [2020-07-10 15:27:24,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:24,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:27:24,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375286251] [2020-07-10 15:27:24,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-10 15:27:24,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:24,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:27:24,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:24,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:27:24,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:27:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:24,717 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 7 states. [2020-07-10 15:27:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:24,996 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-10 15:27:24,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:27:24,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-10 15:27:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-10 15:27:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-10 15:27:25,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2020-07-10 15:27:25,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:25,063 INFO L225 Difference]: With dead ends: 32 [2020-07-10 15:27:25,063 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:27:25,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:27:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:27:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-10 15:27:25,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:25,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-10 15:27:25,095 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-10 15:27:25,095 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-10 15:27:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:25,101 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 15:27:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 15:27:25,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:25,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:25,102 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-10 15:27:25,102 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-10 15:27:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:25,108 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 15:27:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 15:27:25,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:25,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:25,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:25,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-10 15:27:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-10 15:27:25,113 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 18 [2020-07-10 15:27:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:25,114 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-10 15:27:25,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:27:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-10 15:27:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:27:25,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:25,116 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:25,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:27:25,116 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:25,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:25,118 INFO L82 PathProgramCache]: Analyzing trace with hash 814692392, now seen corresponding path program 1 times [2020-07-10 15:27:25,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:25,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472778998] [2020-07-10 15:27:25,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:25,173 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:25,173 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:25,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:27:25,195 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:25,195 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:25,195 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:25,196 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:25,196 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:25,196 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:25,196 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:25,196 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:25,196 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:25,196 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:25,197 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:25,197 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:27:25,197 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:27:25,197 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:27:25,197 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:27:25,197 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:25,197 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-10 15:27:25,198 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:25,198 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-10 15:27:25,198 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-10 15:27:25,198 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-10 15:27:25,198 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:27:25,198 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:27:25,199 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-10 15:27:25,199 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:25,199 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 15:27:25,199 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 15:27:25,199 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:25,199 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:25,199 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:25,200 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:25,200 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:25,200 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:27:25,200 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-10 15:27:25,200 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:27:25,200 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:27:25,200 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:27:25,201 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:27:25,201 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:25,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:25 BoogieIcfgContainer [2020-07-10 15:27:25,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:25,206 INFO L168 Benchmark]: Toolchain (without parser) took 2783.63 ms. Allocated memory was 142.6 MB in the beginning and 247.5 MB in the end (delta: 104.9 MB). Free memory was 102.4 MB in the beginning and 208.0 MB in the end (delta: -105.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:27:25,210 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 142.6 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:25,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.68 ms. Allocated memory is still 142.6 MB. Free memory was 102.2 MB in the beginning and 92.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:25,212 INFO L168 Benchmark]: Boogie Preprocessor took 125.65 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 92.3 MB in the beginning and 178.6 MB in the end (delta: -86.3 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:25,213 INFO L168 Benchmark]: RCFGBuilder took 329.18 ms. Allocated memory is still 199.8 MB. Free memory was 178.6 MB in the beginning and 160.6 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:25,216 INFO L168 Benchmark]: TraceAbstraction took 2080.51 ms. Allocated memory was 199.8 MB in the beginning and 247.5 MB in the end (delta: 47.7 MB). Free memory was 159.9 MB in the beginning and 208.0 MB in the end (delta: -48.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:27:25,221 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.22 ms. Allocated memory is still 142.6 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 237.68 ms. Allocated memory is still 142.6 MB. Free memory was 102.2 MB in the beginning and 92.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.65 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 92.3 MB in the beginning and 178.6 MB in the end (delta: -86.3 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 329.18 ms. Allocated memory is still 199.8 MB. Free memory was 178.6 MB in the beginning and 160.6 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2080.51 ms. Allocated memory was 199.8 MB in the beginning and 247.5 MB in the end (delta: 47.7 MB). Free memory was 159.9 MB in the beginning and 208.0 MB in the end (delta: -48.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int i=0, x=0, y=0; [L18] int n=__VERIFIER_nondet_int(); [L19] COND FALSE !(!(n>0)) [L20] i=0 VAL [i=0, n=1, x=0, y=0] [L20] COND TRUE i