/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/modsf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:13,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:13,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:13,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:13,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:13,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:13,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:13,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:13,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:13,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:13,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:13,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:13,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:13,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:13,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:13,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:13,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:13,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:13,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:13,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:13,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:13,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:13,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:13,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:13,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:13,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:13,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:13,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:13,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:13,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:13,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:13,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:13,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:13,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:13,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:13,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:13,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:13,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:13,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:13,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:13,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:13,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:13,950 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:13,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:13,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:13,954 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:13,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:13,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:13,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:13,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:13,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:13,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:13,957 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:13,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:13,957 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:13,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:13,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:13,958 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:13,958 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:13,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:13,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:13,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:13,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:13,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:13,960 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:14,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:14,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:14,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:14,339 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:14,339 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:14,340 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/modsf.c [2020-07-10 20:21:14,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9265ce4/fb3f116457fc4ec3b2aeb7e19c276f45/FLAG8d6f06c60 [2020-07-10 20:21:14,975 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:14,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/modsf.c [2020-07-10 20:21:14,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9265ce4/fb3f116457fc4ec3b2aeb7e19c276f45/FLAG8d6f06c60 [2020-07-10 20:21:15,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9265ce4/fb3f116457fc4ec3b2aeb7e19c276f45 [2020-07-10 20:21:15,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:15,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:15,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:15,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:15,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:15,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:15" (1/1) ... [2020-07-10 20:21:15,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab124d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15, skipping insertion in model container [2020-07-10 20:21:15,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:15" (1/1) ... [2020-07-10 20:21:15,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:15,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:15,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:15,644 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:15,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:15,697 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:15,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15 WrapperNode [2020-07-10 20:21:15,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:15,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:15,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:15,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:15,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (1/1) ... [2020-07-10 20:21:15,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (1/1) ... [2020-07-10 20:21:15,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (1/1) ... [2020-07-10 20:21:15,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (1/1) ... [2020-07-10 20:21:15,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (1/1) ... [2020-07-10 20:21:15,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (1/1) ... [2020-07-10 20:21:15,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (1/1) ... [2020-07-10 20:21:15,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:15,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:15,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:15,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:15,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:15,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:15,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:15,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:15,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:16,486 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:16,487 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-10 20:21:16,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:16 BoogieIcfgContainer [2020-07-10 20:21:16,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:16,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:16,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:16,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:16,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:15" (1/3) ... [2020-07-10 20:21:16,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8f9ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:16, skipping insertion in model container [2020-07-10 20:21:16,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (2/3) ... [2020-07-10 20:21:16,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8f9ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:16, skipping insertion in model container [2020-07-10 20:21:16,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:16" (3/3) ... [2020-07-10 20:21:16,516 INFO L109 eAbstractionObserver]: Analyzing ICFG modsf.c [2020-07-10 20:21:16,533 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:16,543 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:16,562 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:16,592 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:16,592 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:16,592 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:16,593 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:16,593 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:16,593 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:16,594 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:16,594 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-10 20:21:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:21:16,641 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:16,643 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] [2020-07-10 20:21:16,644 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:16,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:16,653 INFO L82 PathProgramCache]: Analyzing trace with hash 731228111, now seen corresponding path program 1 times [2020-07-10 20:21:16,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:16,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [747821407] [2020-07-10 20:21:16,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:16,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {96#(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; {84#true} is VALID [2020-07-10 20:21:16,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-10 20:21:16,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-10 20:21:16,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} ~N~0 := 0; {84#true} is VALID [2020-07-10 20:21:16,954 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-10 20:21:16,955 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #150#return; {84#true} is VALID [2020-07-10 20:21:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:16,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} ~cond := #in~cond; {84#true} is VALID [2020-07-10 20:21:16,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} assume !(0 == ~cond); {84#true} is VALID [2020-07-10 20:21:16,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-10 20:21:16,987 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #146#return; {84#true} is VALID [2020-07-10 20:21:16,991 INFO L263 TraceCheckUtils]: 0: Hoare triple {84#true} call ULTIMATE.init(); {96#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:16,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {96#(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; {84#true} is VALID [2020-07-10 20:21:16,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-10 20:21:16,993 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-10 20:21:16,993 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} ~N~0 := 0; {84#true} is VALID [2020-07-10 20:21:16,994 INFO L280 TraceCheckUtils]: 5: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-10 20:21:16,994 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {84#true} {84#true} #150#return; {84#true} is VALID [2020-07-10 20:21:16,995 INFO L263 TraceCheckUtils]: 7: Hoare triple {84#true} call #t~ret14 := main(); {84#true} is VALID [2020-07-10 20:21:16,995 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {84#true} is VALID [2020-07-10 20:21:16,995 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} ~N~0 := #t~nondet0; {84#true} is VALID [2020-07-10 20:21:16,996 INFO L280 TraceCheckUtils]: 10: Hoare triple {84#true} havoc #t~nondet0; {84#true} is VALID [2020-07-10 20:21:16,997 INFO L280 TraceCheckUtils]: 11: Hoare triple {84#true} assume !(~N~0 <= 0); {84#true} is VALID [2020-07-10 20:21:16,998 INFO L263 TraceCheckUtils]: 12: Hoare triple {84#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {84#true} is VALID [2020-07-10 20:21:16,999 INFO L280 TraceCheckUtils]: 13: Hoare triple {84#true} ~cond := #in~cond; {84#true} is VALID [2020-07-10 20:21:17,000 INFO L280 TraceCheckUtils]: 14: Hoare triple {84#true} assume !(0 == ~cond); {84#true} is VALID [2020-07-10 20:21:17,001 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-10 20:21:17,002 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {84#true} {84#true} #146#return; {84#true} is VALID [2020-07-10 20:21:17,003 INFO L280 TraceCheckUtils]: 17: Hoare triple {84#true} havoc ~i~0; {84#true} is VALID [2020-07-10 20:21:17,005 INFO L280 TraceCheckUtils]: 18: Hoare triple {84#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {84#true} is VALID [2020-07-10 20:21:17,005 INFO L280 TraceCheckUtils]: 19: Hoare triple {84#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {84#true} is VALID [2020-07-10 20:21:17,006 INFO L280 TraceCheckUtils]: 20: Hoare triple {84#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {84#true} is VALID [2020-07-10 20:21:17,007 INFO L280 TraceCheckUtils]: 21: Hoare triple {84#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {84#true} is VALID [2020-07-10 20:21:17,007 INFO L280 TraceCheckUtils]: 22: Hoare triple {84#true} ~i~0 := 0; {84#true} is VALID [2020-07-10 20:21:17,008 INFO L280 TraceCheckUtils]: 23: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-10 20:21:17,009 INFO L280 TraceCheckUtils]: 24: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-10 20:21:17,009 INFO L280 TraceCheckUtils]: 25: Hoare triple {85#false} assume !true; {85#false} is VALID [2020-07-10 20:21:17,010 INFO L280 TraceCheckUtils]: 26: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-10 20:21:17,011 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} assume !true; {85#false} is VALID [2020-07-10 20:21:17,012 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-10 20:21:17,012 INFO L280 TraceCheckUtils]: 29: Hoare triple {85#false} assume !true; {85#false} is VALID [2020-07-10 20:21:17,016 INFO L280 TraceCheckUtils]: 30: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-10 20:21:17,016 INFO L280 TraceCheckUtils]: 31: Hoare triple {85#false} assume !!(~i~0 < ~N~0); {85#false} is VALID [2020-07-10 20:21:17,017 INFO L280 TraceCheckUtils]: 32: Hoare triple {85#false} SUMMARY for call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L52 {85#false} is VALID [2020-07-10 20:21:17,017 INFO L263 TraceCheckUtils]: 33: Hoare triple {85#false} call __VERIFIER_assert((if 1 == #t~mem13 then 1 else 0)); {85#false} is VALID [2020-07-10 20:21:17,018 INFO L280 TraceCheckUtils]: 34: Hoare triple {85#false} ~cond := #in~cond; {85#false} is VALID [2020-07-10 20:21:17,018 INFO L280 TraceCheckUtils]: 35: Hoare triple {85#false} assume 0 == ~cond; {85#false} is VALID [2020-07-10 20:21:17,019 INFO L280 TraceCheckUtils]: 36: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-10 20:21:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:17,032 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:17,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [747821407] [2020-07-10 20:21:17,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:17,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:17,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738437432] [2020-07-10 20:21:17,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 20:21:17,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:17,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:17,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:17,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:17,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:17,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:17,138 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2020-07-10 20:21:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:17,711 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2020-07-10 20:21:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:17,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 20:21:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-10 20:21:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-10 20:21:17,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-10 20:21:17,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:18,005 INFO L225 Difference]: With dead ends: 145 [2020-07-10 20:21:18,005 INFO L226 Difference]: Without dead ends: 72 [2020-07-10 20:21:18,011 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-10 20:21:18,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-10 20:21:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-10 20:21:18,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:18,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-10 20:21:18,126 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-10 20:21:18,126 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-10 20:21:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:18,135 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-10 20:21:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-10 20:21:18,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:18,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:18,137 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-10 20:21:18,138 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-10 20:21:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:18,146 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-10 20:21:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-10 20:21:18,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:18,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:18,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:18,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-10 20:21:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2020-07-10 20:21:18,156 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 37 [2020-07-10 20:21:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:18,157 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2020-07-10 20:21:18,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:18,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2020-07-10 20:21:18,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-10 20:21:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:21:18,268 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:18,268 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] [2020-07-10 20:21:18,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:18,269 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:18,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash 681190783, now seen corresponding path program 1 times [2020-07-10 20:21:18,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:18,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [395580822] [2020-07-10 20:21:18,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:18,419 INFO L280 TraceCheckUtils]: 0: Hoare triple {691#(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; {677#true} is VALID [2020-07-10 20:21:18,420 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} #valid := #valid[0 := 0]; {677#true} is VALID [2020-07-10 20:21:18,420 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume 0 < #StackHeapBarrier; {677#true} is VALID [2020-07-10 20:21:18,421 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#true} ~N~0 := 0; {677#true} is VALID [2020-07-10 20:21:18,421 INFO L280 TraceCheckUtils]: 4: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-10 20:21:18,421 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {677#true} {677#true} #150#return; {677#true} is VALID [2020-07-10 20:21:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:18,439 INFO L280 TraceCheckUtils]: 0: Hoare triple {677#true} ~cond := #in~cond; {677#true} is VALID [2020-07-10 20:21:18,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} assume !(0 == ~cond); {677#true} is VALID [2020-07-10 20:21:18,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-10 20:21:18,441 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {677#true} {685#(<= 1 ~N~0)} #146#return; {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:18,442 INFO L263 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:18,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {691#(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; {677#true} is VALID [2020-07-10 20:21:18,443 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} #valid := #valid[0 := 0]; {677#true} is VALID [2020-07-10 20:21:18,443 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#true} assume 0 < #StackHeapBarrier; {677#true} is VALID [2020-07-10 20:21:18,444 INFO L280 TraceCheckUtils]: 4: Hoare triple {677#true} ~N~0 := 0; {677#true} is VALID [2020-07-10 20:21:18,444 INFO L280 TraceCheckUtils]: 5: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-10 20:21:18,444 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {677#true} {677#true} #150#return; {677#true} is VALID [2020-07-10 20:21:18,445 INFO L263 TraceCheckUtils]: 7: Hoare triple {677#true} call #t~ret14 := main(); {677#true} is VALID [2020-07-10 20:21:18,445 INFO L280 TraceCheckUtils]: 8: Hoare triple {677#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {677#true} is VALID [2020-07-10 20:21:18,446 INFO L280 TraceCheckUtils]: 9: Hoare triple {677#true} ~N~0 := #t~nondet0; {677#true} is VALID [2020-07-10 20:21:18,446 INFO L280 TraceCheckUtils]: 10: Hoare triple {677#true} havoc #t~nondet0; {677#true} is VALID [2020-07-10 20:21:18,447 INFO L280 TraceCheckUtils]: 11: Hoare triple {677#true} assume !(~N~0 <= 0); {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:18,448 INFO L263 TraceCheckUtils]: 12: Hoare triple {685#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {677#true} is VALID [2020-07-10 20:21:18,448 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#true} ~cond := #in~cond; {677#true} is VALID [2020-07-10 20:21:18,449 INFO L280 TraceCheckUtils]: 14: Hoare triple {677#true} assume !(0 == ~cond); {677#true} is VALID [2020-07-10 20:21:18,449 INFO L280 TraceCheckUtils]: 15: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-10 20:21:18,450 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {677#true} {685#(<= 1 ~N~0)} #146#return; {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:18,453 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#(<= 1 ~N~0)} havoc ~i~0; {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:18,456 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:18,457 INFO L280 TraceCheckUtils]: 19: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:18,458 INFO L280 TraceCheckUtils]: 20: Hoare triple {685#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:18,459 INFO L280 TraceCheckUtils]: 21: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:18,461 INFO L280 TraceCheckUtils]: 22: Hoare triple {685#(<= 1 ~N~0)} ~i~0 := 0; {690#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:18,462 INFO L280 TraceCheckUtils]: 23: Hoare triple {690#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-10 20:21:18,463 INFO L280 TraceCheckUtils]: 24: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-10 20:21:18,463 INFO L280 TraceCheckUtils]: 25: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-10 20:21:18,464 INFO L280 TraceCheckUtils]: 26: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-10 20:21:18,464 INFO L280 TraceCheckUtils]: 27: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-10 20:21:18,465 INFO L280 TraceCheckUtils]: 28: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-10 20:21:18,465 INFO L280 TraceCheckUtils]: 29: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-10 20:21:18,466 INFO L280 TraceCheckUtils]: 30: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-10 20:21:18,466 INFO L280 TraceCheckUtils]: 31: Hoare triple {678#false} assume !!(~i~0 < ~N~0); {678#false} is VALID [2020-07-10 20:21:18,466 INFO L280 TraceCheckUtils]: 32: Hoare triple {678#false} SUMMARY for call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L52 {678#false} is VALID [2020-07-10 20:21:18,467 INFO L263 TraceCheckUtils]: 33: Hoare triple {678#false} call __VERIFIER_assert((if 1 == #t~mem13 then 1 else 0)); {678#false} is VALID [2020-07-10 20:21:18,467 INFO L280 TraceCheckUtils]: 34: Hoare triple {678#false} ~cond := #in~cond; {678#false} is VALID [2020-07-10 20:21:18,468 INFO L280 TraceCheckUtils]: 35: Hoare triple {678#false} assume 0 == ~cond; {678#false} is VALID [2020-07-10 20:21:18,468 INFO L280 TraceCheckUtils]: 36: Hoare triple {678#false} assume !false; {678#false} is VALID [2020-07-10 20:21:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:18,472 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:18,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [395580822] [2020-07-10 20:21:18,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:18,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:18,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427131111] [2020-07-10 20:21:18,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-10 20:21:18,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:18,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:18,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:18,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:18,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:18,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:18,529 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2020-07-10 20:21:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:19,346 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2020-07-10 20:21:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:19,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-10 20:21:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2020-07-10 20:21:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2020-07-10 20:21:19,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 162 transitions. [2020-07-10 20:21:19,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:19,580 INFO L225 Difference]: With dead ends: 150 [2020-07-10 20:21:19,580 INFO L226 Difference]: Without dead ends: 106 [2020-07-10 20:21:19,583 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-10 20:21:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-07-10 20:21:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2020-07-10 20:21:19,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:19,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 76 states. [2020-07-10 20:21:19,754 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 76 states. [2020-07-10 20:21:19,755 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 76 states. [2020-07-10 20:21:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:19,762 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2020-07-10 20:21:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2020-07-10 20:21:19,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:19,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:19,764 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 106 states. [2020-07-10 20:21:19,764 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 106 states. [2020-07-10 20:21:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:19,770 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2020-07-10 20:21:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2020-07-10 20:21:19,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:19,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:19,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:19,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 20:21:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2020-07-10 20:21:19,777 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 37 [2020-07-10 20:21:19,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:19,777 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2020-07-10 20:21:19,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:19,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2020-07-10 20:21:19,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2020-07-10 20:21:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-10 20:21:19,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:19,894 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, 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-10 20:21:19,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:19,894 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:19,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1093467533, now seen corresponding path program 1 times [2020-07-10 20:21:19,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:19,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573101449] [2020-07-10 20:21:19,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:19,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:19,950 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:21:19,957 INFO L168 Benchmark]: Toolchain (without parser) took 4614.90 ms. Allocated memory was 135.8 MB in the beginning and 252.2 MB in the end (delta: 116.4 MB). Free memory was 99.5 MB in the beginning and 190.0 MB in the end (delta: -90.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:19,958 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 135.8 MB. Free memory was 118.0 MB in the beginning and 117.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:19,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.91 ms. Allocated memory is still 135.8 MB. Free memory was 99.3 MB in the beginning and 87.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:19,960 INFO L168 Benchmark]: Boogie Preprocessor took 152.19 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 87.4 MB in the beginning and 177.6 MB in the end (delta: -90.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:19,961 INFO L168 Benchmark]: RCFGBuilder took 642.82 ms. Allocated memory is still 200.3 MB. Free memory was 177.6 MB in the beginning and 143.1 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:19,962 INFO L168 Benchmark]: TraceAbstraction took 3458.16 ms. Allocated memory was 200.3 MB in the beginning and 252.2 MB in the end (delta: 51.9 MB). Free memory was 142.4 MB in the beginning and 190.0 MB in the end (delta: -47.5 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:19,967 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.26 ms. Allocated memory is still 135.8 MB. Free memory was 118.0 MB in the beginning and 117.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 353.91 ms. Allocated memory is still 135.8 MB. Free memory was 99.3 MB in the beginning and 87.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.19 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 87.4 MB in the beginning and 177.6 MB in the end (delta: -90.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 642.82 ms. Allocated memory is still 200.3 MB. Free memory was 177.6 MB in the beginning and 143.1 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3458.16 ms. Allocated memory was 200.3 MB in the beginning and 252.2 MB in the end (delta: 51.9 MB). Free memory was 142.4 MB in the beginning and 190.0 MB in the end (delta: -47.5 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...