/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/s2iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:32,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:32,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:32,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:32,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:32,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:32,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:32,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:32,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:32,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:32,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:32,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:32,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:32,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:32,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:32,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:32,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:32,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:32,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:32,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:32,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:32,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:32,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:32,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:32,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:32,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:32,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:32,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:32,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:32,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:32,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:32,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:32,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:32,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:32,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:32,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:32,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:32,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:32,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:32,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:32,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:32,867 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:32,897 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:32,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:32,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:32,899 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:32,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:32,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:32,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:32,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:32,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:32,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:32,902 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:32,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:32,903 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:32,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:32,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:32,907 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:32,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:32,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:32,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:32,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:32,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:32,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:32,908 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:33,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:33,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:33,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:33,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:33,184 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:33,185 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s2iff.c [2020-07-18 00:47:33,259 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b98270/fba64251233341778dbb619e587ec251/FLAG6826980bb [2020-07-18 00:47:33,737 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:33,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s2iff.c [2020-07-18 00:47:33,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b98270/fba64251233341778dbb619e587ec251/FLAG6826980bb [2020-07-18 00:47:34,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b98270/fba64251233341778dbb619e587ec251 [2020-07-18 00:47:34,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:34,112 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:34,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:34,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:34,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:34,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:34" (1/1) ... [2020-07-18 00:47:34,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a431c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:34, skipping insertion in model container [2020-07-18 00:47:34,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:34" (1/1) ... [2020-07-18 00:47:34,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:34,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:34,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:34,377 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:34,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:34,425 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:34,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:34 WrapperNode [2020-07-18 00:47:34,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:34,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:34,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:34,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:34,523 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:34" (1/1) ... [2020-07-18 00:47:34,523 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:34" (1/1) ... [2020-07-18 00:47:34,531 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:34" (1/1) ... [2020-07-18 00:47:34,531 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:34" (1/1) ... [2020-07-18 00:47:34,542 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:34" (1/1) ... [2020-07-18 00:47:34,547 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:34" (1/1) ... [2020-07-18 00:47:34,549 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:34" (1/1) ... [2020-07-18 00:47:34,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:34,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:34,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:34,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:34,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:34" (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:34,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:34,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:34,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:47:34,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:34,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:47:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:47:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:35,151 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:35,152 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 00:47:35,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:35 BoogieIcfgContainer [2020-07-18 00:47:35,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:35,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:35,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:35,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:35,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:34" (1/3) ... [2020-07-18 00:47:35,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655d6e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:35, skipping insertion in model container [2020-07-18 00:47:35,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:34" (2/3) ... [2020-07-18 00:47:35,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655d6e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:35, skipping insertion in model container [2020-07-18 00:47:35,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:35" (3/3) ... [2020-07-18 00:47:35,165 INFO L109 eAbstractionObserver]: Analyzing ICFG s2iff.c [2020-07-18 00:47:35,176 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:35,183 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:35,196 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:35,214 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:35,214 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:35,214 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:35,214 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:35,215 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:35,215 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:35,215 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:35,215 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-18 00:47:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-18 00:47:35,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:35,244 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] [2020-07-18 00:47:35,244 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:35,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:35,250 INFO L82 PathProgramCache]: Analyzing trace with hash 171473808, now seen corresponding path program 1 times [2020-07-18 00:47:35,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:35,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1686210589] [2020-07-18 00:47:35,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:35,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {80#(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; {68#true} is VALID [2020-07-18 00:47:35,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-18 00:47:35,510 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-18 00:47:35,510 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} ~N~0 := 0; {68#true} is VALID [2020-07-18 00:47:35,511 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 00:47:35,511 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {68#true} {68#true} #105#return; {68#true} is VALID [2020-07-18 00:47:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:35,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#true} ~cond := #in~cond; {68#true} is VALID [2020-07-18 00:47:35,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} assume !(0 == ~cond); {68#true} is VALID [2020-07-18 00:47:35,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 00:47:35,525 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #101#return; {68#true} is VALID [2020-07-18 00:47:35,528 INFO L263 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {80#(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:35,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#(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; {68#true} is VALID [2020-07-18 00:47:35,528 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-18 00:47:35,529 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-18 00:47:35,529 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} ~N~0 := 0; {68#true} is VALID [2020-07-18 00:47:35,529 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 00:47:35,530 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {68#true} {68#true} #105#return; {68#true} is VALID [2020-07-18 00:47:35,530 INFO L263 TraceCheckUtils]: 7: Hoare triple {68#true} call #t~ret10 := main(); {68#true} is VALID [2020-07-18 00:47:35,530 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {68#true} is VALID [2020-07-18 00:47:35,531 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} ~N~0 := #t~nondet0; {68#true} is VALID [2020-07-18 00:47:35,531 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-18 00:47:35,532 INFO L280 TraceCheckUtils]: 11: Hoare triple {68#true} assume !(~N~0 <= 0); {68#true} is VALID [2020-07-18 00:47:35,532 INFO L263 TraceCheckUtils]: 12: Hoare triple {68#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {68#true} is VALID [2020-07-18 00:47:35,532 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#true} ~cond := #in~cond; {68#true} is VALID [2020-07-18 00:47:35,533 INFO L280 TraceCheckUtils]: 14: Hoare triple {68#true} assume !(0 == ~cond); {68#true} is VALID [2020-07-18 00:47:35,533 INFO L280 TraceCheckUtils]: 15: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 00:47:35,534 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {68#true} {68#true} #101#return; {68#true} is VALID [2020-07-18 00:47:35,534 INFO L280 TraceCheckUtils]: 17: Hoare triple {68#true} havoc ~i~0; {68#true} is VALID [2020-07-18 00:47:35,534 INFO L280 TraceCheckUtils]: 18: Hoare triple {68#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {68#true} is VALID [2020-07-18 00:47:35,535 INFO L280 TraceCheckUtils]: 19: Hoare triple {68#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {68#true} is VALID [2020-07-18 00:47:35,535 INFO L280 TraceCheckUtils]: 20: Hoare triple {68#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {68#true} is VALID [2020-07-18 00:47:35,535 INFO L280 TraceCheckUtils]: 21: Hoare triple {68#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {68#true} is VALID [2020-07-18 00:47:35,536 INFO L280 TraceCheckUtils]: 22: Hoare triple {68#true} ~i~0 := 0; {68#true} is VALID [2020-07-18 00:47:35,537 INFO L280 TraceCheckUtils]: 23: Hoare triple {68#true} assume !true; {69#false} is VALID [2020-07-18 00:47:35,537 INFO L280 TraceCheckUtils]: 24: Hoare triple {69#false} ~i~0 := 0; {69#false} is VALID [2020-07-18 00:47:35,538 INFO L280 TraceCheckUtils]: 25: Hoare triple {69#false} assume !true; {69#false} is VALID [2020-07-18 00:47:35,538 INFO L280 TraceCheckUtils]: 26: Hoare triple {69#false} SUMMARY for call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L35-6 {69#false} is VALID [2020-07-18 00:47:35,539 INFO L263 TraceCheckUtils]: 27: Hoare triple {69#false} call __VERIFIER_assert((if #t~mem9 == 3 * ~N~0 then 1 else 0)); {69#false} is VALID [2020-07-18 00:47:35,539 INFO L280 TraceCheckUtils]: 28: Hoare triple {69#false} ~cond := #in~cond; {69#false} is VALID [2020-07-18 00:47:35,539 INFO L280 TraceCheckUtils]: 29: Hoare triple {69#false} assume 0 == ~cond; {69#false} is VALID [2020-07-18 00:47:35,540 INFO L280 TraceCheckUtils]: 30: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-18 00:47:35,546 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:35,550 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:35,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1686210589] [2020-07-18 00:47:35,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:35,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:35,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858652848] [2020-07-18 00:47:35,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-18 00:47:35,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:35,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:35,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:35,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:35,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:35,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:35,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:35,657 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-07-18 00:47:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:36,129 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2020-07-18 00:47:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:36,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-18 00:47:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-18 00:47:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-18 00:47:36,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-18 00:47:36,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:36,349 INFO L225 Difference]: With dead ends: 113 [2020-07-18 00:47:36,350 INFO L226 Difference]: Without dead ends: 53 [2020-07-18 00:47:36,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-18 00:47:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-18 00:47:36,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:36,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-18 00:47:36,442 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-18 00:47:36,443 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-18 00:47:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:36,449 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-18 00:47:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-18 00:47:36,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:36,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:36,451 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-18 00:47:36,451 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-18 00:47:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:36,457 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-18 00:47:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-18 00:47:36,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:36,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:36,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:36,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-18 00:47:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-18 00:47:36,465 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 31 [2020-07-18 00:47:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:36,466 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-18 00:47:36,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:36,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2020-07-18 00:47:36,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-18 00:47:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-18 00:47:36,539 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:36,539 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] [2020-07-18 00:47:36,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:36,540 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash 921692051, now seen corresponding path program 1 times [2020-07-18 00:47:36,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:36,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1942015261] [2020-07-18 00:47:36,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:36,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {535#(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; {521#true} is VALID [2020-07-18 00:47:36,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {521#true} #valid := #valid[0 := 0]; {521#true} is VALID [2020-07-18 00:47:36,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} assume 0 < #StackHeapBarrier; {521#true} is VALID [2020-07-18 00:47:36,700 INFO L280 TraceCheckUtils]: 3: Hoare triple {521#true} ~N~0 := 0; {521#true} is VALID [2020-07-18 00:47:36,700 INFO L280 TraceCheckUtils]: 4: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-18 00:47:36,701 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {521#true} {521#true} #105#return; {521#true} is VALID [2020-07-18 00:47:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:36,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {521#true} ~cond := #in~cond; {521#true} is VALID [2020-07-18 00:47:36,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {521#true} assume !(0 == ~cond); {521#true} is VALID [2020-07-18 00:47:36,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-18 00:47:36,711 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {521#true} {529#(<= 1 ~N~0)} #101#return; {529#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:36,712 INFO L263 TraceCheckUtils]: 0: Hoare triple {521#true} call ULTIMATE.init(); {535#(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:36,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {535#(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; {521#true} is VALID [2020-07-18 00:47:36,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} #valid := #valid[0 := 0]; {521#true} is VALID [2020-07-18 00:47:36,713 INFO L280 TraceCheckUtils]: 3: Hoare triple {521#true} assume 0 < #StackHeapBarrier; {521#true} is VALID [2020-07-18 00:47:36,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {521#true} ~N~0 := 0; {521#true} is VALID [2020-07-18 00:47:36,714 INFO L280 TraceCheckUtils]: 5: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-18 00:47:36,714 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {521#true} {521#true} #105#return; {521#true} is VALID [2020-07-18 00:47:36,714 INFO L263 TraceCheckUtils]: 7: Hoare triple {521#true} call #t~ret10 := main(); {521#true} is VALID [2020-07-18 00:47:36,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {521#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {521#true} is VALID [2020-07-18 00:47:36,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {521#true} ~N~0 := #t~nondet0; {521#true} is VALID [2020-07-18 00:47:36,715 INFO L280 TraceCheckUtils]: 10: Hoare triple {521#true} havoc #t~nondet0; {521#true} is VALID [2020-07-18 00:47:36,716 INFO L280 TraceCheckUtils]: 11: Hoare triple {521#true} assume !(~N~0 <= 0); {529#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:36,716 INFO L263 TraceCheckUtils]: 12: Hoare triple {529#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {521#true} is VALID [2020-07-18 00:47:36,717 INFO L280 TraceCheckUtils]: 13: Hoare triple {521#true} ~cond := #in~cond; {521#true} is VALID [2020-07-18 00:47:36,717 INFO L280 TraceCheckUtils]: 14: Hoare triple {521#true} assume !(0 == ~cond); {521#true} is VALID [2020-07-18 00:47:36,717 INFO L280 TraceCheckUtils]: 15: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-18 00:47:36,718 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {521#true} {529#(<= 1 ~N~0)} #101#return; {529#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:36,719 INFO L280 TraceCheckUtils]: 17: Hoare triple {529#(<= 1 ~N~0)} havoc ~i~0; {529#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:36,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {529#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:36,720 INFO L280 TraceCheckUtils]: 19: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {529#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:36,721 INFO L280 TraceCheckUtils]: 20: Hoare triple {529#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {529#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:36,722 INFO L280 TraceCheckUtils]: 21: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {529#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:36,723 INFO L280 TraceCheckUtils]: 22: Hoare triple {529#(<= 1 ~N~0)} ~i~0 := 0; {534#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 00:47:36,724 INFO L280 TraceCheckUtils]: 23: Hoare triple {534#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {522#false} is VALID [2020-07-18 00:47:36,724 INFO L280 TraceCheckUtils]: 24: Hoare triple {522#false} ~i~0 := 0; {522#false} is VALID [2020-07-18 00:47:36,725 INFO L280 TraceCheckUtils]: 25: Hoare triple {522#false} assume !(~i~0 < ~N~0); {522#false} is VALID [2020-07-18 00:47:36,725 INFO L280 TraceCheckUtils]: 26: Hoare triple {522#false} SUMMARY for call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L35-6 {522#false} is VALID [2020-07-18 00:47:36,725 INFO L263 TraceCheckUtils]: 27: Hoare triple {522#false} call __VERIFIER_assert((if #t~mem9 == 3 * ~N~0 then 1 else 0)); {522#false} is VALID [2020-07-18 00:47:36,726 INFO L280 TraceCheckUtils]: 28: Hoare triple {522#false} ~cond := #in~cond; {522#false} is VALID [2020-07-18 00:47:36,726 INFO L280 TraceCheckUtils]: 29: Hoare triple {522#false} assume 0 == ~cond; {522#false} is VALID [2020-07-18 00:47:36,726 INFO L280 TraceCheckUtils]: 30: Hoare triple {522#false} assume !false; {522#false} is VALID [2020-07-18 00:47:36,728 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:36,733 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:36,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1942015261] [2020-07-18 00:47:36,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:36,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:36,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170662351] [2020-07-18 00:47:36,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-18 00:47:36,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:36,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:36,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:36,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:36,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:36,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:36,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:36,780 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2020-07-18 00:47:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:37,267 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2020-07-18 00:47:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:37,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-18 00:47:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2020-07-18 00:47:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2020-07-18 00:47:37,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2020-07-18 00:47:37,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:37,461 INFO L225 Difference]: With dead ends: 99 [2020-07-18 00:47:37,461 INFO L226 Difference]: Without dead ends: 74 [2020-07-18 00:47:37,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-18 00:47:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2020-07-18 00:47:37,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:37,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 55 states. [2020-07-18 00:47:37,559 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 55 states. [2020-07-18 00:47:37,560 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 55 states. [2020-07-18 00:47:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:37,565 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-18 00:47:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-18 00:47:37,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:37,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:37,567 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 74 states. [2020-07-18 00:47:37,567 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 74 states. [2020-07-18 00:47:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:37,571 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-18 00:47:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-18 00:47:37,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:37,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:37,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:37,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-18 00:47:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-07-18 00:47:37,576 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2020-07-18 00:47:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:37,577 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-07-18 00:47:37,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:37,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2020-07-18 00:47:37,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-18 00:47:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 00:47:37,657 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:37,657 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] [2020-07-18 00:47:37,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:37,658 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash -827220298, now seen corresponding path program 1 times [2020-07-18 00:47:37,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:37,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1856747278] [2020-07-18 00:47:37,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:37,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:37,692 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:37,705 INFO L168 Benchmark]: Toolchain (without parser) took 3593.69 ms. Allocated memory was 138.9 MB in the beginning and 245.4 MB in the end (delta: 106.4 MB). Free memory was 104.0 MB in the beginning and 129.3 MB in the end (delta: -25.3 MB). Peak memory consumption was 81.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:37,706 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:37,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.61 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 92.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:37,708 INFO L168 Benchmark]: Boogie Preprocessor took 124.39 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 92.6 MB in the beginning and 181.0 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:37,709 INFO L168 Benchmark]: RCFGBuilder took 605.20 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 151.9 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:37,710 INFO L168 Benchmark]: TraceAbstraction took 2543.98 ms. Allocated memory was 203.4 MB in the beginning and 245.4 MB in the end (delta: 41.9 MB). Free memory was 151.3 MB in the beginning and 129.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:37,714 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 313.61 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 92.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.39 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 92.6 MB in the beginning and 181.0 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 605.20 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 151.9 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2543.98 ms. Allocated memory was 203.4 MB in the beginning and 245.4 MB in the end (delta: 41.9 MB). Free memory was 151.3 MB in the beginning and 129.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 64.0 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:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...