/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/ms1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:24,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:24,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:24,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:24,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:24,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:24,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:24,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:24,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:24,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:24,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:24,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:24,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:24,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:24,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:24,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:24,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:24,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:24,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:24,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:24,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:24,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:24,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:24,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:24,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:24,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:24,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:24,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:24,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:24,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:24,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:24,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:24,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:24,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:24,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:24,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:24,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:24,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:24,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:24,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:24,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:24,104 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:24,119 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:24,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:24,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:24,122 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:24,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:24,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:24,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:24,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:24,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:24,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:24,124 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:24,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:24,125 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:24,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:24,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:24,125 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:24,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:24,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:24,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:24,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:24,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:24,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:24,127 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:24,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:24,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:24,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:24,431 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:24,431 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:24,432 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ms1f.c [2020-07-18 00:47:24,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/507eb2742/ca5975f6454046d49e5fb541561a3130/FLAG4eec35dec [2020-07-18 00:47:24,988 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:24,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms1f.c [2020-07-18 00:47:24,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/507eb2742/ca5975f6454046d49e5fb541561a3130/FLAG4eec35dec [2020-07-18 00:47:25,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/507eb2742/ca5975f6454046d49e5fb541561a3130 [2020-07-18 00:47:25,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:25,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:25,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:25,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:25,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:25,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc01980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25, skipping insertion in model container [2020-07-18 00:47:25,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:25,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:25,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:25,654 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:25,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:25,782 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:25,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25 WrapperNode [2020-07-18 00:47:25,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:25,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:25,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:25,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:25,798 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:25" (1/1) ... [2020-07-18 00:47:25,798 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:25" (1/1) ... [2020-07-18 00:47:25,805 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:25" (1/1) ... [2020-07-18 00:47:25,805 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:25" (1/1) ... [2020-07-18 00:47:25,819 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:25" (1/1) ... [2020-07-18 00:47:25,825 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:25" (1/1) ... [2020-07-18 00:47:25,827 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:25" (1/1) ... [2020-07-18 00:47:25,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:25,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:25,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:25,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:25,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (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:25,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:25,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:25,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:47:25,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:25,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:47:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:47:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:26,280 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:26,280 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 00:47:26,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:26 BoogieIcfgContainer [2020-07-18 00:47:26,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:26,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:26,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:26,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:26,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:25" (1/3) ... [2020-07-18 00:47:26,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fb5117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:26, skipping insertion in model container [2020-07-18 00:47:26,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (2/3) ... [2020-07-18 00:47:26,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fb5117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:26, skipping insertion in model container [2020-07-18 00:47:26,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:26" (3/3) ... [2020-07-18 00:47:26,301 INFO L109 eAbstractionObserver]: Analyzing ICFG ms1f.c [2020-07-18 00:47:26,313 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:26,320 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:26,332 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:26,352 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:26,353 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:26,353 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:26,353 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:26,353 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:26,353 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:26,353 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:26,354 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-07-18 00:47:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 00:47:26,384 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:26,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:26,385 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash -845632023, now seen corresponding path program 1 times [2020-07-18 00:47:26,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:26,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1646483201] [2020-07-18 00:47:26,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:26,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {72#(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; {60#true} is VALID [2020-07-18 00:47:26,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#true} #valid := #valid[0 := 0]; {60#true} is VALID [2020-07-18 00:47:26,656 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} assume 0 < #StackHeapBarrier; {60#true} is VALID [2020-07-18 00:47:26,656 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#true} ~N~0 := 0; {60#true} is VALID [2020-07-18 00:47:26,657 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-18 00:47:26,657 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {60#true} {60#true} #97#return; {60#true} is VALID [2020-07-18 00:47:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:26,667 INFO L280 TraceCheckUtils]: 0: Hoare triple {60#true} ~cond := #in~cond; {60#true} is VALID [2020-07-18 00:47:26,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#true} assume !(0 == ~cond); {60#true} is VALID [2020-07-18 00:47:26,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-18 00:47:26,669 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #93#return; {60#true} is VALID [2020-07-18 00:47:26,671 INFO L263 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {72#(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:26,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {72#(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; {60#true} is VALID [2020-07-18 00:47:26,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} #valid := #valid[0 := 0]; {60#true} is VALID [2020-07-18 00:47:26,673 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#true} assume 0 < #StackHeapBarrier; {60#true} is VALID [2020-07-18 00:47:26,673 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#true} ~N~0 := 0; {60#true} is VALID [2020-07-18 00:47:26,674 INFO L280 TraceCheckUtils]: 5: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-18 00:47:26,674 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {60#true} {60#true} #97#return; {60#true} is VALID [2020-07-18 00:47:26,675 INFO L263 TraceCheckUtils]: 7: Hoare triple {60#true} call #t~ret7 := main(); {60#true} is VALID [2020-07-18 00:47:26,675 INFO L280 TraceCheckUtils]: 8: Hoare triple {60#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {60#true} is VALID [2020-07-18 00:47:26,676 INFO L280 TraceCheckUtils]: 9: Hoare triple {60#true} ~N~0 := #t~nondet0; {60#true} is VALID [2020-07-18 00:47:26,676 INFO L280 TraceCheckUtils]: 10: Hoare triple {60#true} havoc #t~nondet0; {60#true} is VALID [2020-07-18 00:47:26,677 INFO L280 TraceCheckUtils]: 11: Hoare triple {60#true} assume !(~N~0 <= 0); {60#true} is VALID [2020-07-18 00:47:26,677 INFO L263 TraceCheckUtils]: 12: Hoare triple {60#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {60#true} is VALID [2020-07-18 00:47:26,677 INFO L280 TraceCheckUtils]: 13: Hoare triple {60#true} ~cond := #in~cond; {60#true} is VALID [2020-07-18 00:47:26,678 INFO L280 TraceCheckUtils]: 14: Hoare triple {60#true} assume !(0 == ~cond); {60#true} is VALID [2020-07-18 00:47:26,678 INFO L280 TraceCheckUtils]: 15: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-18 00:47:26,679 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {60#true} {60#true} #93#return; {60#true} is VALID [2020-07-18 00:47:26,679 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#true} havoc ~i~0; {60#true} is VALID [2020-07-18 00:47:26,680 INFO L280 TraceCheckUtils]: 18: Hoare triple {60#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {60#true} is VALID [2020-07-18 00:47:26,680 INFO L280 TraceCheckUtils]: 19: Hoare triple {60#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {60#true} is VALID [2020-07-18 00:47:26,681 INFO L280 TraceCheckUtils]: 20: Hoare triple {60#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {60#true} is VALID [2020-07-18 00:47:26,681 INFO L280 TraceCheckUtils]: 21: Hoare triple {60#true} ~i~0 := 0; {60#true} is VALID [2020-07-18 00:47:26,682 INFO L280 TraceCheckUtils]: 22: Hoare triple {60#true} assume !true; {61#false} is VALID [2020-07-18 00:47:26,683 INFO L280 TraceCheckUtils]: 23: Hoare triple {61#false} ~i~0 := 0; {61#false} is VALID [2020-07-18 00:47:26,683 INFO L280 TraceCheckUtils]: 24: Hoare triple {61#false} assume !true; {61#false} is VALID [2020-07-18 00:47:26,684 INFO L280 TraceCheckUtils]: 25: Hoare triple {61#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 4); srcloc: L34-6 {61#false} is VALID [2020-07-18 00:47:26,684 INFO L263 TraceCheckUtils]: 26: Hoare triple {61#false} call __VERIFIER_assert((if #t~mem6 == ~N~0 then 1 else 0)); {61#false} is VALID [2020-07-18 00:47:26,684 INFO L280 TraceCheckUtils]: 27: Hoare triple {61#false} ~cond := #in~cond; {61#false} is VALID [2020-07-18 00:47:26,685 INFO L280 TraceCheckUtils]: 28: Hoare triple {61#false} assume 0 == ~cond; {61#false} is VALID [2020-07-18 00:47:26,685 INFO L280 TraceCheckUtils]: 29: Hoare triple {61#false} assume !false; {61#false} is VALID [2020-07-18 00:47:26,690 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:26,692 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:26,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1646483201] [2020-07-18 00:47:26,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:26,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:26,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530725888] [2020-07-18 00:47:26,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-18 00:47:26,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:26,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:26,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:26,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:26,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:26,780 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2020-07-18 00:47:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:27,155 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2020-07-18 00:47:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:27,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-18 00:47:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-18 00:47:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-18 00:47:27,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-18 00:47:27,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:27,339 INFO L225 Difference]: With dead ends: 97 [2020-07-18 00:47:27,340 INFO L226 Difference]: Without dead ends: 45 [2020-07-18 00:47:27,343 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:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-18 00:47:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-18 00:47:27,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:27,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2020-07-18 00:47:27,425 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-18 00:47:27,425 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-18 00:47:27,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:27,430 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-18 00:47:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-07-18 00:47:27,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:27,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:27,432 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-18 00:47:27,432 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-18 00:47:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:27,437 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-18 00:47:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-07-18 00:47:27,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:27,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:27,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:27,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-18 00:47:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2020-07-18 00:47:27,444 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 30 [2020-07-18 00:47:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:27,444 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2020-07-18 00:47:27,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:27,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2020-07-18 00:47:27,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-07-18 00:47:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 00:47:27,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:27,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:27,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:27,505 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:27,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:27,506 INFO L82 PathProgramCache]: Analyzing trace with hash 104990277, now seen corresponding path program 1 times [2020-07-18 00:47:27,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:27,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022422084] [2020-07-18 00:47:27,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:27,648 INFO L280 TraceCheckUtils]: 0: Hoare triple {463#(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; {449#true} is VALID [2020-07-18 00:47:27,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} #valid := #valid[0 := 0]; {449#true} is VALID [2020-07-18 00:47:27,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume 0 < #StackHeapBarrier; {449#true} is VALID [2020-07-18 00:47:27,649 INFO L280 TraceCheckUtils]: 3: Hoare triple {449#true} ~N~0 := 0; {449#true} is VALID [2020-07-18 00:47:27,649 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 00:47:27,650 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {449#true} {449#true} #97#return; {449#true} is VALID [2020-07-18 00:47:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:27,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-18 00:47:27,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-18 00:47:27,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 00:47:27,661 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {449#true} {457#(<= 1 ~N~0)} #93#return; {457#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,662 INFO L263 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {463#(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:27,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#(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; {449#true} is VALID [2020-07-18 00:47:27,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} #valid := #valid[0 := 0]; {449#true} is VALID [2020-07-18 00:47:27,663 INFO L280 TraceCheckUtils]: 3: Hoare triple {449#true} assume 0 < #StackHeapBarrier; {449#true} is VALID [2020-07-18 00:47:27,663 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} ~N~0 := 0; {449#true} is VALID [2020-07-18 00:47:27,664 INFO L280 TraceCheckUtils]: 5: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 00:47:27,664 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {449#true} {449#true} #97#return; {449#true} is VALID [2020-07-18 00:47:27,664 INFO L263 TraceCheckUtils]: 7: Hoare triple {449#true} call #t~ret7 := main(); {449#true} is VALID [2020-07-18 00:47:27,664 INFO L280 TraceCheckUtils]: 8: Hoare triple {449#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {449#true} is VALID [2020-07-18 00:47:27,665 INFO L280 TraceCheckUtils]: 9: Hoare triple {449#true} ~N~0 := #t~nondet0; {449#true} is VALID [2020-07-18 00:47:27,665 INFO L280 TraceCheckUtils]: 10: Hoare triple {449#true} havoc #t~nondet0; {449#true} is VALID [2020-07-18 00:47:27,666 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#true} assume !(~N~0 <= 0); {457#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,667 INFO L263 TraceCheckUtils]: 12: Hoare triple {457#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {449#true} is VALID [2020-07-18 00:47:27,667 INFO L280 TraceCheckUtils]: 13: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-18 00:47:27,667 INFO L280 TraceCheckUtils]: 14: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-18 00:47:27,668 INFO L280 TraceCheckUtils]: 15: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 00:47:27,669 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {449#true} {457#(<= 1 ~N~0)} #93#return; {457#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {457#(<= 1 ~N~0)} havoc ~i~0; {457#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,670 INFO L280 TraceCheckUtils]: 18: Hoare triple {457#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {457#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {457#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {457#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,672 INFO L280 TraceCheckUtils]: 20: Hoare triple {457#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {457#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,673 INFO L280 TraceCheckUtils]: 21: Hoare triple {457#(<= 1 ~N~0)} ~i~0 := 0; {462#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 00:47:27,674 INFO L280 TraceCheckUtils]: 22: Hoare triple {462#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {450#false} is VALID [2020-07-18 00:47:27,674 INFO L280 TraceCheckUtils]: 23: Hoare triple {450#false} ~i~0 := 0; {450#false} is VALID [2020-07-18 00:47:27,674 INFO L280 TraceCheckUtils]: 24: Hoare triple {450#false} assume !(~i~0 < ~N~0); {450#false} is VALID [2020-07-18 00:47:27,675 INFO L280 TraceCheckUtils]: 25: Hoare triple {450#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 4); srcloc: L34-6 {450#false} is VALID [2020-07-18 00:47:27,675 INFO L263 TraceCheckUtils]: 26: Hoare triple {450#false} call __VERIFIER_assert((if #t~mem6 == ~N~0 then 1 else 0)); {450#false} is VALID [2020-07-18 00:47:27,675 INFO L280 TraceCheckUtils]: 27: Hoare triple {450#false} ~cond := #in~cond; {450#false} is VALID [2020-07-18 00:47:27,676 INFO L280 TraceCheckUtils]: 28: Hoare triple {450#false} assume 0 == ~cond; {450#false} is VALID [2020-07-18 00:47:27,676 INFO L280 TraceCheckUtils]: 29: Hoare triple {450#false} assume !false; {450#false} is VALID [2020-07-18 00:47:27,678 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:27,683 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:27,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022422084] [2020-07-18 00:47:27,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:27,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:27,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850001636] [2020-07-18 00:47:27,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 00:47:27,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:27,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:27,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:27,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:27,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:27,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:27,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:27,723 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 5 states. [2020-07-18 00:47:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:28,137 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-18 00:47:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:28,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 00:47:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-18 00:47:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-18 00:47:28,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2020-07-18 00:47:28,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:28,272 INFO L225 Difference]: With dead ends: 71 [2020-07-18 00:47:28,272 INFO L226 Difference]: Without dead ends: 53 [2020-07-18 00:47:28,274 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:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-18 00:47:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2020-07-18 00:47:28,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:28,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 48 states. [2020-07-18 00:47:28,379 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 48 states. [2020-07-18 00:47:28,379 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 48 states. [2020-07-18 00:47:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:28,385 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-18 00:47:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-18 00:47:28,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:28,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:28,387 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 53 states. [2020-07-18 00:47:28,387 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 53 states. [2020-07-18 00:47:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:28,392 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-18 00:47:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-18 00:47:28,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:28,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:28,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:28,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 00:47:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2020-07-18 00:47:28,395 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 30 [2020-07-18 00:47:28,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:28,395 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2020-07-18 00:47:28,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:28,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 50 transitions. [2020-07-18 00:47:28,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-07-18 00:47:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 00:47:28,454 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:28,455 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] [2020-07-18 00:47:28,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:28,455 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:28,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1687643347, now seen corresponding path program 1 times [2020-07-18 00:47:28,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:28,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [974958232] [2020-07-18 00:47:28,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:28,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:28,487 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:28,493 INFO L168 Benchmark]: Toolchain (without parser) took 3116.78 ms. Allocated memory was 146.3 MB in the beginning and 244.8 MB in the end (delta: 98.6 MB). Free memory was 103.3 MB in the beginning and 161.5 MB in the end (delta: -58.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:28,494 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:28,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.20 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.9 MB in the beginning and 182.1 MB in the end (delta: -79.2 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:28,496 INFO L168 Benchmark]: Boogie Preprocessor took 45.38 ms. Allocated memory is still 202.9 MB. Free memory was 182.1 MB in the beginning and 179.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:28,497 INFO L168 Benchmark]: RCFGBuilder took 458.08 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 152.8 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:28,498 INFO L168 Benchmark]: TraceAbstraction took 2200.81 ms. Allocated memory was 202.9 MB in the beginning and 244.8 MB in the end (delta: 41.9 MB). Free memory was 152.1 MB in the beginning and 161.5 MB in the end (delta: -9.4 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:28,502 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.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 405.20 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.9 MB in the beginning and 182.1 MB in the end (delta: -79.2 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.38 ms. Allocated memory is still 202.9 MB. Free memory was 182.1 MB in the beginning and 179.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 458.08 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 152.8 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2200.81 ms. Allocated memory was 202.9 MB in the beginning and 244.8 MB in the end (delta: 41.9 MB). Free memory was 152.1 MB in the beginning and 161.5 MB in the end (delta: -9.4 MB). Peak memory consumption was 32.6 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...