/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev-1.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m
[2023-12-24 20:47:33,475 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-12-24 20:47:33,519 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2023-12-24 20:47:33,522 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-12-24 20:47:33,523 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-12-24 20:47:33,537 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-12-24 20:47:33,538 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-12-24 20:47:33,538 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-12-24 20:47:33,538 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-12-24 20:47:33,538 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2023-12-24 20:47:33,539 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-12-24 20:47:33,539 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-12-24 20:47:33,539 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-12-24 20:47:33,540 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-12-24 20:47:33,540 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-12-24 20:47:33,540 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-12-24 20:47:33,540 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-12-24 20:47:33,541 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-12-24 20:47:33,541 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-12-24 20:47:33,541 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-12-24 20:47:33,541 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-12-24 20:47:33,541 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-12-24 20:47:33,542 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-12-24 20:47:33,542 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2023-12-24 20:47:33,542 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2023-12-24 20:47:33,542 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2023-12-24 20:47:33,542 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2023-12-24 20:47:33,542 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-12-24 20:47:33,543 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-12-24 20:47:33,543 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-12-24 20:47:33,543 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-12-24 20:47:33,543 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-12-24 20:47:33,543 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-12-24 20:47:33,543 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-12-24 20:47:33,544 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-24 20:47:33,544 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-12-24 20:47:33,544 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-12-24 20:47:33,544 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-12-24 20:47:33,544 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2023-12-24 20:47:33,544 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-12-24 20:47:33,544 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-12-24 20:47:33,545 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-12-24 20:47:33,545 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-12-24 20:47:33,545 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-12-24 20:47:33,545 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-12-24 20:47:33,545 INFO  L153        SettingsManager]:  * Logic for external solver=AUFBV
[2023-12-24 20:47:33,545 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
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
[2023-12-24 20:47:33,732 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-12-24 20:47:33,764 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-12-24 20:47:33,766 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-12-24 20:47:33,767 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-12-24 20:47:33,767 INFO  L274        PluginConnector]: CDTParser initialized
[2023-12-24 20:47:33,769 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev-1.i
[2023-12-24 20:47:34,828 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-12-24 20:47:35,004 INFO  L384              CDTParser]: Found 1 translation units.
[2023-12-24 20:47:35,004 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev-1.i
[2023-12-24 20:47:35,017 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427cf3f06/9a40191e93874eed808a7778931703b7/FLAG7968e7a43
[2023-12-24 20:47:35,027 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427cf3f06/9a40191e93874eed808a7778931703b7
[2023-12-24 20:47:35,029 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-12-24 20:47:35,030 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-12-24 20:47:35,031 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-12-24 20:47:35,031 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-12-24 20:47:35,036 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-12-24 20:47:35,037 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,037 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe0ae52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35, skipping insertion in model container
[2023-12-24 20:47:35,037 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,078 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-24 20:47:35,279 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev-1.i[22636,22649]
[2023-12-24 20:47:35,316 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-24 20:47:35,331 INFO  L202         MainTranslator]: Completed pre-run
[2023-12-24 20:47:35,363 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev-1.i[22636,22649]
[2023-12-24 20:47:35,375 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-24 20:47:35,397 INFO  L206         MainTranslator]: Completed translation
[2023-12-24 20:47:35,398 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35 WrapperNode
[2023-12-24 20:47:35,398 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-12-24 20:47:35,398 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-12-24 20:47:35,399 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-12-24 20:47:35,399 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-12-24 20:47:35,403 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,423 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,461 INFO  L138                Inliner]: procedures = 130, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 205
[2023-12-24 20:47:35,462 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-12-24 20:47:35,462 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-12-24 20:47:35,463 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-12-24 20:47:35,463 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-12-24 20:47:35,471 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,471 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,475 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,501 INFO  L175           MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 8, 8, 18, 6]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 0, 1]. The 10 writes are split as follows [0, 1, 1, 7, 1].
[2023-12-24 20:47:35,501 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,501 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,511 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,515 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,517 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,518 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,522 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-12-24 20:47:35,523 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-12-24 20:47:35,523 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-12-24 20:47:35,523 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-12-24 20:47:35,524 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (1/1) ...
[2023-12-24 20:47:35,534 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-24 20:47:35,545 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-24 20:47:35,561 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2023-12-24 20:47:35,564 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2023-12-24 20:47:35,587 INFO  L130     BoogieDeclarations]: Found specification of procedure fail
[2023-12-24 20:47:35,587 INFO  L138     BoogieDeclarations]: Found implementation of procedure fail
[2023-12-24 20:47:35,587 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#2
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#3
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#4
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#2
[2023-12-24 20:47:35,588 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#3
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#4
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure check_seq_prev
[2023-12-24 20:47:35,589 INFO  L138     BoogieDeclarations]: Found implementation of procedure check_seq_prev
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2023-12-24 20:47:35,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2
[2023-12-24 20:47:35,590 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3
[2023-12-24 20:47:35,590 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4
[2023-12-24 20:47:35,590 INFO  L130     BoogieDeclarations]: Found specification of procedure chain_node
[2023-12-24 20:47:35,590 INFO  L138     BoogieDeclarations]: Found implementation of procedure chain_node
[2023-12-24 20:47:35,590 INFO  L130     BoogieDeclarations]: Found specification of procedure check_seq_next
[2023-12-24 20:47:35,590 INFO  L138     BoogieDeclarations]: Found implementation of procedure check_seq_next
[2023-12-24 20:47:35,590 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-12-24 20:47:35,590 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-12-24 20:47:35,699 INFO  L241             CfgBuilder]: Building ICFG
[2023-12-24 20:47:35,700 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-12-24 20:47:36,069 INFO  L282             CfgBuilder]: Performing block encoding
[2023-12-24 20:47:36,092 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-12-24 20:47:36,092 INFO  L309             CfgBuilder]: Removed 33 assume(true) statements.
[2023-12-24 20:47:36,093 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:47:36 BoogieIcfgContainer
[2023-12-24 20:47:36,093 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-12-24 20:47:36,094 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-12-24 20:47:36,094 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-12-24 20:47:36,096 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-12-24 20:47:36,096 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:47:35" (1/3) ...
[2023-12-24 20:47:36,097 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b4859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:47:36, skipping insertion in model container
[2023-12-24 20:47:36,097 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:47:35" (2/3) ...
[2023-12-24 20:47:36,097 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b4859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:47:36, skipping insertion in model container
[2023-12-24 20:47:36,097 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:47:36" (3/3) ...
[2023-12-24 20:47:36,098 INFO  L112   eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i
[2023-12-24 20:47:36,109 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-12-24 20:47:36,109 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-12-24 20:47:36,141 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-12-24 20:47:36,147 INFO  L357      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=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f28d96e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-12-24 20:47:36,147 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-12-24 20:47:36,150 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 90 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 77 states have internal predecessors, (120), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2023-12-24 20:47:36,155 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2023-12-24 20:47:36,155 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-24 20:47:36,155 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-24 20:47:36,156 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-24 20:47:36,159 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-24 20:47:36,159 INFO  L85        PathProgramCache]: Analyzing trace with hash -1056251351, now seen corresponding path program 1 times
[2023-12-24 20:47:36,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-24 20:47:36,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627890873]
[2023-12-24 20:47:36,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-24 20:47:36,167 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-24 20:47:36,167 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-24 20:47:36,176 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-12-24 20:47:36,179 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2023-12-24 20:47:36,276 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-24 20:47:36,279 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-12-24 20:47:36,282 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-24 20:47:36,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-24 20:47:36,296 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-24 20:47:36,296 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-24 20:47:36,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627890873]
[2023-12-24 20:47:36,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [627890873] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-24 20:47:36,297 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-24 20:47:36,297 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-12-24 20:47:36,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872451859]
[2023-12-24 20:47:36,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-24 20:47:36,301 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-12-24 20:47:36,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-24 20:47:36,317 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-12-24 20:47:36,317 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-12-24 20:47:36,319 INFO  L87              Difference]: Start difference. First operand  has 90 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 77 states have internal predecessors, (120), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand  has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-24 20:47:36,427 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-24 20:47:36,427 INFO  L93              Difference]: Finished difference Result 177 states and 315 transitions.
[2023-12-24 20:47:36,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-12-24 20:47:36,430 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14
[2023-12-24 20:47:36,430 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-24 20:47:36,435 INFO  L225             Difference]: With dead ends: 177
[2023-12-24 20:47:36,436 INFO  L226             Difference]: Without dead ends: 84
[2023-12-24 20:47:36,439 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-12-24 20:47:36,441 INFO  L413           NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-24 20:47:36,441 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-24 20:47:36,452 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2023-12-24 20:47:36,465 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2023-12-24 20:47:36,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 63 states have (on average 1.253968253968254) internal successors, (79), 72 states have internal predecessors, (79), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2023-12-24 20:47:36,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions.
[2023-12-24 20:47:36,468 INFO  L78                 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 14
[2023-12-24 20:47:36,469 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-24 20:47:36,469 INFO  L495      AbstractCegarLoop]: Abstraction has 84 states and 104 transitions.
[2023-12-24 20:47:36,469 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-12-24 20:47:36,469 INFO  L276                IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions.
[2023-12-24 20:47:36,470 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2023-12-24 20:47:36,470 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-24 20:47:36,470 INFO  L195           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-24 20:47:36,481 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2023-12-24 20:47:36,674 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-24 20:47:36,675 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-24 20:47:36,678 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-24 20:47:36,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -1761441640, now seen corresponding path program 1 times
[2023-12-24 20:47:36,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-24 20:47:36,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393992726]
[2023-12-24 20:47:36,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-24 20:47:36,679 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-24 20:47:36,680 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-24 20:47:36,681 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-12-24 20:47:36,682 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2023-12-24 20:47:36,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-24 20:47:36,851 INFO  L262         TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core
[2023-12-24 20:47:36,855 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-24 20:47:36,963 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2023-12-24 20:47:37,076 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16
[2023-12-24 20:47:37,083 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2023-12-24 20:47:37,162 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8
[2023-12-24 20:47:37,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-24 20:47:37,201 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-24 20:47:37,244 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30
[2023-12-24 20:47:37,414 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26
[2023-12-24 20:47:37,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-12-24 20:47:37,433 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-24 20:47:37,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393992726]
[2023-12-24 20:47:37,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393992726] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-24 20:47:37,433 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-24 20:47:37,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11
[2023-12-24 20:47:37,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530263594]
[2023-12-24 20:47:37,434 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-24 20:47:37,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-12-24 20:47:37,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-24 20:47:37,436 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-12-24 20:47:37,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2023-12-24 20:47:37,436 INFO  L87              Difference]: Start difference. First operand 84 states and 104 transitions. Second operand  has 11 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2023-12-24 20:47:41,609 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-24 20:47:46,176 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-24 20:47:47,538 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-24 20:47:47,538 INFO  L93              Difference]: Finished difference Result 109 states and 131 transitions.
[2023-12-24 20:47:47,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-12-24 20:47:47,539 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27
[2023-12-24 20:47:47,539 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-24 20:47:47,541 INFO  L225             Difference]: With dead ends: 109
[2023-12-24 20:47:47,542 INFO  L226             Difference]: Without dead ends: 106
[2023-12-24 20:47:47,542 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306
[2023-12-24 20:47:47,543 INFO  L413           NwaCegarLoop]: 81 mSDtfsCounter, 146 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time
[2023-12-24 20:47:47,543 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 647 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 268 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time]
[2023-12-24 20:47:47,544 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2023-12-24 20:47:47,566 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100.
[2023-12-24 20:47:47,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 86 states have internal predecessors, (96), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2023-12-24 20:47:47,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions.
[2023-12-24 20:47:47,568 INFO  L78                 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 27
[2023-12-24 20:47:47,568 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-24 20:47:47,568 INFO  L495      AbstractCegarLoop]: Abstraction has 100 states and 121 transitions.
[2023-12-24 20:47:47,569 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2023-12-24 20:47:47,569 INFO  L276                IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions.
[2023-12-24 20:47:47,569 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2023-12-24 20:47:47,569 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-24 20:47:47,569 INFO  L195           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-24 20:47:47,576 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2023-12-24 20:47:47,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-24 20:47:47,777 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-24 20:47:47,777 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-24 20:47:47,778 INFO  L85        PathProgramCache]: Analyzing trace with hash -535177918, now seen corresponding path program 1 times
[2023-12-24 20:47:47,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-24 20:47:47,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557130121]
[2023-12-24 20:47:47,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-24 20:47:47,778 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-24 20:47:47,778 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-24 20:47:47,779 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-12-24 20:47:47,796 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2023-12-24 20:47:47,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-24 20:47:47,926 INFO  L262         TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 20 conjunts are in the unsatisfiable core
[2023-12-24 20:47:47,930 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-24 20:47:47,986 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2023-12-24 20:47:48,043 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16
[2023-12-24 20:47:48,047 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2023-12-24 20:47:48,139 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8
[2023-12-24 20:47:48,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-12-24 20:47:48,192 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-24 20:47:48,233 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30
[2023-12-24 20:47:48,384 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26
[2023-12-24 20:47:48,410 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-12-24 20:47:48,410 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-24 20:47:48,410 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557130121]
[2023-12-24 20:47:48,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [557130121] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-24 20:47:48,411 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-24 20:47:48,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11
[2023-12-24 20:47:48,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279528840]
[2023-12-24 20:47:48,411 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-24 20:47:48,411 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-12-24 20:47:48,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-24 20:47:48,412 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-12-24 20:47:48,413 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2023-12-24 20:47:48,413 INFO  L87              Difference]: Start difference. First operand 100 states and 121 transitions. Second operand  has 11 states, 8 states have (on average 3.25) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2023-12-24 20:47:52,989 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-24 20:47:57,106 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-24 20:48:01,676 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-24 20:48:02,496 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-24 20:48:02,496 INFO  L93              Difference]: Finished difference Result 112 states and 132 transitions.
[2023-12-24 20:48:02,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-12-24 20:48:02,497 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 8 states have (on average 3.25) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29
[2023-12-24 20:48:02,497 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-24 20:48:02,498 INFO  L225             Difference]: With dead ends: 112
[2023-12-24 20:48:02,498 INFO  L226             Difference]: Without dead ends: 109
[2023-12-24 20:48:02,498 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306
[2023-12-24 20:48:02,499 INFO  L413           NwaCegarLoop]: 80 mSDtfsCounter, 117 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time
[2023-12-24 20:48:02,499 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 646 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 275 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time]
[2023-12-24 20:48:02,500 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2023-12-24 20:48:02,511 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104.
[2023-12-24 20:48:02,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 80 states have (on average 1.225) internal successors, (98), 89 states have internal predecessors, (98), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2023-12-24 20:48:02,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions.
[2023-12-24 20:48:02,512 INFO  L78                 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 29
[2023-12-24 20:48:02,512 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-24 20:48:02,512 INFO  L495      AbstractCegarLoop]: Abstraction has 104 states and 123 transitions.
[2023-12-24 20:48:02,513 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 8 states have (on average 3.25) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2023-12-24 20:48:02,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions.
[2023-12-24 20:48:02,513 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2023-12-24 20:48:02,513 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-24 20:48:02,513 INFO  L195           NwaCegarLoop]: trace histogram [2, 2, 2, 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]
[2023-12-24 20:48:02,534 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2023-12-24 20:48:02,720 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-24 20:48:02,720 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-24 20:48:02,721 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-24 20:48:02,721 INFO  L85        PathProgramCache]: Analyzing trace with hash 1995234094, now seen corresponding path program 1 times
[2023-12-24 20:48:02,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-24 20:48:02,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276453251]
[2023-12-24 20:48:02,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-24 20:48:02,721 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-24 20:48:02,721 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-24 20:48:02,722 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-12-24 20:48:02,724 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2023-12-24 20:48:02,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-24 20:48:02,909 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-12-24 20:48:03,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-24 20:48:03,056 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2023-12-24 20:48:03,056 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-12-24 20:48:03,057 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-12-24 20:48:03,080 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2023-12-24 20:48:03,258 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-24 20:48:03,261 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-12-24 20:48:03,264 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2023-12-24 20:48:03,296 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 08:48:03 BoogieIcfgContainer
[2023-12-24 20:48:03,297 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-12-24 20:48:03,297 INFO  L158              Benchmark]: Toolchain (without parser) took 28267.31ms. Allocated memory is still 326.1MB. Free memory was 276.1MB in the beginning and 271.0MB in the end (delta: 5.1MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB.
[2023-12-24 20:48:03,297 INFO  L158              Benchmark]: CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory was 127.5MB in the beginning and 127.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB.
[2023-12-24 20:48:03,297 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 367.31ms. Allocated memory is still 326.1MB. Free memory was 276.1MB in the beginning and 256.2MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB.
[2023-12-24 20:48:03,300 INFO  L158              Benchmark]: Boogie Procedure Inliner took 63.49ms. Allocated memory is still 326.1MB. Free memory was 256.2MB in the beginning and 253.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2023-12-24 20:48:03,300 INFO  L158              Benchmark]: Boogie Preprocessor took 59.79ms. Allocated memory is still 326.1MB. Free memory was 253.7MB in the beginning and 248.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB.
[2023-12-24 20:48:03,302 INFO  L158              Benchmark]: RCFGBuilder took 570.09ms. Allocated memory is still 326.1MB. Free memory was 248.5MB in the beginning and 282.3MB in the end (delta: -33.8MB). Peak memory consumption was 25.9MB. Max. memory is 8.0GB.
[2023-12-24 20:48:03,302 INFO  L158              Benchmark]: TraceAbstraction took 27202.42ms. Allocated memory is still 326.1MB. Free memory was 281.8MB in the beginning and 271.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB.
[2023-12-24 20:48:03,303 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory was 127.5MB in the beginning and 127.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 367.31ms. Allocated memory is still 326.1MB. Free memory was 276.1MB in the beginning and 256.2MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 63.49ms. Allocated memory is still 326.1MB. Free memory was 256.2MB in the beginning and 253.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 59.79ms. Allocated memory is still 326.1MB. Free memory was 253.7MB in the beginning and 248.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB.
 * RCFGBuilder took 570.09ms. Allocated memory is still 326.1MB. Free memory was 248.5MB in the beginning and 282.3MB in the end (delta: -33.8MB). Peak memory consumption was 25.9MB. Max. memory is 8.0GB.
 * TraceAbstraction took 27202.42ms. Allocated memory is still 326.1MB. Free memory was 281.8MB in the beginning and 271.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.3MB. 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: 565]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L639]              const struct node *p1, *p2;
[L640]  CALL, EXPR  create_sll(&p1, &p2)
[L588]              struct node *list = ((void *)0);
[L588]              struct node *list = ((void *)0);
[L590]  CALL        chain_node(&list)
[L582]  CALL, EXPR  alloc_node()
[L573]              struct node *ptr = malloc(sizeof *ptr);
[L574]  COND FALSE  !(!ptr)
        VAL         [ptr={1073741827:0}]
[L576]              ptr->next = ((void *)0)
[L577]              ptr->prev = ((void *)0)
[L578]              return ptr;
[L582]  RET, EXPR   alloc_node()
[L582]              struct node *node = alloc_node();
[L583]  EXPR        \read(**ppnode)
[L583]              node->next = *ppnode
[L584]              *ppnode = node
[L590]  RET         chain_node(&list)
        VAL         [list={-17:0}, pp1={-1:0}, pp1={-1:0}, pp2={2147483647:0}, pp2={2147483647:0}]
[L591]  COND FALSE  !(__VERIFIER_nondet_int())
[L592]  EXPR        \read(*list)
[L592]              *pp2 = list
[L593]  COND FALSE  !(__VERIFIER_nondet_int())
[L595]  EXPR        \read(*list)
[L595]              *pp1 = list
[L597]  CALL        chain_node(&list)
[L582]  CALL, EXPR  alloc_node()
[L573]              struct node *ptr = malloc(sizeof *ptr);
[L574]  COND FALSE  !(!ptr)
        VAL         [ptr={3:0}]
[L576]              ptr->next = ((void *)0)
[L577]              ptr->prev = ((void *)0)
[L578]              return ptr;
[L582]  RET, EXPR   alloc_node()
[L582]              struct node *node = alloc_node();
[L583]  EXPR        \read(**ppnode)
[L583]              node->next = *ppnode
[L584]              *ppnode = node
[L597]  RET         chain_node(&list)
        VAL         [list={-17:0}, pp1={-1:0}, pp1={-1:0}, pp2={2147483647:0}, pp2={2147483647:0}]
[L598]  COND FALSE  !(__VERIFIER_nondet_int())
[L599]  EXPR        \read(*list)
[L599]              return list;
[L588]              struct node *list = ((void *)0);
[L599]              return list;
[L640]  RET, EXPR   create_sll(&p1, &p2)
[L640]              struct node *list = create_sll(&p1, &p2);
[L642]  EXPR        \read(*p1)
[L642]  EXPR        \read(*p2)
[L642]  CALL        check_seq_next(p1, p2)
        VAL         [beg={1073741827:0}, end={1073741827:0}]
[L626]  COND FALSE  !(!(beg))
        VAL         [beg={1073741827:0}, beg={1073741827:0}, end={1073741827:0}, end={1073741827:0}]
[L627]  COND FALSE  !(!(end))
        VAL         [beg={1073741827:0}, beg={1073741827:0}, end={1073741827:0}, end={1073741827:0}]
[L628]  EXPR        beg->next
[L628]              beg = beg->next
[L628]  COND TRUE   end != beg
        VAL         [beg={0:0}, beg={1073741827:0}, end={1073741827:0}, end={1073741827:0}]
[L629]  COND TRUE   !(beg)
        VAL         [beg={0:0}, beg={1073741827:0}, end={1073741827:0}, end={1073741827:0}]
[L629]  CALL        fail()
[L565]              reach_error()

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 24.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 1398 SdHoareTripleChecker+Invalid, 23.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1132 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 547 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 266 mSDtfsCounter, 547 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=3, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 121 ConstructedInterpolants, 8 QuantifiedInterpolants, 827 SizeOfPredicates, 34 NumberOfNonLiveVariables, 531 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4/16 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!
[2023-12-24 20:48:03,334 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...