/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/sina2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:39,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:39,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:39,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:39,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:39,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:39,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:39,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:39,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:39,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:39,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:39,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:39,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:39,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:39,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:39,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:39,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:39,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:39,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:39,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:39,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:39,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:39,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:39,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:39,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:39,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:39,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:39,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:39,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:39,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:39,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:39,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:39,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:39,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:39,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:39,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:39,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:39,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:39,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:39,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:39,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:39,921 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 00:47:39,936 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:39,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:39,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:39,938 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:39,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:39,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:39,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:39,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:39,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:39,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:39,940 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:39,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:39,941 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:39,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:39,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:39,942 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:39,942 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:39,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:39,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:39,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:39,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:39,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:39,943 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:40,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:40,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:40,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:40,316 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:40,317 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:40,317 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina2f.c [2020-07-18 00:47:40,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ab89a55/d3c345f15e674b16938dfc67028f28ea/FLAGb627d5e1e [2020-07-18 00:47:40,901 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:40,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina2f.c [2020-07-18 00:47:40,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ab89a55/d3c345f15e674b16938dfc67028f28ea/FLAGb627d5e1e [2020-07-18 00:47:41,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ab89a55/d3c345f15e674b16938dfc67028f28ea [2020-07-18 00:47:41,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:41,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:41,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:41,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:41,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:41,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2452879e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41, skipping insertion in model container [2020-07-18 00:47:41,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:41,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:41,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:41,506 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:41,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:41,548 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:41,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41 WrapperNode [2020-07-18 00:47:41,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:41,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:41,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:41,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:41,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (1/1) ... [2020-07-18 00:47:41,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:41,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:41,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:41,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:41,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (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 00:47:41,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:41,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:41,774 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:47:41,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:41,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:47:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:47:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:42,340 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:42,340 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-18 00:47:42,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:42 BoogieIcfgContainer [2020-07-18 00:47:42,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:42,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:42,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:42,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:42,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:41" (1/3) ... [2020-07-18 00:47:42,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba07f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:42, skipping insertion in model container [2020-07-18 00:47:42,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:41" (2/3) ... [2020-07-18 00:47:42,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba07f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:42, skipping insertion in model container [2020-07-18 00:47:42,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:42" (3/3) ... [2020-07-18 00:47:42,357 INFO L109 eAbstractionObserver]: Analyzing ICFG sina2f.c [2020-07-18 00:47:42,366 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:42,374 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:42,389 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:42,413 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:42,413 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:42,414 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:42,414 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:42,414 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:42,415 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:42,415 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:42,415 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2020-07-18 00:47:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:47:42,444 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:42,445 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] [2020-07-18 00:47:42,445 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:42,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1325521379, now seen corresponding path program 1 times [2020-07-18 00:47:42,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:42,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1235014022] [2020-07-18 00:47:42,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:42,717 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#(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; {74#true} is VALID [2020-07-18 00:47:42,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-18 00:47:42,718 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-18 00:47:42,719 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-18 00:47:42,719 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:42,720 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {74#true} {74#true} #129#return; {74#true} is VALID [2020-07-18 00:47:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:42,731 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-18 00:47:42,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-18 00:47:42,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:42,732 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {74#true} {74#true} #125#return; {74#true} is VALID [2020-07-18 00:47:42,735 INFO L263 TraceCheckUtils]: 0: Hoare triple {74#true} call ULTIMATE.init(); {86#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:42,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#(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; {74#true} is VALID [2020-07-18 00:47:42,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-18 00:47:42,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-18 00:47:42,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-18 00:47:42,737 INFO L280 TraceCheckUtils]: 5: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:42,738 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {74#true} {74#true} #129#return; {74#true} is VALID [2020-07-18 00:47:42,738 INFO L263 TraceCheckUtils]: 7: Hoare triple {74#true} call #t~ret11 := main(); {74#true} is VALID [2020-07-18 00:47:42,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {74#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {74#true} is VALID [2020-07-18 00:47:42,739 INFO L280 TraceCheckUtils]: 9: Hoare triple {74#true} ~N~0 := #t~nondet0; {74#true} is VALID [2020-07-18 00:47:42,740 INFO L280 TraceCheckUtils]: 10: Hoare triple {74#true} havoc #t~nondet0; {74#true} is VALID [2020-07-18 00:47:42,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {74#true} assume !(~N~0 <= 0); {74#true} is VALID [2020-07-18 00:47:42,741 INFO L263 TraceCheckUtils]: 12: Hoare triple {74#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {74#true} is VALID [2020-07-18 00:47:42,741 INFO L280 TraceCheckUtils]: 13: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-18 00:47:42,741 INFO L280 TraceCheckUtils]: 14: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-18 00:47:42,742 INFO L280 TraceCheckUtils]: 15: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:42,742 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {74#true} {74#true} #125#return; {74#true} is VALID [2020-07-18 00:47:42,743 INFO L280 TraceCheckUtils]: 17: Hoare triple {74#true} havoc ~i~0; {74#true} is VALID [2020-07-18 00:47:42,743 INFO L280 TraceCheckUtils]: 18: Hoare triple {74#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {74#true} is VALID [2020-07-18 00:47:42,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {74#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {74#true} is VALID [2020-07-18 00:47:42,744 INFO L280 TraceCheckUtils]: 20: Hoare triple {74#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {74#true} is VALID [2020-07-18 00:47:42,744 INFO L280 TraceCheckUtils]: 21: Hoare triple {74#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {74#true} is VALID [2020-07-18 00:47:42,745 INFO L280 TraceCheckUtils]: 22: Hoare triple {74#true} ~i~0 := 0; {74#true} is VALID [2020-07-18 00:47:42,749 INFO L280 TraceCheckUtils]: 23: Hoare triple {74#true} assume !true; {75#false} is VALID [2020-07-18 00:47:42,750 INFO L280 TraceCheckUtils]: 24: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-18 00:47:42,750 INFO L280 TraceCheckUtils]: 25: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-18 00:47:42,751 INFO L280 TraceCheckUtils]: 26: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-18 00:47:42,751 INFO L280 TraceCheckUtils]: 27: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-18 00:47:42,752 INFO L280 TraceCheckUtils]: 28: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-18 00:47:42,752 INFO L280 TraceCheckUtils]: 29: Hoare triple {75#false} assume !!(~i~0 < ~N~0); {75#false} is VALID [2020-07-18 00:47:42,753 INFO L280 TraceCheckUtils]: 30: Hoare triple {75#false} SUMMARY for call #t~mem10 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L47 {75#false} is VALID [2020-07-18 00:47:42,754 INFO L263 TraceCheckUtils]: 31: Hoare triple {75#false} call __VERIFIER_assert((if #t~mem10 == ~N~0 then 1 else 0)); {75#false} is VALID [2020-07-18 00:47:42,755 INFO L280 TraceCheckUtils]: 32: Hoare triple {75#false} ~cond := #in~cond; {75#false} is VALID [2020-07-18 00:47:42,755 INFO L280 TraceCheckUtils]: 33: Hoare triple {75#false} assume 0 == ~cond; {75#false} is VALID [2020-07-18 00:47:42,755 INFO L280 TraceCheckUtils]: 34: Hoare triple {75#false} assume !false; {75#false} is VALID [2020-07-18 00:47:42,765 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 00:47:42,768 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:42,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1235014022] [2020-07-18 00:47:42,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:42,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:42,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912569171] [2020-07-18 00:47:42,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-18 00:47:42,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:42,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:42,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:42,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:42,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:42,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:42,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:42,866 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2020-07-18 00:47:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:43,450 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2020-07-18 00:47:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:43,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-18 00:47:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2020-07-18 00:47:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2020-07-18 00:47:43,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2020-07-18 00:47:43,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:43,707 INFO L225 Difference]: With dead ends: 125 [2020-07-18 00:47:43,707 INFO L226 Difference]: Without dead ends: 62 [2020-07-18 00:47:43,718 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-18 00:47:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-18 00:47:43,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:43,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2020-07-18 00:47:43,846 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-18 00:47:43,846 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-18 00:47:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:43,853 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-18 00:47:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-18 00:47:43,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:43,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:43,855 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-18 00:47:43,855 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-18 00:47:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:43,868 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-18 00:47:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-18 00:47:43,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:43,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:43,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:43,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-18 00:47:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2020-07-18 00:47:43,888 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 35 [2020-07-18 00:47:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:43,889 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2020-07-18 00:47:43,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:43,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2020-07-18 00:47:43,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-18 00:47:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:47:43,982 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:43,982 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] [2020-07-18 00:47:43,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:43,983 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:43,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1536754598, now seen corresponding path program 1 times [2020-07-18 00:47:43,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:43,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [26942938] [2020-07-18 00:47:43,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:44,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {601#(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; {587#true} is VALID [2020-07-18 00:47:44,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#true} #valid := #valid[0 := 0]; {587#true} is VALID [2020-07-18 00:47:44,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {587#true} assume 0 < #StackHeapBarrier; {587#true} is VALID [2020-07-18 00:47:44,134 INFO L280 TraceCheckUtils]: 3: Hoare triple {587#true} ~N~0 := 0; {587#true} is VALID [2020-07-18 00:47:44,135 INFO L280 TraceCheckUtils]: 4: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-18 00:47:44,135 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {587#true} {587#true} #129#return; {587#true} is VALID [2020-07-18 00:47:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:44,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2020-07-18 00:47:44,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2020-07-18 00:47:44,151 INFO L280 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-18 00:47:44,152 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {587#true} {595#(<= 1 ~N~0)} #125#return; {595#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:44,153 INFO L263 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {601#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:44,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {601#(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; {587#true} is VALID [2020-07-18 00:47:44,153 INFO L280 TraceCheckUtils]: 2: Hoare triple {587#true} #valid := #valid[0 := 0]; {587#true} is VALID [2020-07-18 00:47:44,154 INFO L280 TraceCheckUtils]: 3: Hoare triple {587#true} assume 0 < #StackHeapBarrier; {587#true} is VALID [2020-07-18 00:47:44,154 INFO L280 TraceCheckUtils]: 4: Hoare triple {587#true} ~N~0 := 0; {587#true} is VALID [2020-07-18 00:47:44,154 INFO L280 TraceCheckUtils]: 5: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-18 00:47:44,154 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {587#true} {587#true} #129#return; {587#true} is VALID [2020-07-18 00:47:44,155 INFO L263 TraceCheckUtils]: 7: Hoare triple {587#true} call #t~ret11 := main(); {587#true} is VALID [2020-07-18 00:47:44,155 INFO L280 TraceCheckUtils]: 8: Hoare triple {587#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {587#true} is VALID [2020-07-18 00:47:44,156 INFO L280 TraceCheckUtils]: 9: Hoare triple {587#true} ~N~0 := #t~nondet0; {587#true} is VALID [2020-07-18 00:47:44,156 INFO L280 TraceCheckUtils]: 10: Hoare triple {587#true} havoc #t~nondet0; {587#true} is VALID [2020-07-18 00:47:44,157 INFO L280 TraceCheckUtils]: 11: Hoare triple {587#true} assume !(~N~0 <= 0); {595#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:44,158 INFO L263 TraceCheckUtils]: 12: Hoare triple {595#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {587#true} is VALID [2020-07-18 00:47:44,158 INFO L280 TraceCheckUtils]: 13: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2020-07-18 00:47:44,158 INFO L280 TraceCheckUtils]: 14: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2020-07-18 00:47:44,159 INFO L280 TraceCheckUtils]: 15: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-18 00:47:44,160 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {587#true} {595#(<= 1 ~N~0)} #125#return; {595#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:44,161 INFO L280 TraceCheckUtils]: 17: Hoare triple {595#(<= 1 ~N~0)} havoc ~i~0; {595#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:44,163 INFO L280 TraceCheckUtils]: 18: Hoare triple {595#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {595#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:44,165 INFO L280 TraceCheckUtils]: 19: Hoare triple {595#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {595#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:44,167 INFO L280 TraceCheckUtils]: 20: Hoare triple {595#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {595#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:44,169 INFO L280 TraceCheckUtils]: 21: Hoare triple {595#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {595#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:44,170 INFO L280 TraceCheckUtils]: 22: Hoare triple {595#(<= 1 ~N~0)} ~i~0 := 0; {600#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 00:47:44,171 INFO L280 TraceCheckUtils]: 23: Hoare triple {600#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {588#false} is VALID [2020-07-18 00:47:44,172 INFO L280 TraceCheckUtils]: 24: Hoare triple {588#false} ~i~0 := 0; {588#false} is VALID [2020-07-18 00:47:44,172 INFO L280 TraceCheckUtils]: 25: Hoare triple {588#false} assume !(~i~0 < ~N~0); {588#false} is VALID [2020-07-18 00:47:44,172 INFO L280 TraceCheckUtils]: 26: Hoare triple {588#false} ~i~0 := 0; {588#false} is VALID [2020-07-18 00:47:44,173 INFO L280 TraceCheckUtils]: 27: Hoare triple {588#false} assume !(~i~0 < ~N~0); {588#false} is VALID [2020-07-18 00:47:44,173 INFO L280 TraceCheckUtils]: 28: Hoare triple {588#false} ~i~0 := 0; {588#false} is VALID [2020-07-18 00:47:44,173 INFO L280 TraceCheckUtils]: 29: Hoare triple {588#false} assume !!(~i~0 < ~N~0); {588#false} is VALID [2020-07-18 00:47:44,174 INFO L280 TraceCheckUtils]: 30: Hoare triple {588#false} SUMMARY for call #t~mem10 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L47 {588#false} is VALID [2020-07-18 00:47:44,174 INFO L263 TraceCheckUtils]: 31: Hoare triple {588#false} call __VERIFIER_assert((if #t~mem10 == ~N~0 then 1 else 0)); {588#false} is VALID [2020-07-18 00:47:44,175 INFO L280 TraceCheckUtils]: 32: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2020-07-18 00:47:44,175 INFO L280 TraceCheckUtils]: 33: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2020-07-18 00:47:44,175 INFO L280 TraceCheckUtils]: 34: Hoare triple {588#false} assume !false; {588#false} is VALID [2020-07-18 00:47:44,179 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 00:47:44,184 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:44,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [26942938] [2020-07-18 00:47:44,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:44,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:44,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293976861] [2020-07-18 00:47:44,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-18 00:47:44,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:44,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:44,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:44,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:44,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:44,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:44,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:44,233 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 5 states. [2020-07-18 00:47:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:44,815 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2020-07-18 00:47:44,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:44,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-18 00:47:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2020-07-18 00:47:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2020-07-18 00:47:44,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 131 transitions. [2020-07-18 00:47:44,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:44,972 INFO L225 Difference]: With dead ends: 122 [2020-07-18 00:47:44,972 INFO L226 Difference]: Without dead ends: 88 [2020-07-18 00:47:44,974 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 1 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 00:47:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-18 00:47:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2020-07-18 00:47:45,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:45,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 65 states. [2020-07-18 00:47:45,101 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 65 states. [2020-07-18 00:47:45,101 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 65 states. [2020-07-18 00:47:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:45,107 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2020-07-18 00:47:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2020-07-18 00:47:45,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:45,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:45,109 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 88 states. [2020-07-18 00:47:45,109 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 88 states. [2020-07-18 00:47:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:45,114 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2020-07-18 00:47:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2020-07-18 00:47:45,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:45,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:45,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:45,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-18 00:47:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2020-07-18 00:47:45,119 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 35 [2020-07-18 00:47:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:45,119 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2020-07-18 00:47:45,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:45,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2020-07-18 00:47:45,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-18 00:47:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 00:47:45,211 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:45,211 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] [2020-07-18 00:47:45,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:45,211 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:45,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:45,212 INFO L82 PathProgramCache]: Analyzing trace with hash -313984591, now seen corresponding path program 1 times [2020-07-18 00:47:45,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:45,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [795990991] [2020-07-18 00:47:45,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:45,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:45,258 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:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) 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-18 00:47:45,266 INFO L168 Benchmark]: Toolchain (without parser) took 4001.71 ms. Allocated memory was 145.2 MB in the beginning and 244.3 MB in the end (delta: 99.1 MB). Free memory was 103.9 MB in the beginning and 194.9 MB in the end (delta: -91.0 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:45,268 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:45,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.84 ms. Allocated memory is still 145.2 MB. Free memory was 103.5 MB in the beginning and 92.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:45,271 INFO L168 Benchmark]: Boogie Preprocessor took 154.04 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.6 MB in the beginning and 179.1 MB in the end (delta: -86.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:45,272 INFO L168 Benchmark]: RCFGBuilder took 642.09 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 148.8 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:45,273 INFO L168 Benchmark]: TraceAbstraction took 2914.94 ms. Allocated memory was 202.4 MB in the beginning and 244.3 MB in the end (delta: 41.9 MB). Free memory was 147.9 MB in the beginning and 197.0 MB in the end (delta: -49.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:45,283 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.21 ms. Allocated memory is still 145.2 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 283.84 ms. Allocated memory is still 145.2 MB. Free memory was 103.5 MB in the beginning and 92.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.04 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.6 MB in the beginning and 179.1 MB in the end (delta: -86.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 642.09 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 148.8 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2914.94 ms. Allocated memory was 202.4 MB in the beginning and 244.3 MB in the end (delta: 41.9 MB). Free memory was 147.9 MB in the beginning and 197.0 MB in the end (delta: -49.1 MB). There was no memory consumed. 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:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...