/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/bubble_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:00:09,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:00:09,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:00:09,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:00:09,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:00:09,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:00:09,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:00:09,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:00:09,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:00:10,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:00:10,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:00:10,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:00:10,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:00:10,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:00:10,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:00:10,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:00:10,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:00:10,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:00:10,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:00:10,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:00:10,016 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:00:10,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:00:10,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:00:10,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:00:10,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:00:10,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:00:10,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:00:10,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:00:10,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:00:10,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:00:10,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:00:10,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:00:10,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:00:10,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:00:10,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:00:10,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:00:10,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:00:10,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:00:10,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:00:10,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:00:10,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:00:10,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:00:10,033 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:00:10,040 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:00:10,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:00:10,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:00:10,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:00:10,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:00:10,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:00:10,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:00:10,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:00:10,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:00:10,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:00:10,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:00:10,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:00:10,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:00:10,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:00:10,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:00:10,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:10,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:00:10,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:00:10,044 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:00:10,044 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:00:10,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:00:10,044 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:00:10,044 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:00:10,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:00:10,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:00:10,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:00:10,256 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:00:10,256 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:00:10,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/bubble_sort-2.i [2022-04-28 09:00:10,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c2ca70e0/2cb48688b3bf4ba79e2c2ba31105d202/FLAGb3a1ad51a [2022-04-28 09:00:10,630 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:00:10,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i [2022-04-28 09:00:10,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c2ca70e0/2cb48688b3bf4ba79e2c2ba31105d202/FLAGb3a1ad51a [2022-04-28 09:00:11,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c2ca70e0/2cb48688b3bf4ba79e2c2ba31105d202 [2022-04-28 09:00:11,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:00:11,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:00:11,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:11,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:00:11,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:00:11,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6f46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11, skipping insertion in model container [2022-04-28 09:00:11,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:00:11,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:00:11,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i[1830,1843] [2022-04-28 09:00:11,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:11,463 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:00:11,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i[1830,1843] [2022-04-28 09:00:11,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:11,619 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:00:11,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11 WrapperNode [2022-04-28 09:00:11,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:11,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:00:11,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:00:11,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:00:11,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:00:11,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:00:11,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:00:11,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:00:11,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:11,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:11,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:00:11,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:00:11,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:00:11,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:00:11,902 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2022-04-28 09:00:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2022-04-28 09:00:11,904 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2022-04-28 09:00:11,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:00:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:00:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:00:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:00:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:00:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:00:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:00:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 09:00:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-28 09:00:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 09:00:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-04-28 09:00:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:00:12,174 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:00:12,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:00:12,581 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint failFINAL: assume true; [2022-04-28 09:00:12,841 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:00:12,847 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:00:12,847 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-04-28 09:00:12,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:12 BoogieIcfgContainer [2022-04-28 09:00:12,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:00:12,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:00:12,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:00:12,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:00:12,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:00:11" (1/3) ... [2022-04-28 09:00:12,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e6a918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:12, skipping insertion in model container [2022-04-28 09:00:12,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (2/3) ... [2022-04-28 09:00:12,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e6a918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:12, skipping insertion in model container [2022-04-28 09:00:12,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:12" (3/3) ... [2022-04-28 09:00:12,868 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort-2.i [2022-04-28 09:00:12,888 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:00:12,889 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:00:12,959 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:00:12,971 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@335825fe, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@583ca5c1 [2022-04-28 09:00:12,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:00:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 108 states have (on average 1.6574074074074074) internal successors, (179), 127 states have internal predecessors, (179), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 09:00:12,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:00:12,989 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:12,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:12,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:12,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1791385099, now seen corresponding path program 1 times [2022-04-28 09:00:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:13,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1371999089] [2022-04-28 09:00:13,017 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:13,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1791385099, now seen corresponding path program 2 times [2022-04-28 09:00:13,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:13,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653788618] [2022-04-28 09:00:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:13,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:13,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:13,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(2, 3);call write~init~int(48, 3, 0, 1);call write~init~int(0, 3, 1, 1);call #Ultimate.allocInit(12, 4);~#gl_list~0.base, ~#gl_list~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 8);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 8 + ~#gl_list~0.offset, 8); {159#true} is VALID [2022-04-28 09:00:13,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 09:00:13,320 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #593#return; {159#true} is VALID [2022-04-28 09:00:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 09:00:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:13,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~tmp~1;havoc ~tmp___0~0; {159#true} is VALID [2022-04-28 09:00:13,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume !true; {160#false} is VALID [2022-04-28 09:00:13,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#false} assume true; {160#false} is VALID [2022-04-28 09:00:13,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#false} {159#true} #539#return; {160#false} is VALID [2022-04-28 09:00:13,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {168#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:13,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(2, 3);call write~init~int(48, 3, 0, 1);call write~init~int(0, 3, 1, 1);call #Ultimate.allocInit(12, 4);~#gl_list~0.base, ~#gl_list~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 8);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 8 + ~#gl_list~0.offset, 8); {159#true} is VALID [2022-04-28 09:00:13,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 09:00:13,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #593#return; {159#true} is VALID [2022-04-28 09:00:13,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret31 := main(); {159#true} is VALID [2022-04-28 09:00:13,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} havoc ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset;havoc ~__cil_tmp2~1.base, ~__cil_tmp2~1.offset; {159#true} is VALID [2022-04-28 09:00:13,398 INFO L272 TraceCheckUtils]: 6: Hoare triple {159#true} call gl_read(); {169#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 09:00:13,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {169#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~tmp~1;havoc ~tmp___0~0; {159#true} is VALID [2022-04-28 09:00:13,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#true} assume !true; {160#false} is VALID [2022-04-28 09:00:13,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {160#false} assume true; {160#false} is VALID [2022-04-28 09:00:13,399 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {160#false} {159#true} #539#return; {160#false} is VALID [2022-04-28 09:00:13,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#false} ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset := ~#gl_list~0.base, ~#gl_list~0.offset; {160#false} is VALID [2022-04-28 09:00:13,400 INFO L272 TraceCheckUtils]: 12: Hoare triple {160#false} call inspect(~__cil_tmp1~0.base, ~__cil_tmp1~0.offset); {160#false} is VALID [2022-04-28 09:00:13,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {160#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~node~0.base, ~node~0.offset;havoc ~__cil_tmp3~0;havoc ~__cil_tmp4~0.base, ~__cil_tmp4~0.offset;havoc ~__cil_tmp5~0;havoc ~__cil_tmp6~0;havoc ~__cil_tmp7~0;havoc ~__cil_tmp8~0;havoc ~__cil_tmp9~0;havoc ~__cil_tmp10~0.base, ~__cil_tmp10~0.offset;havoc ~__cil_tmp11~0;havoc ~__cil_tmp12~0;havoc ~__cil_tmp13~0;havoc ~__cil_tmp14~0;havoc ~__cil_tmp15~0.base, ~__cil_tmp15~0.offset;havoc ~__cil_tmp16~0;havoc ~__cil_tmp17~0.base, ~__cil_tmp17~0.offset;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;havoc ~__cil_tmp20~0;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~0.base, ~__cil_tmp23~0.offset;havoc ~__cil_tmp24~0;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0.base, ~__cil_tmp26~0.offset;havoc ~__cil_tmp27~0;havoc ~__cil_tmp28~0;havoc ~__cil_tmp29~0.base, ~__cil_tmp29~0.offset;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0.base, ~__cil_tmp31~0.offset;havoc ~__cil_tmp32~0.base, ~__cil_tmp32~0.offset;havoc ~__cil_tmp33~0.base, ~__cil_tmp33~0.offset;havoc ~__cil_tmp34~0;havoc ~__cil_tmp35~0;havoc ~__cil_tmp36~0.base, ~__cil_tmp36~0.offset;havoc ~__cil_tmp37~0;havoc ~__cil_tmp38~0;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0.base, ~__cil_tmp40~0.offset;havoc ~__cil_tmp41~0;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;havoc ~__cil_tmp44~0;havoc ~__cil_tmp45~0.base, ~__cil_tmp45~0.offset;havoc ~__cil_tmp46~0;havoc ~__cil_tmp47~0;havoc ~__cil_tmp48~0;havoc ~__cil_tmp49~0;havoc ~__cil_tmp50~0.base, ~__cil_tmp50~0.offset;havoc ~__cil_tmp51~0;havoc ~__cil_tmp52~0;havoc ~__cil_tmp53~0;havoc ~__cil_tmp54~0;havoc ~__cil_tmp55~0.base, ~__cil_tmp55~0.offset;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0.base, ~__cil_tmp59~0.offset;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;havoc ~__cil_tmp62~0;havoc ~__cil_tmp63~0;havoc ~__cil_tmp64~0.base, ~__cil_tmp64~0.offset;havoc ~__cil_tmp65~0;havoc ~__cil_tmp66~0;havoc ~__cil_tmp67~0;havoc ~__cil_tmp68~0;havoc ~__cil_tmp69~0.base, ~__cil_tmp69~0.offset;havoc ~__cil_tmp70~0;havoc ~__cil_tmp71~0;havoc ~__cil_tmp72~0.base, ~__cil_tmp72~0.offset;havoc ~__cil_tmp73~0;havoc ~__cil_tmp74~0;havoc ~__cil_tmp75~0;havoc ~__cil_tmp76~0;havoc ~__cil_tmp77~0;havoc ~__cil_tmp78~0.base, ~__cil_tmp78~0.offset;havoc ~__cil_tmp79~0.base, ~__cil_tmp79~0.offset;havoc ~__cil_tmp80~0;havoc ~__cil_tmp81~0;havoc ~__cil_tmp82~0;havoc ~__cil_tmp83~0.base, ~__cil_tmp83~0.offset;havoc ~__cil_tmp84~0.base, ~__cil_tmp84~0.offset;havoc ~__cil_tmp85~0;havoc ~__cil_tmp86~0;havoc ~__cil_tmp87~0;havoc ~__cil_tmp88~0;havoc ~__cil_tmp89~0;havoc ~__cil_tmp90~0.base, ~__cil_tmp90~0.offset;havoc ~__cil_tmp91~0;havoc ~__cil_tmp92~0;havoc ~__cil_tmp93~0.base, ~__cil_tmp93~0.offset;havoc ~__cil_tmp94~0;havoc ~__cil_tmp95~0;havoc ~__cil_tmp96~0;havoc ~__cil_tmp97~0;havoc ~__cil_tmp98~0;havoc ~__cil_tmp99~0;havoc ~__cil_tmp100~0.base, ~__cil_tmp100~0.offset;havoc ~__cil_tmp101~0.base, ~__cil_tmp101~0.offset;havoc ~__cil_tmp102~0;havoc ~__cil_tmp103~0;havoc ~__cil_tmp104~0;havoc ~__cil_tmp105~0.base, ~__cil_tmp105~0.offset;havoc ~__cil_tmp106~0;havoc ~__cil_tmp107~0;havoc ~__cil_tmp108~0;havoc ~__cil_tmp109~0.base, ~__cil_tmp109~0.offset;havoc ~__cil_tmp110~0;havoc ~__cil_tmp111~0.base, ~__cil_tmp111~0.offset;havoc ~__cil_tmp112~0;havoc ~__cil_tmp113~0.base, ~__cil_tmp113~0.offset;havoc ~__cil_tmp114~0;havoc ~__cil_tmp115~0;havoc ~__cil_tmp116~0.base, ~__cil_tmp116~0.offset;havoc ~__cil_tmp117~0;havoc ~__cil_tmp118~0.base, ~__cil_tmp118~0.offset;havoc ~__cil_tmp119~0.base, ~__cil_tmp119~0.offset;havoc ~__cil_tmp120~0.base, ~__cil_tmp120~0.offset;havoc ~__cil_tmp121~0;havoc ~__cil_tmp122~0; {160#false} is VALID [2022-04-28 09:00:13,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 09:00:13,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {160#false} assume ~head.base == 0 && ~head.offset == 0; {160#false} is VALID [2022-04-28 09:00:13,402 INFO L272 TraceCheckUtils]: 16: Hoare triple {160#false} call fail(); {160#false} is VALID [2022-04-28 09:00:13,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 09:00:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:13,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:13,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653788618] [2022-04-28 09:00:13,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653788618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:13,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:13,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:13,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:13,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1371999089] [2022-04-28 09:00:13,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1371999089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:13,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:13,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249647830] [2022-04-28 09:00:13,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:13,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 09:00:13,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:13,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 09:00:13,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:13,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:00:13,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:00:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:00:13,493 INFO L87 Difference]: Start difference. First operand has 156 states, 108 states have (on average 1.6574074074074074) internal successors, (179), 127 states have internal predecessors, (179), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 09:00:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:14,809 INFO L93 Difference]: Finished difference Result 331 states and 501 transitions. [2022-04-28 09:00:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:00:14,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 09:00:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 09:00:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 09:00:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 09:00:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 09:00:14,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 501 transitions. [2022-04-28 09:00:15,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:15,574 INFO L225 Difference]: With dead ends: 331 [2022-04-28 09:00:15,574 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 09:00:15,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:00:15,580 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 255 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:15,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 142 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:00:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 09:00:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2022-04-28 09:00:15,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:15,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 09:00:15,733 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 09:00:15,733 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 09:00:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:15,744 INFO L93 Difference]: Finished difference Result 164 states and 196 transitions. [2022-04-28 09:00:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2022-04-28 09:00:15,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:15,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:15,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 164 states. [2022-04-28 09:00:15,753 INFO L87 Difference]: Start difference. First operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 164 states. [2022-04-28 09:00:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:15,777 INFO L93 Difference]: Finished difference Result 164 states and 196 transitions. [2022-04-28 09:00:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2022-04-28 09:00:15,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:15,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:15,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:15,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 09:00:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2022-04-28 09:00:15,786 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 18 [2022-04-28 09:00:15,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:15,786 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2022-04-28 09:00:15,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 09:00:15,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 166 transitions. [2022-04-28 09:00:15,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2022-04-28 09:00:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 09:00:15,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:15,999 INFO L195 NwaCegarLoop]: 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] [2022-04-28 09:00:15,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:00:16,000 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:16,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2112592059, now seen corresponding path program 1 times [2022-04-28 09:00:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:16,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [544572531] [2022-04-28 09:00:16,001 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2112592059, now seen corresponding path program 2 times [2022-04-28 09:00:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:16,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179409428] [2022-04-28 09:00:16,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:16,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:16,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:16,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {1483#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(2, 3);call write~init~int(48, 3, 0, 1);call write~init~int(0, 3, 1, 1);call #Ultimate.allocInit(12, 4);~#gl_list~0.base, ~#gl_list~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 8);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 8 + ~#gl_list~0.offset, 8); {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 09:00:16,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1456#(= |~#gl_list~0.base| 5)} assume true; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 09:00:16,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1456#(= |~#gl_list~0.base| 5)} {1451#true} #593#return; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 09:00:16,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 09:00:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-28 09:00:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-28 09:00:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:16,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 09:00:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:16,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, ~__cil_tmp5~1 % 4294967296, 8);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 8);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, ~__cil_tmp7~1 % 4294967296, 8);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 8); {1451#true} is VALID [2022-04-28 09:00:16,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1451#true} {1451#true} #591#return; {1451#true} is VALID [2022-04-28 09:00:16,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~head.base, ~head.offset, 8);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem17.base, #t~mem17.offset;havoc #t~mem17.base, #t~mem17.offset; {1451#true} is VALID [2022-04-28 09:00:16,328 INFO L272 TraceCheckUtils]: 1: Hoare triple {1451#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 09:00:16,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, ~__cil_tmp5~1 % 4294967296, 8);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 8);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, ~__cil_tmp7~1 % 4294967296, 8);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 8); {1451#true} is VALID [2022-04-28 09:00:16,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,329 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1451#true} {1451#true} #591#return; {1451#true} is VALID [2022-04-28 09:00:16,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,329 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1451#true} {1451#true} #597#return; {1451#true} is VALID [2022-04-28 09:00:16,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~value := #in~value;havoc ~node~1.base, ~node~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~__cil_tmp4~4;havoc ~__cil_tmp5~3;havoc ~__cil_tmp6~3;havoc ~__cil_tmp7~2.base, ~__cil_tmp7~2.offset;havoc ~__cil_tmp8~1;havoc ~__cil_tmp9~1;havoc ~__cil_tmp10~1;havoc ~__cil_tmp11~1;havoc ~__cil_tmp12~1;havoc ~__cil_tmp13~1;havoc ~__cil_tmp14~1;havoc ~__cil_tmp15~1;~__cil_tmp4~4 := 20;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~__cil_tmp4~4 % 4294967296);~tmp~0.base, ~tmp~0.offset := #t~malloc20.base, #t~malloc20.offset;havoc #t~malloc20.base, #t~malloc20.offset;~node~1.base, ~node~1.offset := ~tmp~0.base, ~tmp~0.offset; {1451#true} is VALID [2022-04-28 09:00:16,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {1451#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1451#true} is VALID [2022-04-28 09:00:16,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {1451#true} call write~int(~value, ~node~1.base, ~node~1.offset, 4);~__cil_tmp5~3 := ~node~1.base + ~node~1.offset;~__cil_tmp6~3 := 4 + ~__cil_tmp5~3;~__cil_tmp7~2.base, ~__cil_tmp7~2.offset := 0, ~__cil_tmp6~3 % 4294967296; {1451#true} is VALID [2022-04-28 09:00:16,331 INFO L272 TraceCheckUtils]: 3: Hoare triple {1451#true} call list_add(~__cil_tmp7~2.base, ~__cil_tmp7~2.offset, ~#gl_list~0.base, ~#gl_list~0.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 09:00:16,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~head.base, ~head.offset, 8);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem17.base, #t~mem17.offset;havoc #t~mem17.base, #t~mem17.offset; {1451#true} is VALID [2022-04-28 09:00:16,332 INFO L272 TraceCheckUtils]: 5: Hoare triple {1451#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 09:00:16,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, ~__cil_tmp5~1 % 4294967296, 8);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 8);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, ~__cil_tmp7~1 % 4294967296, 8);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 8); {1451#true} is VALID [2022-04-28 09:00:16,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,332 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1451#true} {1451#true} #591#return; {1451#true} is VALID [2022-04-28 09:00:16,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1451#true} {1451#true} #597#return; {1451#true} is VALID [2022-04-28 09:00:16,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {1451#true} assume !false; {1451#true} is VALID [2022-04-28 09:00:16,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {1451#true} ~__cil_tmp8~1 := ~node~1.base + ~node~1.offset;~__cil_tmp9~1 := 12 + ~__cil_tmp8~1;~__cil_tmp10~1 := ~node~1.base + ~node~1.offset;~__cil_tmp11~1 := 12 + ~__cil_tmp10~1;call write~$Pointer$(0, ~__cil_tmp11~1 % 4294967296, 0, ~__cil_tmp9~1 % 4294967296, 8);~__cil_tmp12~1 := ~node~1.base + ~node~1.offset;~__cil_tmp13~1 := 12 + ~__cil_tmp12~1;~__cil_tmp14~1 := ~node~1.base + ~node~1.offset;~__cil_tmp15~1 := 12 + ~__cil_tmp14~1;call write~$Pointer$(0, ~__cil_tmp15~1 % 4294967296, 0, ~__cil_tmp13~1 % 4294967296, 8); {1451#true} is VALID [2022-04-28 09:00:16,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,333 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1451#true} {1451#true} #555#return; {1451#true} is VALID [2022-04-28 09:00:16,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~tmp~1;havoc ~tmp___0~0; {1451#true} is VALID [2022-04-28 09:00:16,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {1451#true} assume !false; {1451#true} is VALID [2022-04-28 09:00:16,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {1451#true} assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp~1 := #t~nondet21;havoc #t~nondet21; {1451#true} is VALID [2022-04-28 09:00:16,335 INFO L272 TraceCheckUtils]: 3: Hoare triple {1451#true} call gl_insert(~tmp~1); {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 09:00:16,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~value := #in~value;havoc ~node~1.base, ~node~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~__cil_tmp4~4;havoc ~__cil_tmp5~3;havoc ~__cil_tmp6~3;havoc ~__cil_tmp7~2.base, ~__cil_tmp7~2.offset;havoc ~__cil_tmp8~1;havoc ~__cil_tmp9~1;havoc ~__cil_tmp10~1;havoc ~__cil_tmp11~1;havoc ~__cil_tmp12~1;havoc ~__cil_tmp13~1;havoc ~__cil_tmp14~1;havoc ~__cil_tmp15~1;~__cil_tmp4~4 := 20;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~__cil_tmp4~4 % 4294967296);~tmp~0.base, ~tmp~0.offset := #t~malloc20.base, #t~malloc20.offset;havoc #t~malloc20.base, #t~malloc20.offset;~node~1.base, ~node~1.offset := ~tmp~0.base, ~tmp~0.offset; {1451#true} is VALID [2022-04-28 09:00:16,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {1451#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1451#true} is VALID [2022-04-28 09:00:16,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {1451#true} call write~int(~value, ~node~1.base, ~node~1.offset, 4);~__cil_tmp5~3 := ~node~1.base + ~node~1.offset;~__cil_tmp6~3 := 4 + ~__cil_tmp5~3;~__cil_tmp7~2.base, ~__cil_tmp7~2.offset := 0, ~__cil_tmp6~3 % 4294967296; {1451#true} is VALID [2022-04-28 09:00:16,336 INFO L272 TraceCheckUtils]: 7: Hoare triple {1451#true} call list_add(~__cil_tmp7~2.base, ~__cil_tmp7~2.offset, ~#gl_list~0.base, ~#gl_list~0.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 09:00:16,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~head.base, ~head.offset, 8);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem17.base, #t~mem17.offset;havoc #t~mem17.base, #t~mem17.offset; {1451#true} is VALID [2022-04-28 09:00:16,337 INFO L272 TraceCheckUtils]: 9: Hoare triple {1451#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 09:00:16,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, ~__cil_tmp5~1 % 4294967296, 8);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 8);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, ~__cil_tmp7~1 % 4294967296, 8);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 8); {1451#true} is VALID [2022-04-28 09:00:16,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,338 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1451#true} {1451#true} #591#return; {1451#true} is VALID [2022-04-28 09:00:16,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,338 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1451#true} {1451#true} #597#return; {1451#true} is VALID [2022-04-28 09:00:16,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {1451#true} assume !false; {1451#true} is VALID [2022-04-28 09:00:16,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {1451#true} ~__cil_tmp8~1 := ~node~1.base + ~node~1.offset;~__cil_tmp9~1 := 12 + ~__cil_tmp8~1;~__cil_tmp10~1 := ~node~1.base + ~node~1.offset;~__cil_tmp11~1 := 12 + ~__cil_tmp10~1;call write~$Pointer$(0, ~__cil_tmp11~1 % 4294967296, 0, ~__cil_tmp9~1 % 4294967296, 8);~__cil_tmp12~1 := ~node~1.base + ~node~1.offset;~__cil_tmp13~1 := 12 + ~__cil_tmp12~1;~__cil_tmp14~1 := ~node~1.base + ~node~1.offset;~__cil_tmp15~1 := 12 + ~__cil_tmp14~1;call write~$Pointer$(0, ~__cil_tmp15~1 % 4294967296, 0, ~__cil_tmp13~1 % 4294967296, 8); {1451#true} is VALID [2022-04-28 09:00:16,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,339 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1451#true} {1451#true} #555#return; {1451#true} is VALID [2022-04-28 09:00:16,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {1451#true} assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___0~0 := #t~nondet22;havoc #t~nondet22; {1451#true} is VALID [2022-04-28 09:00:16,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {1451#true} assume !(0 != ~tmp___0~0); {1451#true} is VALID [2022-04-28 09:00:16,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,340 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1451#true} {1456#(= |~#gl_list~0.base| 5)} #539#return; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 09:00:16,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {1451#true} call ULTIMATE.init(); {1483#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:16,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(2, 3);call write~init~int(48, 3, 0, 1);call write~init~int(0, 3, 1, 1);call #Ultimate.allocInit(12, 4);~#gl_list~0.base, ~#gl_list~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 8);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 8 + ~#gl_list~0.offset, 8); {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 09:00:16,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {1456#(= |~#gl_list~0.base| 5)} assume true; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 09:00:16,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1456#(= |~#gl_list~0.base| 5)} {1451#true} #593#return; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 09:00:16,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {1456#(= |~#gl_list~0.base| 5)} call #t~ret31 := main(); {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 09:00:16,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {1456#(= |~#gl_list~0.base| 5)} havoc ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset;havoc ~__cil_tmp2~1.base, ~__cil_tmp2~1.offset; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 09:00:16,343 INFO L272 TraceCheckUtils]: 6: Hoare triple {1456#(= |~#gl_list~0.base| 5)} call gl_read(); {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 09:00:16,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~tmp~1;havoc ~tmp___0~0; {1451#true} is VALID [2022-04-28 09:00:16,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {1451#true} assume !false; {1451#true} is VALID [2022-04-28 09:00:16,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {1451#true} assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp~1 := #t~nondet21;havoc #t~nondet21; {1451#true} is VALID [2022-04-28 09:00:16,344 INFO L272 TraceCheckUtils]: 10: Hoare triple {1451#true} call gl_insert(~tmp~1); {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 09:00:16,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~value := #in~value;havoc ~node~1.base, ~node~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~__cil_tmp4~4;havoc ~__cil_tmp5~3;havoc ~__cil_tmp6~3;havoc ~__cil_tmp7~2.base, ~__cil_tmp7~2.offset;havoc ~__cil_tmp8~1;havoc ~__cil_tmp9~1;havoc ~__cil_tmp10~1;havoc ~__cil_tmp11~1;havoc ~__cil_tmp12~1;havoc ~__cil_tmp13~1;havoc ~__cil_tmp14~1;havoc ~__cil_tmp15~1;~__cil_tmp4~4 := 20;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~__cil_tmp4~4 % 4294967296);~tmp~0.base, ~tmp~0.offset := #t~malloc20.base, #t~malloc20.offset;havoc #t~malloc20.base, #t~malloc20.offset;~node~1.base, ~node~1.offset := ~tmp~0.base, ~tmp~0.offset; {1451#true} is VALID [2022-04-28 09:00:16,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {1451#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1451#true} is VALID [2022-04-28 09:00:16,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {1451#true} call write~int(~value, ~node~1.base, ~node~1.offset, 4);~__cil_tmp5~3 := ~node~1.base + ~node~1.offset;~__cil_tmp6~3 := 4 + ~__cil_tmp5~3;~__cil_tmp7~2.base, ~__cil_tmp7~2.offset := 0, ~__cil_tmp6~3 % 4294967296; {1451#true} is VALID [2022-04-28 09:00:16,346 INFO L272 TraceCheckUtils]: 14: Hoare triple {1451#true} call list_add(~__cil_tmp7~2.base, ~__cil_tmp7~2.offset, ~#gl_list~0.base, ~#gl_list~0.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 09:00:16,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~head.base, ~head.offset, 8);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem17.base, #t~mem17.offset;havoc #t~mem17.base, #t~mem17.offset; {1451#true} is VALID [2022-04-28 09:00:16,347 INFO L272 TraceCheckUtils]: 16: Hoare triple {1451#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 09:00:16,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, ~__cil_tmp5~1 % 4294967296, 8);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 8);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, ~__cil_tmp7~1 % 4294967296, 8);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 8); {1451#true} is VALID [2022-04-28 09:00:16,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,347 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1451#true} {1451#true} #591#return; {1451#true} is VALID [2022-04-28 09:00:16,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,348 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1451#true} {1451#true} #597#return; {1451#true} is VALID [2022-04-28 09:00:16,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {1451#true} assume !false; {1451#true} is VALID [2022-04-28 09:00:16,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {1451#true} ~__cil_tmp8~1 := ~node~1.base + ~node~1.offset;~__cil_tmp9~1 := 12 + ~__cil_tmp8~1;~__cil_tmp10~1 := ~node~1.base + ~node~1.offset;~__cil_tmp11~1 := 12 + ~__cil_tmp10~1;call write~$Pointer$(0, ~__cil_tmp11~1 % 4294967296, 0, ~__cil_tmp9~1 % 4294967296, 8);~__cil_tmp12~1 := ~node~1.base + ~node~1.offset;~__cil_tmp13~1 := 12 + ~__cil_tmp12~1;~__cil_tmp14~1 := ~node~1.base + ~node~1.offset;~__cil_tmp15~1 := 12 + ~__cil_tmp14~1;call write~$Pointer$(0, ~__cil_tmp15~1 % 4294967296, 0, ~__cil_tmp13~1 % 4294967296, 8); {1451#true} is VALID [2022-04-28 09:00:16,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,348 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1451#true} {1451#true} #555#return; {1451#true} is VALID [2022-04-28 09:00:16,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {1451#true} assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___0~0 := #t~nondet22;havoc #t~nondet22; {1451#true} is VALID [2022-04-28 09:00:16,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {1451#true} assume !(0 != ~tmp___0~0); {1451#true} is VALID [2022-04-28 09:00:16,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 09:00:16,349 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1451#true} {1456#(= |~#gl_list~0.base| 5)} #539#return; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 09:00:16,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {1456#(= |~#gl_list~0.base| 5)} ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset := ~#gl_list~0.base, ~#gl_list~0.offset; {1480#(= 5 main_~__cil_tmp1~0.base)} is VALID [2022-04-28 09:00:16,350 INFO L272 TraceCheckUtils]: 31: Hoare triple {1480#(= 5 main_~__cil_tmp1~0.base)} call inspect(~__cil_tmp1~0.base, ~__cil_tmp1~0.offset); {1481#(= |inspect_#in~head.base| 5)} is VALID [2022-04-28 09:00:16,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {1481#(= |inspect_#in~head.base| 5)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~node~0.base, ~node~0.offset;havoc ~__cil_tmp3~0;havoc ~__cil_tmp4~0.base, ~__cil_tmp4~0.offset;havoc ~__cil_tmp5~0;havoc ~__cil_tmp6~0;havoc ~__cil_tmp7~0;havoc ~__cil_tmp8~0;havoc ~__cil_tmp9~0;havoc ~__cil_tmp10~0.base, ~__cil_tmp10~0.offset;havoc ~__cil_tmp11~0;havoc ~__cil_tmp12~0;havoc ~__cil_tmp13~0;havoc ~__cil_tmp14~0;havoc ~__cil_tmp15~0.base, ~__cil_tmp15~0.offset;havoc ~__cil_tmp16~0;havoc ~__cil_tmp17~0.base, ~__cil_tmp17~0.offset;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;havoc ~__cil_tmp20~0;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~0.base, ~__cil_tmp23~0.offset;havoc ~__cil_tmp24~0;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0.base, ~__cil_tmp26~0.offset;havoc ~__cil_tmp27~0;havoc ~__cil_tmp28~0;havoc ~__cil_tmp29~0.base, ~__cil_tmp29~0.offset;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0.base, ~__cil_tmp31~0.offset;havoc ~__cil_tmp32~0.base, ~__cil_tmp32~0.offset;havoc ~__cil_tmp33~0.base, ~__cil_tmp33~0.offset;havoc ~__cil_tmp34~0;havoc ~__cil_tmp35~0;havoc ~__cil_tmp36~0.base, ~__cil_tmp36~0.offset;havoc ~__cil_tmp37~0;havoc ~__cil_tmp38~0;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0.base, ~__cil_tmp40~0.offset;havoc ~__cil_tmp41~0;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;havoc ~__cil_tmp44~0;havoc ~__cil_tmp45~0.base, ~__cil_tmp45~0.offset;havoc ~__cil_tmp46~0;havoc ~__cil_tmp47~0;havoc ~__cil_tmp48~0;havoc ~__cil_tmp49~0;havoc ~__cil_tmp50~0.base, ~__cil_tmp50~0.offset;havoc ~__cil_tmp51~0;havoc ~__cil_tmp52~0;havoc ~__cil_tmp53~0;havoc ~__cil_tmp54~0;havoc ~__cil_tmp55~0.base, ~__cil_tmp55~0.offset;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0.base, ~__cil_tmp59~0.offset;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;havoc ~__cil_tmp62~0;havoc ~__cil_tmp63~0;havoc ~__cil_tmp64~0.base, ~__cil_tmp64~0.offset;havoc ~__cil_tmp65~0;havoc ~__cil_tmp66~0;havoc ~__cil_tmp67~0;havoc ~__cil_tmp68~0;havoc ~__cil_tmp69~0.base, ~__cil_tmp69~0.offset;havoc ~__cil_tmp70~0;havoc ~__cil_tmp71~0;havoc ~__cil_tmp72~0.base, ~__cil_tmp72~0.offset;havoc ~__cil_tmp73~0;havoc ~__cil_tmp74~0;havoc ~__cil_tmp75~0;havoc ~__cil_tmp76~0;havoc ~__cil_tmp77~0;havoc ~__cil_tmp78~0.base, ~__cil_tmp78~0.offset;havoc ~__cil_tmp79~0.base, ~__cil_tmp79~0.offset;havoc ~__cil_tmp80~0;havoc ~__cil_tmp81~0;havoc ~__cil_tmp82~0;havoc ~__cil_tmp83~0.base, ~__cil_tmp83~0.offset;havoc ~__cil_tmp84~0.base, ~__cil_tmp84~0.offset;havoc ~__cil_tmp85~0;havoc ~__cil_tmp86~0;havoc ~__cil_tmp87~0;havoc ~__cil_tmp88~0;havoc ~__cil_tmp89~0;havoc ~__cil_tmp90~0.base, ~__cil_tmp90~0.offset;havoc ~__cil_tmp91~0;havoc ~__cil_tmp92~0;havoc ~__cil_tmp93~0.base, ~__cil_tmp93~0.offset;havoc ~__cil_tmp94~0;havoc ~__cil_tmp95~0;havoc ~__cil_tmp96~0;havoc ~__cil_tmp97~0;havoc ~__cil_tmp98~0;havoc ~__cil_tmp99~0;havoc ~__cil_tmp100~0.base, ~__cil_tmp100~0.offset;havoc ~__cil_tmp101~0.base, ~__cil_tmp101~0.offset;havoc ~__cil_tmp102~0;havoc ~__cil_tmp103~0;havoc ~__cil_tmp104~0;havoc ~__cil_tmp105~0.base, ~__cil_tmp105~0.offset;havoc ~__cil_tmp106~0;havoc ~__cil_tmp107~0;havoc ~__cil_tmp108~0;havoc ~__cil_tmp109~0.base, ~__cil_tmp109~0.offset;havoc ~__cil_tmp110~0;havoc ~__cil_tmp111~0.base, ~__cil_tmp111~0.offset;havoc ~__cil_tmp112~0;havoc ~__cil_tmp113~0.base, ~__cil_tmp113~0.offset;havoc ~__cil_tmp114~0;havoc ~__cil_tmp115~0;havoc ~__cil_tmp116~0.base, ~__cil_tmp116~0.offset;havoc ~__cil_tmp117~0;havoc ~__cil_tmp118~0.base, ~__cil_tmp118~0.offset;havoc ~__cil_tmp119~0.base, ~__cil_tmp119~0.offset;havoc ~__cil_tmp120~0.base, ~__cil_tmp120~0.offset;havoc ~__cil_tmp121~0;havoc ~__cil_tmp122~0; {1482#(= 5 inspect_~head.base)} is VALID [2022-04-28 09:00:16,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {1482#(= 5 inspect_~head.base)} assume !false; {1482#(= 5 inspect_~head.base)} is VALID [2022-04-28 09:00:16,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {1482#(= 5 inspect_~head.base)} assume ~head.base == 0 && ~head.offset == 0; {1452#false} is VALID [2022-04-28 09:00:16,351 INFO L272 TraceCheckUtils]: 35: Hoare triple {1452#false} call fail(); {1452#false} is VALID [2022-04-28 09:00:16,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {1452#false} assume !false; {1452#false} is VALID [2022-04-28 09:00:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:16,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179409428] [2022-04-28 09:00:16,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179409428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:16,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:16,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:00:16,353 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:16,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [544572531] [2022-04-28 09:00:16,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [544572531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:16,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:16,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:00:16,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007745860] [2022-04-28 09:00:16,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:16,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-28 09:00:16,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:16,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 09:00:16,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:16,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:00:16,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:16,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:00:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:00:16,381 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 09:00:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:18,813 INFO L93 Difference]: Finished difference Result 241 states and 289 transitions. [2022-04-28 09:00:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:00:18,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-28 09:00:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 09:00:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 289 transitions. [2022-04-28 09:00:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 09:00:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 289 transitions. [2022-04-28 09:00:18,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 289 transitions. [2022-04-28 09:00:19,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:19,249 INFO L225 Difference]: With dead ends: 241 [2022-04-28 09:00:19,250 INFO L226 Difference]: Without dead ends: 236 [2022-04-28 09:00:19,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:00:19,251 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 668 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:19,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 134 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 09:00:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-04-28 09:00:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 199. [2022-04-28 09:00:19,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:19,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 09:00:19,308 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 09:00:19,308 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 09:00:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:19,321 INFO L93 Difference]: Finished difference Result 236 states and 284 transitions. [2022-04-28 09:00:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 284 transitions. [2022-04-28 09:00:19,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:19,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:19,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 236 states. [2022-04-28 09:00:19,323 INFO L87 Difference]: Start difference. First operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 236 states. [2022-04-28 09:00:19,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:19,337 INFO L93 Difference]: Finished difference Result 236 states and 284 transitions. [2022-04-28 09:00:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 284 transitions. [2022-04-28 09:00:19,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:19,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:19,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:19,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 09:00:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 238 transitions. [2022-04-28 09:00:19,355 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 238 transitions. Word has length 37 [2022-04-28 09:00:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:19,356 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 238 transitions. [2022-04-28 09:00:19,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 09:00:19,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 238 transitions. [2022-04-28 09:00:19,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 238 transitions. [2022-04-28 09:00:19,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 09:00:19,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:19,577 INFO L195 NwaCegarLoop]: 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] [2022-04-28 09:00:19,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:00:19,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:19,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1799360915, now seen corresponding path program 1 times [2022-04-28 09:00:19,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:19,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [967511231] [2022-04-28 09:00:19,579 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:19,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1799360915, now seen corresponding path program 2 times [2022-04-28 09:00:19,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:19,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391435951] [2022-04-28 09:00:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:19,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:00:19,722 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 09:00:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:00:19,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 09:00:19,892 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 09:00:19,892 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 09:00:19,894 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:00:19,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 09:00:19,906 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 09:00:19,909 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:00:19,947 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:00:19,947 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:00:19,947 WARN L170 areAnnotationChecker]: __list_addENTRY has no Hoare annotation [2022-04-28 09:00:19,947 WARN L170 areAnnotationChecker]: val_from_nodeENTRY has no Hoare annotation [2022-04-28 09:00:19,947 WARN L170 areAnnotationChecker]: gl_sort_passENTRY has no Hoare annotation [2022-04-28 09:00:19,947 WARN L170 areAnnotationChecker]: gl_sortENTRY has no Hoare annotation [2022-04-28 09:00:19,948 WARN L170 areAnnotationChecker]: __list_delENTRY has no Hoare annotation [2022-04-28 09:00:19,948 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 09:00:19,948 WARN L170 areAnnotationChecker]: gl_readENTRY has no Hoare annotation [2022-04-28 09:00:19,949 WARN L170 areAnnotationChecker]: gl_destroyENTRY has no Hoare annotation [2022-04-28 09:00:19,949 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 09:00:19,950 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 09:00:19,950 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 09:00:19,950 WARN L170 areAnnotationChecker]: list_moveENTRY has no Hoare annotation [2022-04-28 09:00:19,950 WARN L170 areAnnotationChecker]: inspectENTRY has no Hoare annotation [2022-04-28 09:00:19,950 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:00:19,950 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:00:19,950 WARN L170 areAnnotationChecker]: list_addENTRY has no Hoare annotation [2022-04-28 09:00:19,950 WARN L170 areAnnotationChecker]: gl_insertENTRY has no Hoare annotation [2022-04-28 09:00:19,950 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:00:19,950 WARN L170 areAnnotationChecker]: __list_addFINAL has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: val_from_nodeFINAL has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L807-1 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L807-1 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L807-1 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L824-1 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L824-1 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L824-1 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: __list_delFINAL has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L839 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L839 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L687-1 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L687-1 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L687-1 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L714-2 has no Hoare annotation [2022-04-28 09:00:19,951 WARN L170 areAnnotationChecker]: L714-2 has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: L714-2 has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: L615 has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: L615 has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: L179loopEntry has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: L179loopEntry has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: L179loopEntry has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2022-04-28 09:00:19,952 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: L642 has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: L642 has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: __list_addEXIT has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: val_from_nodeEXIT has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: val_from_nodeEXIT has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: L810 has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: L829 has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: L820 has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: L820 has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: __list_delEXIT has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: L839-1 has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: L692 has no Hoare annotation [2022-04-28 09:00:19,953 WARN L170 areAnnotationChecker]: L681 has no Hoare annotation [2022-04-28 09:00:19,955 WARN L170 areAnnotationChecker]: L741 has no Hoare annotation [2022-04-28 09:00:19,955 WARN L170 areAnnotationChecker]: L715 has no Hoare annotation [2022-04-28 09:00:19,955 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 09:00:19,955 WARN L170 areAnnotationChecker]: L615-1 has no Hoare annotation [2022-04-28 09:00:19,955 WARN L170 areAnnotationChecker]: L615-1 has no Hoare annotation [2022-04-28 09:00:19,955 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-28 09:00:19,955 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-28 09:00:19,955 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: list_addFINAL has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L642-2 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L795 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L797-1 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: gl_sort_passFINAL has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L789 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L789 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: gl_sortEXIT has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L822 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L841 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L841 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: gl_readEXIT has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L684 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: L684 has no Hoare annotation [2022-04-28 09:00:19,956 WARN L170 areAnnotationChecker]: gl_destroyEXIT has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L721 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L721 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: list_moveFINAL has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L193 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L653 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L653 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L797 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L797 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L800 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: L800 has no Hoare annotation [2022-04-28 09:00:19,957 WARN L170 areAnnotationChecker]: gl_sort_passEXIT has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L789-1 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L789-1 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L842 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L841-1 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L841-1 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L684-1 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L845 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L721-1 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: list_moveEXIT has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L653-1 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L653-1 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L653-1 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L807 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L807 has no Hoare annotation [2022-04-28 09:00:19,958 WARN L170 areAnnotationChecker]: L844 has no Hoare annotation [2022-04-28 09:00:19,959 WARN L170 areAnnotationChecker]: L844 has no Hoare annotation [2022-04-28 09:00:19,959 WARN L170 areAnnotationChecker]: L687 has no Hoare annotation [2022-04-28 09:00:19,959 WARN L170 areAnnotationChecker]: L687 has no Hoare annotation [2022-04-28 09:00:19,959 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 09:00:19,959 WARN L170 areAnnotationChecker]: L236loopEntry has no Hoare annotation [2022-04-28 09:00:19,959 WARN L170 areAnnotationChecker]: L236loopEntry has no Hoare annotation [2022-04-28 09:00:19,959 WARN L170 areAnnotationChecker]: L236loopEntry has no Hoare annotation [2022-04-28 09:00:19,959 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-04-28 09:00:19,959 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-04-28 09:00:19,959 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-04-28 09:00:19,976 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-04-28 09:00:19,976 WARN L170 areAnnotationChecker]: L670 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L657 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L844-1 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L844-1 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L237 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L237 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: gl_insertEXIT has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-28 09:00:19,977 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L269 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L298loopEntry has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L298loopEntry has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L298loopEntry has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L277 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L277 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L258 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L258 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L299 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L299 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L279 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L279 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-28 09:00:19,978 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L312 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L357 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L357 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L357 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L336 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L323 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L323 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L381 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L381 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L381 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2022-04-28 09:00:19,979 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L425 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L425 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L425 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L410 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L397 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L397 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L447 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L447 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L447 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L429 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L416 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L416 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L399 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L399 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L467 has no Hoare annotation [2022-04-28 09:00:19,980 WARN L170 areAnnotationChecker]: L467 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L467 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L451 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L438 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L438 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L418 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L418 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L471 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L458 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L458 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L495 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L482 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L482 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L460 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L460 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L519-2 has no Hoare annotation [2022-04-28 09:00:19,981 WARN L170 areAnnotationChecker]: L519-2 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L519-2 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L505 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L505 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L484 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L484 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L520 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L507 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L507 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L561 has no Hoare annotation [2022-04-28 09:00:19,982 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2022-04-28 09:00:19,983 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2022-04-28 09:00:19,983 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2022-04-28 09:00:19,983 WARN L170 areAnnotationChecker]: inspectEXIT has no Hoare annotation [2022-04-28 09:00:19,983 WARN L170 areAnnotationChecker]: inspectEXIT has no Hoare annotation [2022-04-28 09:00:19,983 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2022-04-28 09:00:19,983 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2022-04-28 09:00:19,983 WARN L170 areAnnotationChecker]: L527-1 has no Hoare annotation [2022-04-28 09:00:19,983 WARN L170 areAnnotationChecker]: L554 has no Hoare annotation [2022-04-28 09:00:19,983 WARN L170 areAnnotationChecker]: L554 has no Hoare annotation [2022-04-28 09:00:19,984 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:00:19,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:00:19 BoogieIcfgContainer [2022-04-28 09:00:19,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:00:19,987 INFO L158 Benchmark]: Toolchain (without parser) took 8946.18ms. Allocated memory was 191.9MB in the beginning and 370.1MB in the end (delta: 178.3MB). Free memory was 138.7MB in the beginning and 165.6MB in the end (delta: -27.0MB). Peak memory consumption was 152.1MB. Max. memory is 8.0GB. [2022-04-28 09:00:19,990 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:00:19,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.12ms. Allocated memory was 191.9MB in the beginning and 288.4MB in the end (delta: 96.5MB). Free memory was 138.5MB in the beginning and 248.5MB in the end (delta: -110.0MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-28 09:00:19,993 INFO L158 Benchmark]: Boogie Preprocessor took 168.64ms. Allocated memory is still 288.4MB. Free memory was 248.5MB in the beginning and 243.8MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-04-28 09:00:19,993 INFO L158 Benchmark]: RCFGBuilder took 1059.19ms. Allocated memory is still 288.4MB. Free memory was 243.3MB in the beginning and 206.6MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-04-28 09:00:19,993 INFO L158 Benchmark]: TraceAbstraction took 7136.19ms. Allocated memory was 288.4MB in the beginning and 370.1MB in the end (delta: 81.8MB). Free memory was 206.0MB in the beginning and 165.6MB in the end (delta: 40.4MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. [2022-04-28 09:00:19,994 INFO L339 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.12ms. Allocated memory is still 191.9MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 578.12ms. Allocated memory was 191.9MB in the beginning and 288.4MB in the end (delta: 96.5MB). Free memory was 138.5MB in the beginning and 248.5MB in the end (delta: -110.0MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 168.64ms. Allocated memory is still 288.4MB. Free memory was 248.5MB in the beginning and 243.8MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1059.19ms. Allocated memory is still 288.4MB. Free memory was 243.3MB in the beginning and 206.6MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7136.19ms. Allocated memory was 288.4MB in the beginning and 370.1MB in the end (delta: 81.8MB). Free memory was 206.0MB in the beginning and 165.6MB in the end (delta: 40.4MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 46]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L835] struct list_head const *__cil_tmp1 ; [L836] struct list_head const *__cil_tmp2 ; [L839] CALL gl_read() [L676] int tmp ; [L677] int tmp___0 ; [L680] COND TRUE 1 [L683] tmp = __VERIFIER_nondet_int() [L684] CALL gl_insert(tmp) [L622] struct node *node ; [L623] void *tmp ; [L624] unsigned int __cil_tmp4 ; [L625] unsigned int __cil_tmp5 ; [L626] unsigned int __cil_tmp6 ; [L627] struct list_head *__cil_tmp7 ; [L628] unsigned int __cil_tmp8 ; [L629] unsigned int __cil_tmp9 ; [L630] unsigned int __cil_tmp10 ; [L631] unsigned int __cil_tmp11 ; [L632] unsigned int __cil_tmp12 ; [L633] unsigned int __cil_tmp13 ; [L634] unsigned int __cil_tmp14 ; [L635] unsigned int __cil_tmp15 ; [L638] __cil_tmp4 = (unsigned int )20UL [L639] tmp = malloc(__cil_tmp4) [L640] node = (struct node *)tmp [L642] COND FALSE !(! node) [L649] *((int *)node) = value [L650] __cil_tmp5 = (unsigned int )node [L651] __cil_tmp6 = __cil_tmp5 + 4 [L652] __cil_tmp7 = (struct list_head *)__cil_tmp6 [L653] CALL list_add(__cil_tmp7, & gl_list) [L595] struct list_head *__cil_tmp3 ; [L598] EXPR \read(*head) [L598] __cil_tmp3 = *((struct list_head **)head) [L599] CALL __list_add(new, head, __cil_tmp3) [L567] unsigned int __cil_tmp4 ; [L568] unsigned int __cil_tmp5 ; [L569] unsigned int __cil_tmp6 ; [L570] unsigned int __cil_tmp7 ; [L572] __cil_tmp4 = (unsigned int )next [L573] __cil_tmp5 = __cil_tmp4 + 4 [L574] *((struct list_head **)__cil_tmp5) = new [L575] *((struct list_head **)new) = next [L576] __cil_tmp6 = (unsigned int )new [L577] __cil_tmp7 = __cil_tmp6 + 4 [L578] *((struct list_head **)__cil_tmp7) = prev [L579] *((struct list_head **)prev) = new [L599] RET __list_add(new, head, __cil_tmp3) [L653] RET list_add(__cil_tmp7, & gl_list) [L656] COND TRUE 1 [L658] __cil_tmp8 = (unsigned int )node [L659] __cil_tmp9 = __cil_tmp8 + 12 [L660] __cil_tmp10 = (unsigned int )node [L661] __cil_tmp11 = __cil_tmp10 + 12 [L662] *((struct list_head **)__cil_tmp9) = (struct list_head *)__cil_tmp11 [L663] __cil_tmp12 = (unsigned int )node [L664] __cil_tmp13 = __cil_tmp12 + 12 [L665] __cil_tmp14 = (unsigned int )node [L666] __cil_tmp15 = __cil_tmp14 + 12 [L667] *((struct list_head **)__cil_tmp13) = (struct list_head *)__cil_tmp15 [L684] RET gl_insert(tmp) [L685] tmp___0 = __VERIFIER_nondet_int() [L687] COND FALSE !(\read(tmp___0)) [L839] RET gl_read() [L840] __cil_tmp1 = (struct list_head const *)(& gl_list) [L841] CALL inspect(__cil_tmp1) [L55] struct node const *node ; [L56] unsigned int __cil_tmp3 ; [L57] struct list_head *__cil_tmp4 ; [L58] unsigned int __cil_tmp5 ; [L59] int __cil_tmp6 ; [L60] unsigned int __cil_tmp7 ; [L61] unsigned int __cil_tmp8 ; [L62] unsigned int __cil_tmp9 ; [L63] struct list_head *__cil_tmp10 ; [L64] unsigned int __cil_tmp11 ; [L65] int __cil_tmp12 ; [L66] unsigned int __cil_tmp13 ; [L67] unsigned int __cil_tmp14 ; [L68] struct list_head *__cil_tmp15 ; [L69] unsigned int __cil_tmp16 ; [L70] struct list_head *__cil_tmp17 ; [L71] unsigned int __cil_tmp18 ; [L72] int __cil_tmp19 ; [L73] unsigned int __cil_tmp20 ; [L74] unsigned int __cil_tmp21 ; [L75] unsigned int __cil_tmp22 ; [L76] struct list_head *__cil_tmp23 ; [L77] unsigned int __cil_tmp24 ; [L78] int __cil_tmp25 ; [L79] struct node *__cil_tmp26 ; [L80] unsigned int __cil_tmp27 ; [L81] unsigned int __cil_tmp28 ; [L82] struct list_head *__cil_tmp29 ; [L83] unsigned long __cil_tmp30 ; [L84] char *__cil_tmp31 ; [L85] char *__cil_tmp32 ; [L86] struct node *__cil_tmp33 ; [L87] unsigned int __cil_tmp34 ; [L88] unsigned int __cil_tmp35 ; [L89] struct list_head const *__cil_tmp36 ; [L90] unsigned int __cil_tmp37 ; [L91] unsigned int __cil_tmp38 ; [L92] unsigned int __cil_tmp39 ; [L93] struct list_head *__cil_tmp40 ; [L94] unsigned int __cil_tmp41 ; [L95] int __cil_tmp42 ; [L96] unsigned int __cil_tmp43 ; [L97] unsigned int __cil_tmp44 ; [L98] struct list_head const *__cil_tmp45 ; [L99] unsigned int __cil_tmp46 ; [L100] unsigned int __cil_tmp47 ; [L101] unsigned int __cil_tmp48 ; [L102] unsigned int __cil_tmp49 ; [L103] struct list_head *__cil_tmp50 ; [L104] unsigned int __cil_tmp51 ; [L105] int __cil_tmp52 ; [L106] unsigned int __cil_tmp53 ; [L107] unsigned int __cil_tmp54 ; [L108] struct list_head const *__cil_tmp55 ; [L109] unsigned int __cil_tmp56 ; [L110] unsigned int __cil_tmp57 ; [L111] unsigned int __cil_tmp58 ; [L112] struct list_head *__cil_tmp59 ; [L113] unsigned int __cil_tmp60 ; [L114] int __cil_tmp61 ; [L115] unsigned int __cil_tmp62 ; [L116] unsigned int __cil_tmp63 ; [L117] struct list_head const *__cil_tmp64 ; [L118] unsigned int __cil_tmp65 ; [L119] unsigned int __cil_tmp66 ; [L120] unsigned int __cil_tmp67 ; [L121] unsigned int __cil_tmp68 ; [L122] struct list_head *__cil_tmp69 ; [L123] unsigned int __cil_tmp70 ; [L124] int __cil_tmp71 ; [L125] struct node const *__cil_tmp72 ; [L126] unsigned int __cil_tmp73 ; [L127] unsigned int __cil_tmp74 ; [L128] int __cil_tmp75 ; [L129] unsigned int __cil_tmp76 ; [L130] unsigned int __cil_tmp77 ; [L131] struct list_head const *__cil_tmp78 ; [L132] struct node const *__cil_tmp79 ; [L133] unsigned int __cil_tmp80 ; [L134] unsigned int __cil_tmp81 ; [L135] int __cil_tmp82 ; [L136] int const *__cil_tmp83 ; [L137] struct node const *__cil_tmp84 ; [L138] unsigned int __cil_tmp85 ; [L139] unsigned int __cil_tmp86 ; [L140] int __cil_tmp87 ; [L141] unsigned int __cil_tmp88 ; [L142] unsigned int __cil_tmp89 ; [L143] struct list_head *__cil_tmp90 ; [L144] unsigned int __cil_tmp91 ; [L145] unsigned int __cil_tmp92 ; [L146] struct list_head *__cil_tmp93 ; [L147] unsigned int __cil_tmp94 ; [L148] unsigned int __cil_tmp95 ; [L149] int __cil_tmp96 ; [L150] unsigned int __cil_tmp97 ; [L151] unsigned int __cil_tmp98 ; [L152] unsigned int __cil_tmp99 ; [L153] struct list_head *__cil_tmp100 ; [L154] struct list_head *__cil_tmp101 ; [L155] unsigned int __cil_tmp102 ; [L156] unsigned int __cil_tmp103 ; [L157] int __cil_tmp104 ; [L158] struct list_head *__cil_tmp105 ; [L159] unsigned int __cil_tmp106 ; [L160] unsigned int __cil_tmp107 ; [L161] unsigned int __cil_tmp108 ; [L162] struct list_head const *__cil_tmp109 ; [L163] unsigned int __cil_tmp110 ; [L164] struct list_head *__cil_tmp111 ; [L165] unsigned int __cil_tmp112 ; [L166] struct node *__cil_tmp113 ; [L167] unsigned int __cil_tmp114 ; [L168] unsigned int __cil_tmp115 ; [L169] struct list_head *__cil_tmp116 ; [L170] unsigned long __cil_tmp117 ; [L171] char *__cil_tmp118 ; [L172] char *__cil_tmp119 ; [L173] struct node *__cil_tmp120 ; [L174] unsigned int __cil_tmp121 ; [L175] int __cil_tmp122 ; [L179] COND TRUE 1 [L181] COND FALSE !(! head) [L192] COND TRUE 1 [L195] __cil_tmp3 = (unsigned int )head [L196] EXPR \read(*head) [L196] __cil_tmp4 = *((struct list_head * const *)head) [L197] __cil_tmp5 = (unsigned int )__cil_tmp4 [L198] __cil_tmp6 = __cil_tmp5 != __cil_tmp3 [L199] COND TRUE ! __cil_tmp6 [L201] CALL fail() [L46] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 160 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 937 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 923 mSDsluCounter, 276 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 760 IncrementalHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 267 mSDtfsCounter, 760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 2 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 09:00:20,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...