/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/array-fpi/brs3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:32:15,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:32:15,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:32:15,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:32:15,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:32:15,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:32:15,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:32:15,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:32:15,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:32:15,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:32:15,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:32:15,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:32:15,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:32:15,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:32:15,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:32:15,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:32:15,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:32:15,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:32:15,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:32:15,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:32:15,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:32:15,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:32:15,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:32:15,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:32:15,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:32:15,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:32:15,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:32:15,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:32:15,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:32:15,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:32:15,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:32:15,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:32:15,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:32:15,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:32:15,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:32:15,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:32:15,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:32:15,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:32:15,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:32:15,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:32:15,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:32:15,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 06:32:15,925 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:32:15,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:32:15,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:32:15,928 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:32:15,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:32:15,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:32:15,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:32:15,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:32:15,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:32:15,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:32:15,931 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:32:15,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:32:15,931 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:32:15,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:32:15,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:32:15,933 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:32:15,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:32:15,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:32:15,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:32:15,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:32:15,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:32:15,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:32:15,934 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-18 06:32:16,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:32:16,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:32:16,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:32:16,387 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:32:16,388 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:32:16,388 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs3f.c [2020-07-18 06:32:16,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d52ad550/d962c5f7a3b64d0abe41ca48f5ea8324/FLAGb715b80f5 [2020-07-18 06:32:16,921 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:32:16,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs3f.c [2020-07-18 06:32:16,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d52ad550/d962c5f7a3b64d0abe41ca48f5ea8324/FLAGb715b80f5 [2020-07-18 06:32:17,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d52ad550/d962c5f7a3b64d0abe41ca48f5ea8324 [2020-07-18 06:32:17,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:32:17,306 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:32:17,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:32:17,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:32:17,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:32:17,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:32:17" (1/1) ... [2020-07-18 06:32:17,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cef6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17, skipping insertion in model container [2020-07-18 06:32:17,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:32:17" (1/1) ... [2020-07-18 06:32:17,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:32:17,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:32:17,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:32:17,602 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:32:17,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:32:17,685 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:32:17,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17 WrapperNode [2020-07-18 06:32:17,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:32:17,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:32:17,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:32:17,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:32:17,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17" (1/1) ... [2020-07-18 06:32:17,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17" (1/1) ... [2020-07-18 06:32:17,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17" (1/1) ... [2020-07-18 06:32:17,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17" (1/1) ... [2020-07-18 06:32:17,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17" (1/1) ... [2020-07-18 06:32:17,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17" (1/1) ... [2020-07-18 06:32:17,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17" (1/1) ... [2020-07-18 06:32:17,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:32:17,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:32:17,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:32:17,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:32:17,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17" (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-18 06:32:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:32:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:32:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 06:32:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:32:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:32:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:32:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 06:32:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 06:32:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:32:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 06:32:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 06:32:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:32:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 06:32:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 06:32:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 06:32:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 06:32:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 06:32:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:32:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:32:18,505 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:32:18,506 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 06:32:18,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:32:18 BoogieIcfgContainer [2020-07-18 06:32:18,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:32:18,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:32:18,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:32:18,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:32:18,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:32:17" (1/3) ... [2020-07-18 06:32:18,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c81408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:32:18, skipping insertion in model container [2020-07-18 06:32:18,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:17" (2/3) ... [2020-07-18 06:32:18,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c81408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:32:18, skipping insertion in model container [2020-07-18 06:32:18,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:32:18" (3/3) ... [2020-07-18 06:32:18,522 INFO L109 eAbstractionObserver]: Analyzing ICFG brs3f.c [2020-07-18 06:32:18,534 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:32:18,543 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:32:18,557 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:32:18,583 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:32:18,583 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:32:18,584 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:32:18,584 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:32:18,584 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:32:18,584 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:32:18,585 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:32:18,585 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:32:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-18 06:32:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 06:32:18,610 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:18,611 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:18,612 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:18,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:18,618 INFO L82 PathProgramCache]: Analyzing trace with hash 221259408, now seen corresponding path program 1 times [2020-07-18 06:32:18,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:18,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [499535598] [2020-07-18 06:32:18,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:18,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-18 06:32:18,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-18 06:32:18,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-18 06:32:18,896 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-18 06:32:18,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 06:32:18,899 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-18 06:32:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:18,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-18 06:32:18,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-18 06:32:18,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 06:32:18,928 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-18 06:32:18,931 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:18,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-18 06:32:18,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-18 06:32:18,932 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-18 06:32:18,933 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-18 06:32:18,933 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 06:32:18,934 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-18 06:32:18,934 INFO L263 TraceCheckUtils]: 7: Hoare triple {62#true} call #t~ret7 := main(); {62#true} is VALID [2020-07-18 06:32:18,934 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {62#true} is VALID [2020-07-18 06:32:18,935 INFO L280 TraceCheckUtils]: 9: Hoare triple {62#true} ~N~0 := #t~nondet0; {62#true} is VALID [2020-07-18 06:32:18,936 INFO L280 TraceCheckUtils]: 10: Hoare triple {62#true} havoc #t~nondet0; {62#true} is VALID [2020-07-18 06:32:18,939 INFO L280 TraceCheckUtils]: 11: Hoare triple {62#true} assume !(~N~0 <= 0); {62#true} is VALID [2020-07-18 06:32:18,940 INFO L263 TraceCheckUtils]: 12: Hoare triple {62#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {62#true} is VALID [2020-07-18 06:32:18,941 INFO L280 TraceCheckUtils]: 13: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-18 06:32:18,941 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-18 06:32:18,942 INFO L280 TraceCheckUtils]: 15: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 06:32:18,943 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-18 06:32:18,943 INFO L280 TraceCheckUtils]: 17: Hoare triple {62#true} havoc ~i~0; {62#true} is VALID [2020-07-18 06:32:18,944 INFO L280 TraceCheckUtils]: 18: Hoare triple {62#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {62#true} is VALID [2020-07-18 06:32:18,944 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {62#true} is VALID [2020-07-18 06:32:18,945 INFO L280 TraceCheckUtils]: 20: Hoare triple {62#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {62#true} is VALID [2020-07-18 06:32:18,945 INFO L280 TraceCheckUtils]: 21: Hoare triple {62#true} ~i~0 := 0; {62#true} is VALID [2020-07-18 06:32:18,946 INFO L280 TraceCheckUtils]: 22: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-18 06:32:18,947 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} ~i~0 := 0; {63#false} is VALID [2020-07-18 06:32:18,947 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !(~i~0 < ~N~0); {63#false} is VALID [2020-07-18 06:32:18,947 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {63#false} is VALID [2020-07-18 06:32:18,948 INFO L263 TraceCheckUtils]: 26: Hoare triple {63#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {63#false} is VALID [2020-07-18 06:32:18,948 INFO L280 TraceCheckUtils]: 27: Hoare triple {63#false} ~cond := #in~cond; {63#false} is VALID [2020-07-18 06:32:18,949 INFO L280 TraceCheckUtils]: 28: Hoare triple {63#false} assume 0 == ~cond; {63#false} is VALID [2020-07-18 06:32:18,949 INFO L280 TraceCheckUtils]: 29: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-18 06:32:18,954 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-18 06:32:18,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [499535598] [2020-07-18 06:32:18,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:32:18,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 06:32:18,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842972578] [2020-07-18 06:32:18,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-18 06:32:18,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:18,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 06:32:19,050 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-18 06:32:19,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 06:32:19,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 06:32:19,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:32:19,066 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-18 06:32:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:19,533 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2020-07-18 06:32:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 06:32:19,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-18 06:32:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:32:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-18 06:32:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:32:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-18 06:32:19,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2020-07-18 06:32:19,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:19,781 INFO L225 Difference]: With dead ends: 101 [2020-07-18 06:32:19,782 INFO L226 Difference]: Without dead ends: 47 [2020-07-18 06:32:19,787 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-18 06:32:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-18 06:32:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-18 06:32:19,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:19,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-18 06:32:19,897 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-18 06:32:19,897 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-18 06:32:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:19,916 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-18 06:32:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-18 06:32:19,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:19,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:19,920 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-18 06:32:19,920 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-18 06:32:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:19,933 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-18 06:32:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-18 06:32:19,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:19,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:19,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:19,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-18 06:32:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-07-18 06:32:19,951 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 30 [2020-07-18 06:32:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:19,952 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-18 06:32:19,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 06:32:19,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2020-07-18 06:32:20,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-18 06:32:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 06:32:20,041 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:20,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:20,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:32:20,042 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash -151091841, now seen corresponding path program 1 times [2020-07-18 06:32:20,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:20,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1357424642] [2020-07-18 06:32:20,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:20,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {467#true} is VALID [2020-07-18 06:32:20,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-18 06:32:20,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-18 06:32:20,264 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-18 06:32:20,264 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 06:32:20,264 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-18 06:32:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:20,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-18 06:32:20,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-18 06:32:20,274 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 06:32:20,275 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:20,276 INFO L263 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:20,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {467#true} is VALID [2020-07-18 06:32:20,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-18 06:32:20,278 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-18 06:32:20,278 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-18 06:32:20,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 06:32:20,279 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-18 06:32:20,279 INFO L263 TraceCheckUtils]: 7: Hoare triple {467#true} call #t~ret7 := main(); {467#true} is VALID [2020-07-18 06:32:20,279 INFO L280 TraceCheckUtils]: 8: Hoare triple {467#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {467#true} is VALID [2020-07-18 06:32:20,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {467#true} ~N~0 := #t~nondet0; {467#true} is VALID [2020-07-18 06:32:20,280 INFO L280 TraceCheckUtils]: 10: Hoare triple {467#true} havoc #t~nondet0; {467#true} is VALID [2020-07-18 06:32:20,281 INFO L280 TraceCheckUtils]: 11: Hoare triple {467#true} assume !(~N~0 <= 0); {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:20,281 INFO L263 TraceCheckUtils]: 12: Hoare triple {475#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {467#true} is VALID [2020-07-18 06:32:20,282 INFO L280 TraceCheckUtils]: 13: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-18 06:32:20,282 INFO L280 TraceCheckUtils]: 14: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-18 06:32:20,282 INFO L280 TraceCheckUtils]: 15: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 06:32:20,283 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:20,284 INFO L280 TraceCheckUtils]: 17: Hoare triple {475#(<= 1 ~N~0)} havoc ~i~0; {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:20,285 INFO L280 TraceCheckUtils]: 18: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:20,286 INFO L280 TraceCheckUtils]: 19: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:20,287 INFO L280 TraceCheckUtils]: 20: Hoare triple {475#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:20,288 INFO L280 TraceCheckUtils]: 21: Hoare triple {475#(<= 1 ~N~0)} ~i~0 := 0; {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 06:32:20,289 INFO L280 TraceCheckUtils]: 22: Hoare triple {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-18 06:32:20,290 INFO L280 TraceCheckUtils]: 23: Hoare triple {468#false} ~i~0 := 0; {468#false} is VALID [2020-07-18 06:32:20,290 INFO L280 TraceCheckUtils]: 24: Hoare triple {468#false} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-18 06:32:20,291 INFO L280 TraceCheckUtils]: 25: Hoare triple {468#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {468#false} is VALID [2020-07-18 06:32:20,291 INFO L263 TraceCheckUtils]: 26: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {468#false} is VALID [2020-07-18 06:32:20,292 INFO L280 TraceCheckUtils]: 27: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2020-07-18 06:32:20,292 INFO L280 TraceCheckUtils]: 28: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2020-07-18 06:32:20,292 INFO L280 TraceCheckUtils]: 29: Hoare triple {468#false} assume !false; {468#false} is VALID [2020-07-18 06:32:20,294 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-18 06:32:20,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1357424642] [2020-07-18 06:32:20,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:32:20,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 06:32:20,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670613320] [2020-07-18 06:32:20,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 06:32:20,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:20,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:32:20,343 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-18 06:32:20,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:32:20,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:20,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:32:20,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:32:20,344 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2020-07-18 06:32:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:20,911 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2020-07-18 06:32:20,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 06:32:20,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 06:32:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:32:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-18 06:32:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:32:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-18 06:32:20,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2020-07-18 06:32:21,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:21,048 INFO L225 Difference]: With dead ends: 81 [2020-07-18 06:32:21,049 INFO L226 Difference]: Without dead ends: 56 [2020-07-18 06:32:21,054 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:32:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-18 06:32:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2020-07-18 06:32:21,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:21,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 51 states. [2020-07-18 06:32:21,154 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 51 states. [2020-07-18 06:32:21,155 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 51 states. [2020-07-18 06:32:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:21,159 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-18 06:32:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-18 06:32:21,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:21,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:21,160 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 56 states. [2020-07-18 06:32:21,160 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 56 states. [2020-07-18 06:32:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:21,164 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-18 06:32:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-18 06:32:21,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:21,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:21,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:21,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-18 06:32:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-07-18 06:32:21,169 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 30 [2020-07-18 06:32:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:21,170 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-07-18 06:32:21,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:32:21,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2020-07-18 06:32:21,257 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-18 06:32:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-18 06:32:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-18 06:32:21,259 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:21,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:21,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:32:21,260 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:21,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1707000309, now seen corresponding path program 1 times [2020-07-18 06:32:21,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:21,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1078151122] [2020-07-18 06:32:21,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:21,461 INFO L280 TraceCheckUtils]: 0: Hoare triple {880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {863#true} is VALID [2020-07-18 06:32:21,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {863#true} #valid := #valid[0 := 0]; {863#true} is VALID [2020-07-18 06:32:21,462 INFO L280 TraceCheckUtils]: 2: Hoare triple {863#true} assume 0 < #StackHeapBarrier; {863#true} is VALID [2020-07-18 06:32:21,464 INFO L280 TraceCheckUtils]: 3: Hoare triple {863#true} ~N~0 := 0; {863#true} is VALID [2020-07-18 06:32:21,464 INFO L280 TraceCheckUtils]: 4: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-18 06:32:21,464 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {863#true} {863#true} #103#return; {863#true} is VALID [2020-07-18 06:32:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:21,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {863#true} ~cond := #in~cond; {863#true} is VALID [2020-07-18 06:32:21,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {863#true} assume !(0 == ~cond); {863#true} is VALID [2020-07-18 06:32:21,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-18 06:32:21,488 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {863#true} {871#(<= 1 ~N~0)} #99#return; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,489 INFO L263 TraceCheckUtils]: 0: Hoare triple {863#true} call ULTIMATE.init(); {880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:21,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {863#true} is VALID [2020-07-18 06:32:21,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {863#true} #valid := #valid[0 := 0]; {863#true} is VALID [2020-07-18 06:32:21,490 INFO L280 TraceCheckUtils]: 3: Hoare triple {863#true} assume 0 < #StackHeapBarrier; {863#true} is VALID [2020-07-18 06:32:21,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {863#true} ~N~0 := 0; {863#true} is VALID [2020-07-18 06:32:21,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-18 06:32:21,491 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {863#true} {863#true} #103#return; {863#true} is VALID [2020-07-18 06:32:21,492 INFO L263 TraceCheckUtils]: 7: Hoare triple {863#true} call #t~ret7 := main(); {863#true} is VALID [2020-07-18 06:32:21,492 INFO L280 TraceCheckUtils]: 8: Hoare triple {863#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {863#true} is VALID [2020-07-18 06:32:21,492 INFO L280 TraceCheckUtils]: 9: Hoare triple {863#true} ~N~0 := #t~nondet0; {863#true} is VALID [2020-07-18 06:32:21,492 INFO L280 TraceCheckUtils]: 10: Hoare triple {863#true} havoc #t~nondet0; {863#true} is VALID [2020-07-18 06:32:21,493 INFO L280 TraceCheckUtils]: 11: Hoare triple {863#true} assume !(~N~0 <= 0); {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,494 INFO L263 TraceCheckUtils]: 12: Hoare triple {871#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {863#true} is VALID [2020-07-18 06:32:21,494 INFO L280 TraceCheckUtils]: 13: Hoare triple {863#true} ~cond := #in~cond; {863#true} is VALID [2020-07-18 06:32:21,494 INFO L280 TraceCheckUtils]: 14: Hoare triple {863#true} assume !(0 == ~cond); {863#true} is VALID [2020-07-18 06:32:21,494 INFO L280 TraceCheckUtils]: 15: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-18 06:32:21,501 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {863#true} {871#(<= 1 ~N~0)} #99#return; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,502 INFO L280 TraceCheckUtils]: 17: Hoare triple {871#(<= 1 ~N~0)} havoc ~i~0; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,507 INFO L280 TraceCheckUtils]: 18: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,508 INFO L280 TraceCheckUtils]: 19: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,509 INFO L280 TraceCheckUtils]: 20: Hoare triple {871#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,510 INFO L280 TraceCheckUtils]: 21: Hoare triple {871#(<= 1 ~N~0)} ~i~0 := 0; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,512 INFO L280 TraceCheckUtils]: 22: Hoare triple {871#(<= 1 ~N~0)} assume !!(~i~0 < ~N~0); {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,513 INFO L280 TraceCheckUtils]: 23: Hoare triple {871#(<= 1 ~N~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3); {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,513 INFO L280 TraceCheckUtils]: 24: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,514 INFO L280 TraceCheckUtils]: 25: Hoare triple {871#(<= 1 ~N~0)} #t~post2 := ~i~0; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,514 INFO L280 TraceCheckUtils]: 26: Hoare triple {871#(<= 1 ~N~0)} ~i~0 := 1 + #t~post2; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,515 INFO L280 TraceCheckUtils]: 27: Hoare triple {871#(<= 1 ~N~0)} havoc #t~post2; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,518 INFO L280 TraceCheckUtils]: 28: Hoare triple {871#(<= 1 ~N~0)} assume !(~i~0 < ~N~0); {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,519 INFO L280 TraceCheckUtils]: 29: Hoare triple {871#(<= 1 ~N~0)} ~i~0 := 0; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,520 INFO L280 TraceCheckUtils]: 30: Hoare triple {871#(<= 1 ~N~0)} assume !!(~i~0 < ~N~0); {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,534 INFO L280 TraceCheckUtils]: 31: Hoare triple {871#(<= 1 ~N~0)} assume 0 == ~i~0; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:21,538 INFO L280 TraceCheckUtils]: 32: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:21,539 INFO L280 TraceCheckUtils]: 33: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post3 := ~i~0; {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:21,540 INFO L280 TraceCheckUtils]: 34: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} ~i~0 := 1 + #t~post3; {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:21,541 INFO L280 TraceCheckUtils]: 35: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} havoc #t~post3; {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:21,541 INFO L280 TraceCheckUtils]: 36: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(~i~0 < ~N~0); {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:21,542 INFO L280 TraceCheckUtils]: 37: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {877#(and (= 0 |main_#t~mem6|) (<= 1 ~N~0))} is VALID [2020-07-18 06:32:21,546 INFO L263 TraceCheckUtils]: 38: Hoare triple {877#(and (= 0 |main_#t~mem6|) (<= 1 ~N~0))} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {878#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:32:21,547 INFO L280 TraceCheckUtils]: 39: Hoare triple {878#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {879#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:32:21,548 INFO L280 TraceCheckUtils]: 40: Hoare triple {879#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {864#false} is VALID [2020-07-18 06:32:21,548 INFO L280 TraceCheckUtils]: 41: Hoare triple {864#false} assume !false; {864#false} is VALID [2020-07-18 06:32:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 06:32:21,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1078151122] [2020-07-18 06:32:21,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:32:21,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 06:32:21,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747538304] [2020-07-18 06:32:21,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-18 06:32:21,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:21,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 06:32:21,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:21,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 06:32:21,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 06:32:21,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 06:32:21,615 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 8 states. [2020-07-18 06:32:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:22,382 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-18 06:32:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 06:32:22,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-18 06:32:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 06:32:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2020-07-18 06:32:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 06:32:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2020-07-18 06:32:22,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2020-07-18 06:32:22,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:22,497 INFO L225 Difference]: With dead ends: 66 [2020-07-18 06:32:22,497 INFO L226 Difference]: Without dead ends: 60 [2020-07-18 06:32:22,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-18 06:32:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-18 06:32:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2020-07-18 06:32:22,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:22,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 55 states. [2020-07-18 06:32:22,618 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 55 states. [2020-07-18 06:32:22,618 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 55 states. [2020-07-18 06:32:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:22,622 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 06:32:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-18 06:32:22,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:22,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:22,624 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 60 states. [2020-07-18 06:32:22,624 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 60 states. [2020-07-18 06:32:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:22,633 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 06:32:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-18 06:32:22,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:22,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:22,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:22,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-18 06:32:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-18 06:32:22,638 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 42 [2020-07-18 06:32:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:22,642 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-18 06:32:22,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 06:32:22,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2020-07-18 06:32:22,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-18 06:32:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 06:32:22,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:22,735 INFO L422 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:22,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:32:22,735 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1747495296, now seen corresponding path program 1 times [2020-07-18 06:32:22,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:22,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185120808] [2020-07-18 06:32:22,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:22,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {1273#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1254#true} is VALID [2020-07-18 06:32:22,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {1254#true} #valid := #valid[0 := 0]; {1254#true} is VALID [2020-07-18 06:32:22,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {1254#true} assume 0 < #StackHeapBarrier; {1254#true} is VALID [2020-07-18 06:32:22,922 INFO L280 TraceCheckUtils]: 3: Hoare triple {1254#true} ~N~0 := 0; {1254#true} is VALID [2020-07-18 06:32:22,922 INFO L280 TraceCheckUtils]: 4: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-18 06:32:22,922 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1254#true} {1254#true} #103#return; {1254#true} is VALID [2020-07-18 06:32:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:22,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {1254#true} ~cond := #in~cond; {1254#true} is VALID [2020-07-18 06:32:22,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {1254#true} assume !(0 == ~cond); {1254#true} is VALID [2020-07-18 06:32:22,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-18 06:32:22,928 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} #99#return; {1254#true} is VALID [2020-07-18 06:32:22,930 INFO L263 TraceCheckUtils]: 0: Hoare triple {1254#true} call ULTIMATE.init(); {1273#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:22,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {1273#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1254#true} is VALID [2020-07-18 06:32:22,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {1254#true} #valid := #valid[0 := 0]; {1254#true} is VALID [2020-07-18 06:32:22,931 INFO L280 TraceCheckUtils]: 3: Hoare triple {1254#true} assume 0 < #StackHeapBarrier; {1254#true} is VALID [2020-07-18 06:32:22,931 INFO L280 TraceCheckUtils]: 4: Hoare triple {1254#true} ~N~0 := 0; {1254#true} is VALID [2020-07-18 06:32:22,931 INFO L280 TraceCheckUtils]: 5: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-18 06:32:22,931 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1254#true} {1254#true} #103#return; {1254#true} is VALID [2020-07-18 06:32:22,932 INFO L263 TraceCheckUtils]: 7: Hoare triple {1254#true} call #t~ret7 := main(); {1254#true} is VALID [2020-07-18 06:32:22,932 INFO L280 TraceCheckUtils]: 8: Hoare triple {1254#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1254#true} is VALID [2020-07-18 06:32:22,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {1254#true} ~N~0 := #t~nondet0; {1254#true} is VALID [2020-07-18 06:32:22,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {1254#true} havoc #t~nondet0; {1254#true} is VALID [2020-07-18 06:32:22,932 INFO L280 TraceCheckUtils]: 11: Hoare triple {1254#true} assume !(~N~0 <= 0); {1254#true} is VALID [2020-07-18 06:32:22,933 INFO L263 TraceCheckUtils]: 12: Hoare triple {1254#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1254#true} is VALID [2020-07-18 06:32:22,933 INFO L280 TraceCheckUtils]: 13: Hoare triple {1254#true} ~cond := #in~cond; {1254#true} is VALID [2020-07-18 06:32:22,933 INFO L280 TraceCheckUtils]: 14: Hoare triple {1254#true} assume !(0 == ~cond); {1254#true} is VALID [2020-07-18 06:32:22,933 INFO L280 TraceCheckUtils]: 15: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-18 06:32:22,934 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1254#true} {1254#true} #99#return; {1254#true} is VALID [2020-07-18 06:32:22,934 INFO L280 TraceCheckUtils]: 17: Hoare triple {1254#true} havoc ~i~0; {1254#true} is VALID [2020-07-18 06:32:22,934 INFO L280 TraceCheckUtils]: 18: Hoare triple {1254#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {1254#true} is VALID [2020-07-18 06:32:22,934 INFO L280 TraceCheckUtils]: 19: Hoare triple {1254#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {1254#true} is VALID [2020-07-18 06:32:22,935 INFO L280 TraceCheckUtils]: 20: Hoare triple {1254#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1254#true} is VALID [2020-07-18 06:32:22,936 INFO L280 TraceCheckUtils]: 21: Hoare triple {1254#true} ~i~0 := 0; {1266#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:22,936 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {1266#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:22,937 INFO L280 TraceCheckUtils]: 23: Hoare triple {1266#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3); {1266#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:22,938 INFO L280 TraceCheckUtils]: 24: Hoare triple {1266#(= 0 main_~i~0)} SUMMARY for call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1266#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:22,939 INFO L280 TraceCheckUtils]: 25: Hoare triple {1266#(= 0 main_~i~0)} #t~post2 := ~i~0; {1267#(= |main_#t~post2| 0)} is VALID [2020-07-18 06:32:22,939 INFO L280 TraceCheckUtils]: 26: Hoare triple {1267#(= |main_#t~post2| 0)} ~i~0 := 1 + #t~post2; {1268#(<= main_~i~0 1)} is VALID [2020-07-18 06:32:22,940 INFO L280 TraceCheckUtils]: 27: Hoare triple {1268#(<= main_~i~0 1)} havoc #t~post2; {1268#(<= main_~i~0 1)} is VALID [2020-07-18 06:32:22,941 INFO L280 TraceCheckUtils]: 28: Hoare triple {1268#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {1269#(<= ~N~0 1)} is VALID [2020-07-18 06:32:22,943 INFO L280 TraceCheckUtils]: 29: Hoare triple {1269#(<= ~N~0 1)} ~i~0 := 0; {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:22,944 INFO L280 TraceCheckUtils]: 30: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:22,945 INFO L280 TraceCheckUtils]: 31: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} assume 0 == ~i~0; {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:22,946 INFO L280 TraceCheckUtils]: 32: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:22,947 INFO L280 TraceCheckUtils]: 33: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} #t~post3 := ~i~0; {1271#(and (= |main_#t~post3| 0) (<= ~N~0 1))} is VALID [2020-07-18 06:32:22,948 INFO L280 TraceCheckUtils]: 34: Hoare triple {1271#(and (= |main_#t~post3| 0) (<= ~N~0 1))} ~i~0 := 1 + #t~post3; {1272#(<= ~N~0 main_~i~0)} is VALID [2020-07-18 06:32:22,948 INFO L280 TraceCheckUtils]: 35: Hoare triple {1272#(<= ~N~0 main_~i~0)} havoc #t~post3; {1272#(<= ~N~0 main_~i~0)} is VALID [2020-07-18 06:32:22,949 INFO L280 TraceCheckUtils]: 36: Hoare triple {1272#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0); {1255#false} is VALID [2020-07-18 06:32:22,950 INFO L280 TraceCheckUtils]: 37: Hoare triple {1255#false} assume !(0 == ~i~0); {1255#false} is VALID [2020-07-18 06:32:22,950 INFO L280 TraceCheckUtils]: 38: Hoare triple {1255#false} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43 {1255#false} is VALID [2020-07-18 06:32:22,950 INFO L280 TraceCheckUtils]: 39: Hoare triple {1255#false} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {1255#false} is VALID [2020-07-18 06:32:22,950 INFO L280 TraceCheckUtils]: 40: Hoare triple {1255#false} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43-2 {1255#false} is VALID [2020-07-18 06:32:22,951 INFO L280 TraceCheckUtils]: 41: Hoare triple {1255#false} havoc #t~mem5; {1255#false} is VALID [2020-07-18 06:32:22,951 INFO L280 TraceCheckUtils]: 42: Hoare triple {1255#false} havoc #t~mem4; {1255#false} is VALID [2020-07-18 06:32:22,951 INFO L280 TraceCheckUtils]: 43: Hoare triple {1255#false} #t~post3 := ~i~0; {1255#false} is VALID [2020-07-18 06:32:22,951 INFO L280 TraceCheckUtils]: 44: Hoare triple {1255#false} ~i~0 := 1 + #t~post3; {1255#false} is VALID [2020-07-18 06:32:22,952 INFO L280 TraceCheckUtils]: 45: Hoare triple {1255#false} havoc #t~post3; {1255#false} is VALID [2020-07-18 06:32:22,952 INFO L280 TraceCheckUtils]: 46: Hoare triple {1255#false} assume !(~i~0 < ~N~0); {1255#false} is VALID [2020-07-18 06:32:22,952 INFO L280 TraceCheckUtils]: 47: Hoare triple {1255#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {1255#false} is VALID [2020-07-18 06:32:22,952 INFO L263 TraceCheckUtils]: 48: Hoare triple {1255#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {1255#false} is VALID [2020-07-18 06:32:22,952 INFO L280 TraceCheckUtils]: 49: Hoare triple {1255#false} ~cond := #in~cond; {1255#false} is VALID [2020-07-18 06:32:22,953 INFO L280 TraceCheckUtils]: 50: Hoare triple {1255#false} assume 0 == ~cond; {1255#false} is VALID [2020-07-18 06:32:22,953 INFO L280 TraceCheckUtils]: 51: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2020-07-18 06:32:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:32:22,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1185120808] [2020-07-18 06:32:22,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:32:22,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-18 06:32:22,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643020950] [2020-07-18 06:32:22,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-07-18 06:32:22,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:22,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 06:32:23,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:23,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 06:32:23,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:23,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 06:32:23,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-18 06:32:23,025 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 10 states. [2020-07-18 06:32:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:23,850 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2020-07-18 06:32:23,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 06:32:23,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-07-18 06:32:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 06:32:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2020-07-18 06:32:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 06:32:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2020-07-18 06:32:23,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 94 transitions. [2020-07-18 06:32:23,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:23,969 INFO L225 Difference]: With dead ends: 94 [2020-07-18 06:32:23,969 INFO L226 Difference]: Without dead ends: 65 [2020-07-18 06:32:23,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-07-18 06:32:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-18 06:32:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2020-07-18 06:32:24,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:24,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 60 states. [2020-07-18 06:32:24,080 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 60 states. [2020-07-18 06:32:24,080 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 60 states. [2020-07-18 06:32:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:24,083 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-18 06:32:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-18 06:32:24,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:24,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:24,085 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 65 states. [2020-07-18 06:32:24,085 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 65 states. [2020-07-18 06:32:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:24,089 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-18 06:32:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-18 06:32:24,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:24,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:24,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:24,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-18 06:32:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2020-07-18 06:32:24,093 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 52 [2020-07-18 06:32:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:24,093 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2020-07-18 06:32:24,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 06:32:24,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 63 transitions. [2020-07-18 06:32:24,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2020-07-18 06:32:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 06:32:24,173 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:24,173 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:24,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 06:32:24,174 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:24,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1872706551, now seen corresponding path program 2 times [2020-07-18 06:32:24,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:24,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1938968654] [2020-07-18 06:32:24,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:24,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {1741#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1726#true} is VALID [2020-07-18 06:32:24,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {1726#true} #valid := #valid[0 := 0]; {1726#true} is VALID [2020-07-18 06:32:24,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#true} assume 0 < #StackHeapBarrier; {1726#true} is VALID [2020-07-18 06:32:24,327 INFO L280 TraceCheckUtils]: 3: Hoare triple {1726#true} ~N~0 := 0; {1726#true} is VALID [2020-07-18 06:32:24,327 INFO L280 TraceCheckUtils]: 4: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-18 06:32:24,327 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1726#true} {1726#true} #103#return; {1726#true} is VALID [2020-07-18 06:32:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:24,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2020-07-18 06:32:24,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2020-07-18 06:32:24,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-18 06:32:24,350 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1726#true} {1726#true} #99#return; {1726#true} is VALID [2020-07-18 06:32:24,358 INFO L263 TraceCheckUtils]: 0: Hoare triple {1726#true} call ULTIMATE.init(); {1741#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:24,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {1741#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1726#true} is VALID [2020-07-18 06:32:24,358 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#true} #valid := #valid[0 := 0]; {1726#true} is VALID [2020-07-18 06:32:24,358 INFO L280 TraceCheckUtils]: 3: Hoare triple {1726#true} assume 0 < #StackHeapBarrier; {1726#true} is VALID [2020-07-18 06:32:24,359 INFO L280 TraceCheckUtils]: 4: Hoare triple {1726#true} ~N~0 := 0; {1726#true} is VALID [2020-07-18 06:32:24,359 INFO L280 TraceCheckUtils]: 5: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-18 06:32:24,359 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1726#true} {1726#true} #103#return; {1726#true} is VALID [2020-07-18 06:32:24,360 INFO L263 TraceCheckUtils]: 7: Hoare triple {1726#true} call #t~ret7 := main(); {1726#true} is VALID [2020-07-18 06:32:24,360 INFO L280 TraceCheckUtils]: 8: Hoare triple {1726#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1726#true} is VALID [2020-07-18 06:32:24,360 INFO L280 TraceCheckUtils]: 9: Hoare triple {1726#true} ~N~0 := #t~nondet0; {1726#true} is VALID [2020-07-18 06:32:24,360 INFO L280 TraceCheckUtils]: 10: Hoare triple {1726#true} havoc #t~nondet0; {1726#true} is VALID [2020-07-18 06:32:24,360 INFO L280 TraceCheckUtils]: 11: Hoare triple {1726#true} assume !(~N~0 <= 0); {1726#true} is VALID [2020-07-18 06:32:24,361 INFO L263 TraceCheckUtils]: 12: Hoare triple {1726#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1726#true} is VALID [2020-07-18 06:32:24,361 INFO L280 TraceCheckUtils]: 13: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2020-07-18 06:32:24,361 INFO L280 TraceCheckUtils]: 14: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2020-07-18 06:32:24,362 INFO L280 TraceCheckUtils]: 15: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-18 06:32:24,362 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1726#true} {1726#true} #99#return; {1726#true} is VALID [2020-07-18 06:32:24,362 INFO L280 TraceCheckUtils]: 17: Hoare triple {1726#true} havoc ~i~0; {1726#true} is VALID [2020-07-18 06:32:24,362 INFO L280 TraceCheckUtils]: 18: Hoare triple {1726#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {1726#true} is VALID [2020-07-18 06:32:24,363 INFO L280 TraceCheckUtils]: 19: Hoare triple {1726#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {1726#true} is VALID [2020-07-18 06:32:24,363 INFO L280 TraceCheckUtils]: 20: Hoare triple {1726#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1726#true} is VALID [2020-07-18 06:32:24,364 INFO L280 TraceCheckUtils]: 21: Hoare triple {1726#true} ~i~0 := 0; {1738#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:24,364 INFO L280 TraceCheckUtils]: 22: Hoare triple {1738#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {1738#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:24,365 INFO L280 TraceCheckUtils]: 23: Hoare triple {1738#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3); {1738#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:24,366 INFO L280 TraceCheckUtils]: 24: Hoare triple {1738#(= 0 main_~i~0)} SUMMARY for call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1738#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:24,367 INFO L280 TraceCheckUtils]: 25: Hoare triple {1738#(= 0 main_~i~0)} #t~post2 := ~i~0; {1739#(= |main_#t~post2| 0)} is VALID [2020-07-18 06:32:24,367 INFO L280 TraceCheckUtils]: 26: Hoare triple {1739#(= |main_#t~post2| 0)} ~i~0 := 1 + #t~post2; {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} is VALID [2020-07-18 06:32:24,368 INFO L280 TraceCheckUtils]: 27: Hoare triple {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} havoc #t~post2; {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} is VALID [2020-07-18 06:32:24,369 INFO L280 TraceCheckUtils]: 28: Hoare triple {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} assume !!(~i~0 < ~N~0); {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} is VALID [2020-07-18 06:32:24,370 INFO L280 TraceCheckUtils]: 29: Hoare triple {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3); {1727#false} is VALID [2020-07-18 06:32:24,371 INFO L280 TraceCheckUtils]: 30: Hoare triple {1727#false} SUMMARY for call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1727#false} is VALID [2020-07-18 06:32:24,371 INFO L280 TraceCheckUtils]: 31: Hoare triple {1727#false} #t~post2 := ~i~0; {1727#false} is VALID [2020-07-18 06:32:24,371 INFO L280 TraceCheckUtils]: 32: Hoare triple {1727#false} ~i~0 := 1 + #t~post2; {1727#false} is VALID [2020-07-18 06:32:24,371 INFO L280 TraceCheckUtils]: 33: Hoare triple {1727#false} havoc #t~post2; {1727#false} is VALID [2020-07-18 06:32:24,372 INFO L280 TraceCheckUtils]: 34: Hoare triple {1727#false} assume !(~i~0 < ~N~0); {1727#false} is VALID [2020-07-18 06:32:24,372 INFO L280 TraceCheckUtils]: 35: Hoare triple {1727#false} ~i~0 := 0; {1727#false} is VALID [2020-07-18 06:32:24,372 INFO L280 TraceCheckUtils]: 36: Hoare triple {1727#false} assume !!(~i~0 < ~N~0); {1727#false} is VALID [2020-07-18 06:32:24,372 INFO L280 TraceCheckUtils]: 37: Hoare triple {1727#false} assume 0 == ~i~0; {1727#false} is VALID [2020-07-18 06:32:24,373 INFO L280 TraceCheckUtils]: 38: Hoare triple {1727#false} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {1727#false} is VALID [2020-07-18 06:32:24,373 INFO L280 TraceCheckUtils]: 39: Hoare triple {1727#false} #t~post3 := ~i~0; {1727#false} is VALID [2020-07-18 06:32:24,373 INFO L280 TraceCheckUtils]: 40: Hoare triple {1727#false} ~i~0 := 1 + #t~post3; {1727#false} is VALID [2020-07-18 06:32:24,373 INFO L280 TraceCheckUtils]: 41: Hoare triple {1727#false} havoc #t~post3; {1727#false} is VALID [2020-07-18 06:32:24,374 INFO L280 TraceCheckUtils]: 42: Hoare triple {1727#false} assume !!(~i~0 < ~N~0); {1727#false} is VALID [2020-07-18 06:32:24,374 INFO L280 TraceCheckUtils]: 43: Hoare triple {1727#false} assume !(0 == ~i~0); {1727#false} is VALID [2020-07-18 06:32:24,374 INFO L280 TraceCheckUtils]: 44: Hoare triple {1727#false} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43 {1727#false} is VALID [2020-07-18 06:32:24,374 INFO L280 TraceCheckUtils]: 45: Hoare triple {1727#false} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {1727#false} is VALID [2020-07-18 06:32:24,375 INFO L280 TraceCheckUtils]: 46: Hoare triple {1727#false} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43-2 {1727#false} is VALID [2020-07-18 06:32:24,375 INFO L280 TraceCheckUtils]: 47: Hoare triple {1727#false} havoc #t~mem5; {1727#false} is VALID [2020-07-18 06:32:24,375 INFO L280 TraceCheckUtils]: 48: Hoare triple {1727#false} havoc #t~mem4; {1727#false} is VALID [2020-07-18 06:32:24,375 INFO L280 TraceCheckUtils]: 49: Hoare triple {1727#false} #t~post3 := ~i~0; {1727#false} is VALID [2020-07-18 06:32:24,375 INFO L280 TraceCheckUtils]: 50: Hoare triple {1727#false} ~i~0 := 1 + #t~post3; {1727#false} is VALID [2020-07-18 06:32:24,376 INFO L280 TraceCheckUtils]: 51: Hoare triple {1727#false} havoc #t~post3; {1727#false} is VALID [2020-07-18 06:32:24,376 INFO L280 TraceCheckUtils]: 52: Hoare triple {1727#false} assume !(~i~0 < ~N~0); {1727#false} is VALID [2020-07-18 06:32:24,376 INFO L280 TraceCheckUtils]: 53: Hoare triple {1727#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {1727#false} is VALID [2020-07-18 06:32:24,376 INFO L263 TraceCheckUtils]: 54: Hoare triple {1727#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {1727#false} is VALID [2020-07-18 06:32:24,377 INFO L280 TraceCheckUtils]: 55: Hoare triple {1727#false} ~cond := #in~cond; {1727#false} is VALID [2020-07-18 06:32:24,377 INFO L280 TraceCheckUtils]: 56: Hoare triple {1727#false} assume 0 == ~cond; {1727#false} is VALID [2020-07-18 06:32:24,377 INFO L280 TraceCheckUtils]: 57: Hoare triple {1727#false} assume !false; {1727#false} is VALID [2020-07-18 06:32:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-18 06:32:24,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1938968654] [2020-07-18 06:32:24,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:32:24,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-18 06:32:24,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688792035] [2020-07-18 06:32:24,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2020-07-18 06:32:24,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:24,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 06:32:24,450 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-18 06:32:24,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 06:32:24,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:24,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 06:32:24,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:32:24,452 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 6 states. [2020-07-18 06:32:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:24,971 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2020-07-18 06:32:24,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 06:32:24,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2020-07-18 06:32:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:32:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2020-07-18 06:32:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:32:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2020-07-18 06:32:24,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 93 transitions. [2020-07-18 06:32:25,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:25,079 INFO L225 Difference]: With dead ends: 94 [2020-07-18 06:32:25,079 INFO L226 Difference]: Without dead ends: 63 [2020-07-18 06:32:25,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-18 06:32:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-18 06:32:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-18 06:32:25,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:25,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-18 06:32:25,184 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-18 06:32:25,184 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-18 06:32:25,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:25,188 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2020-07-18 06:32:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2020-07-18 06:32:25,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:25,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:25,189 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-18 06:32:25,189 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-18 06:32:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:25,193 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2020-07-18 06:32:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2020-07-18 06:32:25,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:25,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:25,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:25,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-18 06:32:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2020-07-18 06:32:25,198 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 58 [2020-07-18 06:32:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:25,198 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2020-07-18 06:32:25,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 06:32:25,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 64 transitions. [2020-07-18 06:32:25,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2020-07-18 06:32:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 06:32:25,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:25,278 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:25,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 06:32:25,279 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:25,279 INFO L82 PathProgramCache]: Analyzing trace with hash -557611095, now seen corresponding path program 1 times [2020-07-18 06:32:25,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:25,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1943572194] [2020-07-18 06:32:25,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:32:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:32:25,401 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 06:32:25,402 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 06:32:25,402 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 06:32:25,522 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 06:32:25,523 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:32:25,523 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:32:25,523 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 06:32:25,523 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 06:32:25,523 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-18 06:32:25,523 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:32:25,524 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:32:25,524 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:32:25,524 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 06:32:25,524 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 06:32:25,524 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-18 06:32:25,524 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:32:25,525 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:32:25,525 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 06:32:25,525 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 06:32:25,525 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-18 06:32:25,525 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-18 06:32:25,525 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-18 06:32:25,525 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-18 06:32:25,526 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-18 06:32:25,526 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-18 06:32:25,526 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-18 06:32:25,526 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-18 06:32:25,526 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-18 06:32:25,526 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-18 06:32:25,526 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-18 06:32:25,526 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 06:32:25,526 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-18 06:32:25,527 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-18 06:32:25,527 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 06:32:25,527 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 06:32:25,527 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-18 06:32:25,527 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 06:32:25,527 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-18 06:32:25,527 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 06:32:25,527 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-18 06:32:25,527 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-18 06:32:25,527 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 06:32:25,528 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-18 06:32:25,528 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-18 06:32:25,528 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-18 06:32:25,528 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-18 06:32:25,528 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-18 06:32:25,528 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-18 06:32:25,528 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-18 06:32:25,528 WARN L170 areAnnotationChecker]: L29-6 has no Hoare annotation [2020-07-18 06:32:25,529 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-18 06:32:25,529 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-18 06:32:25,529 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-18 06:32:25,529 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-18 06:32:25,529 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-18 06:32:25,529 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-18 06:32:25,529 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-18 06:32:25,529 WARN L170 areAnnotationChecker]: L38-6 has no Hoare annotation [2020-07-18 06:32:25,530 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-18 06:32:25,530 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-18 06:32:25,530 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-18 06:32:25,530 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-18 06:32:25,530 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-18 06:32:25,530 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-18 06:32:25,531 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-18 06:32:25,531 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-18 06:32:25,531 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-18 06:32:25,531 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-18 06:32:25,531 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-18 06:32:25,531 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-18 06:32:25,532 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-18 06:32:25,532 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-18 06:32:25,532 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-18 06:32:25,532 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-18 06:32:25,532 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-18 06:32:25,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:32:25 BoogieIcfgContainer [2020-07-18 06:32:25,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:32:25,540 INFO L168 Benchmark]: Toolchain (without parser) took 8235.35 ms. Allocated memory was 147.3 MB in the beginning and 281.5 MB in the end (delta: 134.2 MB). Free memory was 105.4 MB in the beginning and 112.2 MB in the end (delta: -6.8 MB). Peak memory consumption was 127.4 MB. Max. memory is 7.1 GB. [2020-07-18 06:32:25,541 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 147.3 MB. Free memory was 123.8 MB in the beginning and 123.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 06:32:25,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.49 ms. Allocated memory is still 147.3 MB. Free memory was 105.0 MB in the beginning and 93.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:32:25,543 INFO L168 Benchmark]: Boogie Preprocessor took 195.14 ms. Allocated memory was 147.3 MB in the beginning and 202.4 MB in the end (delta: 55.1 MB). Free memory was 93.7 MB in the beginning and 179.6 MB in the end (delta: -85.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:32:25,544 INFO L168 Benchmark]: RCFGBuilder took 628.76 ms. Allocated memory is still 202.4 MB. Free memory was 179.6 MB in the beginning and 151.7 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:32:25,545 INFO L168 Benchmark]: TraceAbstraction took 7023.78 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 151.7 MB in the beginning and 112.2 MB in the end (delta: 39.4 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. [2020-07-18 06:32:25,548 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.20 ms. Allocated memory is still 147.3 MB. Free memory was 123.8 MB in the beginning and 123.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 379.49 ms. Allocated memory is still 147.3 MB. Free memory was 105.0 MB in the beginning and 93.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 195.14 ms. Allocated memory was 147.3 MB in the beginning and 202.4 MB in the end (delta: 55.1 MB). Free memory was 93.7 MB in the beginning and 179.6 MB in the end (delta: -85.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 628.76 ms. Allocated memory is still 202.4 MB. Free memory was 179.6 MB in the beginning and 151.7 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7023.78 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 151.7 MB in the beginning and 112.2 MB in the end (delta: 39.4 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=32, N=0] [L21] N = __VERIFIER_nondet_int() VAL [\old(N)=0, __VERIFIER_nondet_int()=2, N=2] [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; VAL [\old(N)=0, N=2] [L26] long long sum[1]; VAL [\old(N)=0, N=2, sum={2:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=2, sum={2:0}] [L29] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=2, sum={2:0}] [L29] COND TRUE i