/usr/bin/java -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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/loops/bubble_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:09:16,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:09:16,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:09:16,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:09:16,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:09:16,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:09:16,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:09:16,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:09:16,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:09:16,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:09:16,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:09:16,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:09:16,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:09:16,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:09:16,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:09:16,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:09:16,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:09:16,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:09:16,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:09:16,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:09:16,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:09:16,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:09:16,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:09:16,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:09:16,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:09:16,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:09:16,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:09:16,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:09:16,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:09:16,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:09:16,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:09:16,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:09:16,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:09:16,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:09:16,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:09:16,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:09:16,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:09:16,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:09:16,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:09:16,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:09:16,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:09:16,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 20:09:16,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:09:16,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:09:16,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:09:16,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:09:16,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:09:16,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:09:16,264 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:09:16,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:09:16,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:09:16,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:09:16,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:09:16,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:09:16,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:09:16,266 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:09:16,266 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:09:16,266 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:09:16,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:09:16,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:09:16,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:09:16,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:09:16,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:09:16,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:09:16,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:09:16,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:09:16,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:09:16,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:09:16,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:09:16,269 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:09:16,269 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:09:16,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:09:16,269 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:09:16,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:09:16,271 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:09:16,271 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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-01-10 20:09:16,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:09:16,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:09:16,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:09:16,554 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:09:16,555 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:09:16,555 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-01-10 20:09:16,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2482252/321b8f956e434fe88560207778a375fb/FLAG3ae08e826 [2022-01-10 20:09:17,098 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:09:17,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i [2022-01-10 20:09:17,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2482252/321b8f956e434fe88560207778a375fb/FLAG3ae08e826 [2022-01-10 20:09:17,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2482252/321b8f956e434fe88560207778a375fb [2022-01-10 20:09:17,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:09:17,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:09:17,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:09:17,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:09:17,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:09:17,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:17,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a7622e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17, skipping insertion in model container [2022-01-10 20:09:17,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:17,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:09:17,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:09:17,662 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-01-10 20:09:17,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:09:17,763 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 20:09:17,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:09:17,777 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-01-10 20:09:17,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:09:17,829 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:09:17,840 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-01-10 20:09:17,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:09:17,926 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:09:17,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17 WrapperNode [2022-01-10 20:09:17,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:09:17,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:09:17,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:09:17,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:09:17,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:17,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:18,006 INFO L137 Inliner]: procedures = 34, calls = 79, calls flagged for inlining = 33, calls inlined = 51, statements flattened = 1384 [2022-01-10 20:09:18,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:09:18,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:09:18,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:09:18,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:09:18,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:18,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:18,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:18,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:18,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:18,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:18,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:18,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:09:18,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:09:18,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:09:18,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:09:18,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (1/1) ... [2022-01-10 20:09:18,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:09:18,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:09:18,120 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-01-10 20:09:18,122 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-01-10 20:09:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 20:09:18,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:09:18,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:09:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 20:09:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 20:09:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 20:09:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 20:09:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:09:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:09:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 20:09:18,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 20:09:18,397 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:09:18,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:09:19,282 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:09:19,289 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:09:19,290 INFO L299 CfgBuilder]: Removed 41 assume(true) statements. [2022-01-10 20:09:19,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:09:19 BoogieIcfgContainer [2022-01-10 20:09:19,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:09:19,292 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:09:19,293 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:09:19,294 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:09:19,296 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:09:19" (1/1) ... [2022-01-10 20:09:19,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:09:19 BasicIcfg [2022-01-10 20:09:19,469 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:09:19,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:09:19,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:09:19,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:09:19,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:09:17" (1/4) ... [2022-01-10 20:09:19,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e773a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:09:19, skipping insertion in model container [2022-01-10 20:09:19,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:17" (2/4) ... [2022-01-10 20:09:19,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e773a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:09:19, skipping insertion in model container [2022-01-10 20:09:19,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:09:19" (3/4) ... [2022-01-10 20:09:19,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e773a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:09:19, skipping insertion in model container [2022-01-10 20:09:19,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:09:19" (4/4) ... [2022-01-10 20:09:19,476 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort-2.iTransformedIcfg [2022-01-10 20:09:19,480 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:09:19,480 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-01-10 20:09:19,518 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:09:19,526 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:09:19,526 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-01-10 20:09:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 183 states have (on average 1.8633879781420766) internal successors, (341), 217 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-10 20:09:19,551 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:19,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:19,552 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-10 20:09:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1464937561, now seen corresponding path program 1 times [2022-01-10 20:09:19,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:19,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444941380] [2022-01-10 20:09:19,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:19,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:19,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:19,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444941380] [2022-01-10 20:09:19,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444941380] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:19,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:19,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:09:19,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256925593] [2022-01-10 20:09:19,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:19,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 20:09:19,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:19,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 20:09:19,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 20:09:19,796 INFO L87 Difference]: Start difference. First operand has 218 states, 183 states have (on average 1.8633879781420766) internal successors, (341), 217 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:19,855 INFO L93 Difference]: Finished difference Result 434 states and 680 transitions. [2022-01-10 20:09:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 20:09:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-01-10 20:09:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:19,866 INFO L225 Difference]: With dead ends: 434 [2022-01-10 20:09:19,866 INFO L226 Difference]: Without dead ends: 209 [2022-01-10 20:09:19,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 20:09:19,872 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:19,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-01-10 20:09:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-01-10 20:09:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 175 states have (on average 1.2228571428571429) internal successors, (214), 208 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 214 transitions. [2022-01-10 20:09:19,927 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 214 transitions. Word has length 7 [2022-01-10 20:09:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:19,927 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 214 transitions. [2022-01-10 20:09:19,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 214 transitions. [2022-01-10 20:09:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 20:09:19,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:19,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:19,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:09:19,929 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-10 20:09:19,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:19,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1949978572, now seen corresponding path program 1 times [2022-01-10 20:09:19,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:19,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291479092] [2022-01-10 20:09:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:19,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:20,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:20,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291479092] [2022-01-10 20:09:20,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291479092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:20,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:20,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:09:20,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652575216] [2022-01-10 20:09:20,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:20,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:09:20,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:09:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:09:20,315 INFO L87 Difference]: Start difference. First operand 209 states and 214 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:23,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:26,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:28,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:30,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:32,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:34,586 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:36,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:38,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:40,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:43,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:45,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:47,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 20:09:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:47,320 INFO L93 Difference]: Finished difference Result 213 states and 218 transitions. [2022-01-10 20:09:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 20:09:47,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 20:09:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:47,410 INFO L225 Difference]: With dead ends: 213 [2022-01-10 20:09:47,410 INFO L226 Difference]: Without dead ends: 211 [2022-01-10 20:09:47,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:09:47,411 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 15 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:47,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 584 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 12 Unknown, 0 Unchecked, 27.0s Time] [2022-01-10 20:09:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-10 20:09:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2022-01-10 20:09:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.2183908045977012) internal successors, (212), 206 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 212 transitions. [2022-01-10 20:09:47,423 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 212 transitions. Word has length 16 [2022-01-10 20:09:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:47,429 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 212 transitions. [2022-01-10 20:09:47,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 212 transitions. [2022-01-10 20:09:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 20:09:47,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:47,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:47,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:09:47,431 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-01-10 20:09:47,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:47,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1914366585, now seen corresponding path program 1 times [2022-01-10 20:09:47,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:47,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58378977] [2022-01-10 20:09:47,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:47,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:09:47,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 20:09:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:09:48,092 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 20:09:48,093 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 20:09:48,093 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (33 of 34 remaining) [2022-01-10 20:09:48,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (32 of 34 remaining) [2022-01-10 20:09:48,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (31 of 34 remaining) [2022-01-10 20:09:48,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (30 of 34 remaining) [2022-01-10 20:09:48,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (29 of 34 remaining) [2022-01-10 20:09:48,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (28 of 34 remaining) [2022-01-10 20:09:48,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (27 of 34 remaining) [2022-01-10 20:09:48,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (26 of 34 remaining) [2022-01-10 20:09:48,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (25 of 34 remaining) [2022-01-10 20:09:48,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (24 of 34 remaining) [2022-01-10 20:09:48,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (23 of 34 remaining) [2022-01-10 20:09:48,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (22 of 34 remaining) [2022-01-10 20:09:48,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (21 of 34 remaining) [2022-01-10 20:09:48,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (20 of 34 remaining) [2022-01-10 20:09:48,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (19 of 34 remaining) [2022-01-10 20:09:48,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (18 of 34 remaining) [2022-01-10 20:09:48,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (17 of 34 remaining) [2022-01-10 20:09:48,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (16 of 34 remaining) [2022-01-10 20:09:48,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (15 of 34 remaining) [2022-01-10 20:09:48,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (14 of 34 remaining) [2022-01-10 20:09:48,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (13 of 34 remaining) [2022-01-10 20:09:48,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (12 of 34 remaining) [2022-01-10 20:09:48,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (11 of 34 remaining) [2022-01-10 20:09:48,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (10 of 34 remaining) [2022-01-10 20:09:48,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (9 of 34 remaining) [2022-01-10 20:09:48,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (8 of 34 remaining) [2022-01-10 20:09:48,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (7 of 34 remaining) [2022-01-10 20:09:48,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (6 of 34 remaining) [2022-01-10 20:09:48,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (5 of 34 remaining) [2022-01-10 20:09:48,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (4 of 34 remaining) [2022-01-10 20:09:48,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (3 of 34 remaining) [2022-01-10 20:09:48,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (2 of 34 remaining) [2022-01-10 20:09:48,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (1 of 34 remaining) [2022-01-10 20:09:48,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (0 of 34 remaining) [2022-01-10 20:09:48,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:09:48,113 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-01-10 20:09:48,115 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:09:48,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:09:48 BasicIcfg [2022-01-10 20:09:48,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:09:48,277 INFO L158 Benchmark]: Toolchain (without parser) took 30837.09ms. Allocated memory was 178.3MB in the beginning and 243.3MB in the end (delta: 65.0MB). Free memory was 118.9MB in the beginning and 145.1MB in the end (delta: -26.2MB). Peak memory consumption was 112.8MB. Max. memory is 8.0GB. [2022-01-10 20:09:48,277 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:09:48,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.25ms. Allocated memory was 178.3MB in the beginning and 243.3MB in the end (delta: 65.0MB). Free memory was 118.8MB in the beginning and 199.9MB in the end (delta: -81.1MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-01-10 20:09:48,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.41ms. Allocated memory is still 243.3MB. Free memory was 199.9MB in the beginning and 194.2MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 20:09:48,279 INFO L158 Benchmark]: Boogie Preprocessor took 67.32ms. Allocated memory is still 243.3MB. Free memory was 194.2MB in the beginning and 188.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 20:09:48,280 INFO L158 Benchmark]: RCFGBuilder took 1216.01ms. Allocated memory is still 243.3MB. Free memory was 188.4MB in the beginning and 141.2MB in the end (delta: 47.1MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2022-01-10 20:09:48,281 INFO L158 Benchmark]: IcfgTransformer took 177.06ms. Allocated memory is still 243.3MB. Free memory was 141.2MB in the beginning and 119.2MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-01-10 20:09:48,283 INFO L158 Benchmark]: TraceAbstraction took 28805.00ms. Allocated memory is still 243.3MB. Free memory was 118.7MB in the beginning and 145.1MB in the end (delta: -26.4MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. [2022-01-10 20:09:48,286 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.25ms. Allocated memory was 178.3MB in the beginning and 243.3MB in the end (delta: 65.0MB). Free memory was 118.8MB in the beginning and 199.9MB in the end (delta: -81.1MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.41ms. Allocated memory is still 243.3MB. Free memory was 199.9MB in the beginning and 194.2MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.32ms. Allocated memory is still 243.3MB. Free memory was 194.2MB in the beginning and 188.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1216.01ms. Allocated memory is still 243.3MB. Free memory was 188.4MB in the beginning and 141.2MB in the end (delta: 47.1MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. * IcfgTransformer took 177.06ms. Allocated memory is still 243.3MB. Free memory was 141.2MB in the beginning and 119.2MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 28805.00ms. Allocated memory is still 243.3MB. Free memory was 118.7MB in the beginning and 145.1MB in the end (delta: -26.4MB). Peak memory consumption was 48.0MB. 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}; VAL [gl_list={-3:0}] [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 ; VAL [gl_list={-3:0}] [L680] COND TRUE 1 VAL [gl_list={-3:0}] [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 VAL [\old(value)=101322258, __cil_tmp4=20, gl_list={-3:0}, node={-4294967295:0}, tmp={-4294967295:0}, value=101322258] [L642] COND FALSE !(! node) VAL [\old(value)=101322258, __cil_tmp4=20, gl_list={-3:0}, node={-4294967295:0}, tmp={-4294967295:0}, value=101322258] [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 VAL [__cil_tmp4=5, __cil_tmp5=9, __cil_tmp6=5, __cil_tmp7=9, gl_list={-3:0}, new={0:-3}, new={0:-3}, next={-3:0}, next={-3:0}, prev={-3:0}, prev={-3:0}] [L599] RET __list_add(new, head, __cil_tmp3) [L653] RET list_add(__cil_tmp7, & gl_list) [L656] COND TRUE 1 VAL [\old(value)=101322258, __cil_tmp4=20, __cil_tmp5=1, __cil_tmp6=5, __cil_tmp7={0:-3}, gl_list={-3:0}, node={-4294967295:0}, tmp={-4294967295:0}, value=101322258] [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 VAL [\old(value)=101322258, __cil_tmp10=1, __cil_tmp11=13, __cil_tmp12=1, __cil_tmp13=13, __cil_tmp14=1, __cil_tmp15=13, __cil_tmp4=20, __cil_tmp5=1, __cil_tmp6=5, __cil_tmp7={0:-3}, __cil_tmp8=1, __cil_tmp9=13, gl_list={-3:0}, node={-4294967295:0}, tmp={-4294967295:0}, value=101322258] [L684] RET gl_insert(tmp) [L685] tmp___0 = __VERIFIER_nondet_int() [L687] COND FALSE !(\read(tmp___0)) VAL [gl_list={-3:0}, tmp=101322258, tmp___0=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 ; VAL [gl_list={-3:0}, head={-3:0}, head={-3:0}] [L179] COND TRUE 1 VAL [gl_list={-3:0}, head={-3:0}, head={-3:0}] [L181] COND FALSE !(! head) VAL [gl_list={-3:0}, head={-3:0}, head={-3:0}] [L192] COND TRUE 1 VAL [gl_list={-3:0}, head={-3:0}, head={-3:0}] [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 VAL [__cil_tmp3=5, __cil_tmp4={0:-3}, __cil_tmp5=5, __cil_tmp6=0, gl_list={-3:0}, head={-3:0}, head={-3:0}] [L199] COND TRUE ! __cil_tmp6 [L201] CALL fail() [L46] reach_error() VAL [gl_list={-3:0}] - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 218 locations, 34 error locations. Started 1 CEGAR loops. OverallTime: 28.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 27.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 808 SdHoareTripleChecker+Invalid, 25.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 432 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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-01-10 20:09:48,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...