/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/brs1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:35:55,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:35:55,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:35:55,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:35:55,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:35:55,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:35:55,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:35:55,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:35:55,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:35:55,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:35:55,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:35:55,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:35:55,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:35:55,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:35:55,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:35:55,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:35:55,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:35:55,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:35:55,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:35:55,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:35:55,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:35:55,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:35:55,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:35:55,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:35:55,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:35:55,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:35:55,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:35:55,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:35:55,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:35:55,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:35:55,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:35:55,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:35:55,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:35:55,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:35:55,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:35:55,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:35:55,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:35:55,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:35:55,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:35:55,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:35:55,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:35:55,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:35:55,883 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:35:55,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:35:55,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:35:55,885 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:35:55,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:35:55,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:35:55,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:35:55,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:35:55,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:35:55,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:35:55,887 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:35:55,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:35:55,887 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:35:55,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:35:55,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:35:55,888 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:35:55,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:35:55,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:35:55,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:35:55,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:35:55,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:35:55,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:35:55,889 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:35:56,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:35:56,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:35:56,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:35:56,253 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:35:56,254 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:35:56,254 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs1f.c [2020-07-08 17:35:56,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004d2e448/33201afa2c1b46379a0a4e5a26ac7f33/FLAG031c182f6 [2020-07-08 17:35:56,930 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:35:56,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs1f.c [2020-07-08 17:35:56,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004d2e448/33201afa2c1b46379a0a4e5a26ac7f33/FLAG031c182f6 [2020-07-08 17:35:57,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004d2e448/33201afa2c1b46379a0a4e5a26ac7f33 [2020-07-08 17:35:57,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:35:57,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:35:57,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:35:57,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:35:57,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:35:57,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:35:57" (1/1) ... [2020-07-08 17:35:57,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bead539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57, skipping insertion in model container [2020-07-08 17:35:57,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:35:57" (1/1) ... [2020-07-08 17:35:57,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:35:57,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:35:57,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:35:57,662 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:35:57,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:35:57,713 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:35:57,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57 WrapperNode [2020-07-08 17:35:57,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:35:57,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:35:57,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:35:57,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:35:57,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57" (1/1) ... [2020-07-08 17:35:57,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57" (1/1) ... [2020-07-08 17:35:57,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57" (1/1) ... [2020-07-08 17:35:57,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57" (1/1) ... [2020-07-08 17:35:57,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57" (1/1) ... [2020-07-08 17:35:57,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57" (1/1) ... [2020-07-08 17:35:57,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57" (1/1) ... [2020-07-08 17:35:57,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:35:57,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:35:57,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:35:57,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:35:57,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57" (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-08 17:35:57,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:35:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:35:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:35:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:35:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:35:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:35:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:35:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:35:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:35:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:35:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 17:35:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:35:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 17:35:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 17:35:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 17:35:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 17:35:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 17:35:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:35:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:35:58,489 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:35:58,491 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 17:35:58,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:35:58 BoogieIcfgContainer [2020-07-08 17:35:58,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:35:58,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:35:58,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:35:58,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:35:58,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:35:57" (1/3) ... [2020-07-08 17:35:58,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8a3835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:35:58, skipping insertion in model container [2020-07-08 17:35:58,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:57" (2/3) ... [2020-07-08 17:35:58,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8a3835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:35:58, skipping insertion in model container [2020-07-08 17:35:58,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:35:58" (3/3) ... [2020-07-08 17:35:58,514 INFO L109 eAbstractionObserver]: Analyzing ICFG brs1f.c [2020-07-08 17:35:58,523 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:35:58,532 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:35:58,546 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:35:58,568 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:35:58,569 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:35:58,569 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:35:58,569 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:35:58,569 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:35:58,569 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:35:58,569 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:35:58,570 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:35:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-08 17:35:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 17:35:58,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:35:58,595 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-08 17:35:58,596 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:35:58,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:35:58,602 INFO L82 PathProgramCache]: Analyzing trace with hash 221259408, now seen corresponding path program 1 times [2020-07-08 17:35:58,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:35:58,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [330221544] [2020-07-08 17:35:58,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:35:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:58,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-08 17:35:58,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-08 17:35:58,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-08 17:35:58,900 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-08 17:35:58,900 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-08 17:35:58,901 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-08 17:35:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:58,914 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-08 17:35:58,914 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-08 17:35:58,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-08 17:35:58,916 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-08 17:35:58,918 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:35:58,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-08 17:35:58,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-08 17:35:58,920 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-08 17:35:58,920 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-08 17:35:58,921 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-08 17:35:58,921 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-08 17:35:58,921 INFO L263 TraceCheckUtils]: 7: Hoare triple {62#true} call #t~ret7 := main(); {62#true} is VALID [2020-07-08 17:35:58,922 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {62#true} is VALID [2020-07-08 17:35:58,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {62#true} ~N~0 := #t~nondet0; {62#true} is VALID [2020-07-08 17:35:58,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {62#true} havoc #t~nondet0; {62#true} is VALID [2020-07-08 17:35:58,923 INFO L280 TraceCheckUtils]: 11: Hoare triple {62#true} assume !(~N~0 <= 0); {62#true} is VALID [2020-07-08 17:35:58,924 INFO L263 TraceCheckUtils]: 12: Hoare triple {62#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {62#true} is VALID [2020-07-08 17:35:58,924 INFO L280 TraceCheckUtils]: 13: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-08 17:35:58,925 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-08 17:35:58,925 INFO L280 TraceCheckUtils]: 15: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-08 17:35:58,925 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-08 17:35:58,926 INFO L280 TraceCheckUtils]: 17: Hoare triple {62#true} havoc ~i~0; {62#true} is VALID [2020-07-08 17:35:58,926 INFO L280 TraceCheckUtils]: 18: Hoare triple {62#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {62#true} is VALID [2020-07-08 17:35:58,927 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {62#true} is VALID [2020-07-08 17:35:58,927 INFO L280 TraceCheckUtils]: 20: Hoare triple {62#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {62#true} is VALID [2020-07-08 17:35:58,928 INFO L280 TraceCheckUtils]: 21: Hoare triple {62#true} ~i~0 := 0; {62#true} is VALID [2020-07-08 17:35:58,929 INFO L280 TraceCheckUtils]: 22: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-08 17:35:58,930 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} ~i~0 := 0; {63#false} is VALID [2020-07-08 17:35:58,930 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !(~i~0 < ~N~0); {63#false} is VALID [2020-07-08 17:35:58,931 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {63#false} is VALID [2020-07-08 17:35:58,931 INFO L263 TraceCheckUtils]: 26: Hoare triple {63#false} call __VERIFIER_assert((if #t~mem6 <= ~N~0 then 1 else 0)); {63#false} is VALID [2020-07-08 17:35:58,932 INFO L280 TraceCheckUtils]: 27: Hoare triple {63#false} ~cond := #in~cond; {63#false} is VALID [2020-07-08 17:35:58,932 INFO L280 TraceCheckUtils]: 28: Hoare triple {63#false} assume 0 == ~cond; {63#false} is VALID [2020-07-08 17:35:58,933 INFO L280 TraceCheckUtils]: 29: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-08 17:35:58,937 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-08 17:35:58,938 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:35:58,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [330221544] [2020-07-08 17:35:58,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:35:58,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 17:35:58,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294046765] [2020-07-08 17:35:58,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 17:35:58,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:35:58,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 17:35:59,031 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-08 17:35:59,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 17:35:59,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:35:59,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 17:35:59,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:35:59,046 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-08 17:35:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:59,526 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2020-07-08 17:35:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 17:35:59,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 17:35:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:35:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:35:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2020-07-08 17:35:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:35:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2020-07-08 17:35:59,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2020-07-08 17:35:59,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:59,754 INFO L225 Difference]: With dead ends: 100 [2020-07-08 17:35:59,754 INFO L226 Difference]: Without dead ends: 46 [2020-07-08 17:35:59,760 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:35:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-08 17:35:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-08 17:35:59,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:35:59,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2020-07-08 17:35:59,870 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-08 17:35:59,871 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-08 17:35:59,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:59,878 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-07-08 17:35:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-08 17:35:59,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:35:59,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:35:59,880 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-08 17:35:59,881 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-08 17:35:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:59,888 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-07-08 17:35:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-08 17:35:59,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:35:59,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:35:59,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:35:59,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:35:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-08 17:35:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-07-08 17:35:59,896 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 30 [2020-07-08 17:35:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:35:59,897 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-07-08 17:35:59,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 17:35:59,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 48 transitions. [2020-07-08 17:35:59,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-08 17:35:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 17:35:59,969 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:35:59,969 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-08 17:35:59,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:35:59,970 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:35:59,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:35:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash -151091841, now seen corresponding path program 1 times [2020-07-08 17:35:59,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:35:59,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684164582] [2020-07-08 17:35:59,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:00,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {475#(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; {461#true} is VALID [2020-07-08 17:36:00,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {461#true} #valid := #valid[0 := 0]; {461#true} is VALID [2020-07-08 17:36:00,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {461#true} assume 0 < #StackHeapBarrier; {461#true} is VALID [2020-07-08 17:36:00,196 INFO L280 TraceCheckUtils]: 3: Hoare triple {461#true} ~N~0 := 0; {461#true} is VALID [2020-07-08 17:36:00,196 INFO L280 TraceCheckUtils]: 4: Hoare triple {461#true} assume true; {461#true} is VALID [2020-07-08 17:36:00,197 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {461#true} {461#true} #103#return; {461#true} is VALID [2020-07-08 17:36:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:00,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {461#true} ~cond := #in~cond; {461#true} is VALID [2020-07-08 17:36:00,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {461#true} assume !(0 == ~cond); {461#true} is VALID [2020-07-08 17:36:00,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {461#true} assume true; {461#true} is VALID [2020-07-08 17:36:00,220 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {461#true} {469#(<= 1 ~N~0)} #99#return; {469#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:00,225 INFO L263 TraceCheckUtils]: 0: Hoare triple {461#true} call ULTIMATE.init(); {475#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:00,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {475#(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; {461#true} is VALID [2020-07-08 17:36:00,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {461#true} #valid := #valid[0 := 0]; {461#true} is VALID [2020-07-08 17:36:00,226 INFO L280 TraceCheckUtils]: 3: Hoare triple {461#true} assume 0 < #StackHeapBarrier; {461#true} is VALID [2020-07-08 17:36:00,226 INFO L280 TraceCheckUtils]: 4: Hoare triple {461#true} ~N~0 := 0; {461#true} is VALID [2020-07-08 17:36:00,227 INFO L280 TraceCheckUtils]: 5: Hoare triple {461#true} assume true; {461#true} is VALID [2020-07-08 17:36:00,227 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {461#true} {461#true} #103#return; {461#true} is VALID [2020-07-08 17:36:00,227 INFO L263 TraceCheckUtils]: 7: Hoare triple {461#true} call #t~ret7 := main(); {461#true} is VALID [2020-07-08 17:36:00,228 INFO L280 TraceCheckUtils]: 8: Hoare triple {461#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {461#true} is VALID [2020-07-08 17:36:00,228 INFO L280 TraceCheckUtils]: 9: Hoare triple {461#true} ~N~0 := #t~nondet0; {461#true} is VALID [2020-07-08 17:36:00,228 INFO L280 TraceCheckUtils]: 10: Hoare triple {461#true} havoc #t~nondet0; {461#true} is VALID [2020-07-08 17:36:00,230 INFO L280 TraceCheckUtils]: 11: Hoare triple {461#true} assume !(~N~0 <= 0); {469#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:00,230 INFO L263 TraceCheckUtils]: 12: Hoare triple {469#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {461#true} is VALID [2020-07-08 17:36:00,231 INFO L280 TraceCheckUtils]: 13: Hoare triple {461#true} ~cond := #in~cond; {461#true} is VALID [2020-07-08 17:36:00,231 INFO L280 TraceCheckUtils]: 14: Hoare triple {461#true} assume !(0 == ~cond); {461#true} is VALID [2020-07-08 17:36:00,233 INFO L280 TraceCheckUtils]: 15: Hoare triple {461#true} assume true; {461#true} is VALID [2020-07-08 17:36:00,235 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {461#true} {469#(<= 1 ~N~0)} #99#return; {469#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:00,236 INFO L280 TraceCheckUtils]: 17: Hoare triple {469#(<= 1 ~N~0)} havoc ~i~0; {469#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:00,237 INFO L280 TraceCheckUtils]: 18: Hoare triple {469#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {469#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:00,238 INFO L280 TraceCheckUtils]: 19: Hoare triple {469#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {469#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:00,239 INFO L280 TraceCheckUtils]: 20: Hoare triple {469#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {469#(<= 1 ~N~0)} is VALID [2020-07-08 17:36:00,240 INFO L280 TraceCheckUtils]: 21: Hoare triple {469#(<= 1 ~N~0)} ~i~0 := 0; {474#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 17:36:00,241 INFO L280 TraceCheckUtils]: 22: Hoare triple {474#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {462#false} is VALID [2020-07-08 17:36:00,241 INFO L280 TraceCheckUtils]: 23: Hoare triple {462#false} ~i~0 := 0; {462#false} is VALID [2020-07-08 17:36:00,241 INFO L280 TraceCheckUtils]: 24: Hoare triple {462#false} assume !(~i~0 < ~N~0); {462#false} is VALID [2020-07-08 17:36:00,242 INFO L280 TraceCheckUtils]: 25: Hoare triple {462#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {462#false} is VALID [2020-07-08 17:36:00,242 INFO L263 TraceCheckUtils]: 26: Hoare triple {462#false} call __VERIFIER_assert((if #t~mem6 <= ~N~0 then 1 else 0)); {462#false} is VALID [2020-07-08 17:36:00,242 INFO L280 TraceCheckUtils]: 27: Hoare triple {462#false} ~cond := #in~cond; {462#false} is VALID [2020-07-08 17:36:00,243 INFO L280 TraceCheckUtils]: 28: Hoare triple {462#false} assume 0 == ~cond; {462#false} is VALID [2020-07-08 17:36:00,244 INFO L280 TraceCheckUtils]: 29: Hoare triple {462#false} assume !false; {462#false} is VALID [2020-07-08 17:36:00,247 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-08 17:36:00,248 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:00,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684164582] [2020-07-08 17:36:00,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:00,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:36:00,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841258809] [2020-07-08 17:36:00,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-08 17:36:00,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:00,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:36:00,306 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-08 17:36:00,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:36:00,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:36:00,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:36:00,308 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 5 states. [2020-07-08 17:36:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:00,797 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2020-07-08 17:36:00,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:36:00,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-08 17:36:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-08 17:36:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-08 17:36:00,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2020-07-08 17:36:00,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:00,920 INFO L225 Difference]: With dead ends: 73 [2020-07-08 17:36:00,920 INFO L226 Difference]: Without dead ends: 55 [2020-07-08 17:36:00,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:36:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-08 17:36:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2020-07-08 17:36:00,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:00,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 49 states. [2020-07-08 17:36:01,000 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 49 states. [2020-07-08 17:36:01,000 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 49 states. [2020-07-08 17:36:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:01,010 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-08 17:36:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-08 17:36:01,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:01,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:01,013 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 55 states. [2020-07-08 17:36:01,013 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 55 states. [2020-07-08 17:36:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:01,018 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-08 17:36:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-08 17:36:01,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:01,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:01,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:01,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-08 17:36:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-08 17:36:01,029 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 30 [2020-07-08 17:36:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:01,030 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-08 17:36:01,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:36:01,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2020-07-08 17:36:01,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-08 17:36:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 17:36:01,103 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:01,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:36:01,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:36:01,104 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:01,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1707000309, now seen corresponding path program 1 times [2020-07-08 17:36:01,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:01,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1429656454] [2020-07-08 17:36:01,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:01,146 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:36:01,147 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 17:36:01,153 INFO L168 Benchmark]: Toolchain (without parser) took 3790.93 ms. Allocated memory was 135.8 MB in the beginning and 252.7 MB in the end (delta: 116.9 MB). Free memory was 99.6 MB in the beginning and 172.2 MB in the end (delta: -72.6 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:01,154 INFO L168 Benchmark]: CDTParser took 1.11 ms. Allocated memory is still 135.8 MB. Free memory is still 117.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 17:36:01,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.08 ms. Allocated memory is still 135.8 MB. Free memory was 99.2 MB in the beginning and 88.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:01,156 INFO L168 Benchmark]: Boogie Preprocessor took 162.29 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 88.5 MB in the beginning and 177.2 MB in the end (delta: -88.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:01,157 INFO L168 Benchmark]: RCFGBuilder took 625.35 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 149.3 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:01,158 INFO L168 Benchmark]: TraceAbstraction took 2646.18 ms. Allocated memory was 199.8 MB in the beginning and 252.7 MB in the end (delta: 53.0 MB). Free memory was 148.3 MB in the beginning and 174.4 MB in the end (delta: -26.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:01,162 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 1.11 ms. Allocated memory is still 135.8 MB. Free memory is still 117.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 347.08 ms. Allocated memory is still 135.8 MB. Free memory was 99.2 MB in the beginning and 88.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 162.29 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 88.5 MB in the beginning and 177.2 MB in the end (delta: -88.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 625.35 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 149.3 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2646.18 ms. Allocated memory was 199.8 MB in the beginning and 252.7 MB in the end (delta: 53.0 MB). Free memory was 148.3 MB in the beginning and 174.4 MB in the end (delta: -26.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...