/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/verifythis/tree_del_iter_incorrect.c


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


This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m
[2023-12-25 00:12:02,145 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-12-25 00:12:02,260 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-25 00:12:02,264 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-12-25 00:12:02,265 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-12-25 00:12:02,303 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-12-25 00:12:02,303 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-12-25 00:12:02,304 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-12-25 00:12:02,304 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-12-25 00:12:02,307 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2023-12-25 00:12:02,307 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-12-25 00:12:02,308 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-12-25 00:12:02,308 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-12-25 00:12:02,309 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-12-25 00:12:02,309 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-12-25 00:12:02,310 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-12-25 00:12:02,310 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-12-25 00:12:02,310 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-12-25 00:12:02,311 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-12-25 00:12:02,311 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-12-25 00:12:02,312 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-12-25 00:12:02,312 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-12-25 00:12:02,312 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-12-25 00:12:02,312 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2023-12-25 00:12:02,312 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2023-12-25 00:12:02,312 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2023-12-25 00:12:02,313 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2023-12-25 00:12:02,313 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-12-25 00:12:02,313 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-12-25 00:12:02,313 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-12-25 00:12:02,314 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-12-25 00:12:02,314 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-12-25 00:12:02,314 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-12-25 00:12:02,314 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-12-25 00:12:02,314 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-25 00:12:02,314 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-12-25 00:12:02,315 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-12-25 00:12:02,315 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-12-25 00:12:02,315 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2023-12-25 00:12:02,315 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-12-25 00:12:02,315 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-12-25 00:12:02,316 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-12-25 00:12:02,316 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-12-25 00:12:02,317 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-12-25 00:12:02,320 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-12-25 00:12:02,320 INFO  L153        SettingsManager]:  * Logic for external solver=AUFBV
[2023-12-25 00:12:02,320 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-25 00:12:02,697 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-12-25 00:12:02,717 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-12-25 00:12:02,719 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-12-25 00:12:02,720 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-12-25 00:12:02,720 INFO  L274        PluginConnector]: CDTParser initialized
[2023-12-25 00:12:02,722 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c
[2023-12-25 00:12:03,754 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-12-25 00:12:03,897 INFO  L384              CDTParser]: Found 1 translation units.
[2023-12-25 00:12:03,897 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c
[2023-12-25 00:12:03,903 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280c257a5/df313916b7a54ce8b6f8f99ebfb90173/FLAGa7a3aaee0
[2023-12-25 00:12:03,922 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280c257a5/df313916b7a54ce8b6f8f99ebfb90173
[2023-12-25 00:12:03,924 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-12-25 00:12:03,925 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-12-25 00:12:03,927 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-12-25 00:12:03,927 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-12-25 00:12:03,931 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-12-25 00:12:03,931 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:12:03" (1/1) ...
[2023-12-25 00:12:03,932 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601c9794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:03, skipping insertion in model container
[2023-12-25 00:12:03,932 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:12:03" (1/1) ...
[2023-12-25 00:12:03,953 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-25 00:12:04,084 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632]
[2023-12-25 00:12:04,111 WARN  L1574              CHandler]: Possible shadowing of function min
[2023-12-25 00:12:04,132 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-25 00:12:04,146 INFO  L199         MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2023-12-25 00:12:04,154 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-25 00:12:04,160 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632]
[2023-12-25 00:12:04,170 WARN  L1574              CHandler]: Possible shadowing of function min
[2023-12-25 00:12:04,186 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-25 00:12:04,193 INFO  L202         MainTranslator]: Completed pre-run
[2023-12-25 00:12:04,204 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632]
[2023-12-25 00:12:04,222 WARN  L1574              CHandler]: Possible shadowing of function min
[2023-12-25 00:12:04,227 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-25 00:12:04,242 INFO  L206         MainTranslator]: Completed translation
[2023-12-25 00:12:04,242 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04 WrapperNode
[2023-12-25 00:12:04,242 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-12-25 00:12:04,244 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-12-25 00:12:04,244 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-12-25 00:12:04,244 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-12-25 00:12:04,249 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,269 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,291 INFO  L138                Inliner]: procedures = 31, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 102
[2023-12-25 00:12:04,291 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-12-25 00:12:04,292 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-12-25 00:12:04,292 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-12-25 00:12:04,292 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-12-25 00:12:04,300 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,300 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,313 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,332 INFO  L175           MemorySlicer]: Split 27 memory accesses to 4 slices as follows [2, 5, 2, 18]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 2, 1, 4].
[2023-12-25 00:12:04,332 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,332 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,340 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,343 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,345 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,346 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,349 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-12-25 00:12:04,350 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-12-25 00:12:04,350 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-12-25 00:12:04,350 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-12-25 00:12:04,351 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (1/1) ...
[2023-12-25 00:12:04,355 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-12-25 00:12:04,365 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-12-25 00:12:04,394 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-25 00:12:04,416 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-25 00:12:04,435 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-12-25 00:12:04,435 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2023-12-25 00:12:04,435 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2023-12-25 00:12:04,436 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2
[2023-12-25 00:12:04,436 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3
[2023-12-25 00:12:04,436 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-12-25 00:12:04,436 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2023-12-25 00:12:04,436 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2023-12-25 00:12:04,437 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#2
[2023-12-25 00:12:04,437 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#3
[2023-12-25 00:12:04,437 INFO  L130     BoogieDeclarations]: Found specification of procedure min
[2023-12-25 00:12:04,437 INFO  L138     BoogieDeclarations]: Found implementation of procedure min
[2023-12-25 00:12:04,438 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2023-12-25 00:12:04,438 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2023-12-25 00:12:04,438 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2
[2023-12-25 00:12:04,439 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3
[2023-12-25 00:12:04,439 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.meminit
[2023-12-25 00:12:04,439 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit
[2023-12-25 00:12:04,441 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2023-12-25 00:12:04,441 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2023-12-25 00:12:04,441 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#2
[2023-12-25 00:12:04,442 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#3
[2023-12-25 00:12:04,442 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_tree
[2023-12-25 00:12:04,442 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_tree
[2023-12-25 00:12:04,442 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-12-25 00:12:04,443 INFO  L130     BoogieDeclarations]: Found specification of procedure size
[2023-12-25 00:12:04,443 INFO  L138     BoogieDeclarations]: Found implementation of procedure size
[2023-12-25 00:12:04,445 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-12-25 00:12:04,445 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-12-25 00:12:04,445 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2023-12-25 00:12:04,446 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2023-12-25 00:12:04,446 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_inorder
[2023-12-25 00:12:04,446 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_inorder
[2023-12-25 00:12:04,446 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-12-25 00:12:04,446 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2023-12-25 00:12:04,446 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2023-12-25 00:12:04,446 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2
[2023-12-25 00:12:04,446 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3
[2023-12-25 00:12:04,590 INFO  L241             CfgBuilder]: Building ICFG
[2023-12-25 00:12:04,591 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-12-25 00:12:04,909 INFO  L282             CfgBuilder]: Performing block encoding
[2023-12-25 00:12:04,949 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-12-25 00:12:04,949 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2023-12-25 00:12:04,950 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:12:04 BoogieIcfgContainer
[2023-12-25 00:12:04,950 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-12-25 00:12:04,951 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-12-25 00:12:04,951 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-12-25 00:12:04,953 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-12-25 00:12:04,953 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:12:03" (1/3) ...
[2023-12-25 00:12:04,954 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6723c824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:12:04, skipping insertion in model container
[2023-12-25 00:12:04,954 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:04" (2/3) ...
[2023-12-25 00:12:04,954 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6723c824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:12:04, skipping insertion in model container
[2023-12-25 00:12:04,954 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:12:04" (3/3) ...
[2023-12-25 00:12:04,956 INFO  L112   eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c
[2023-12-25 00:12:04,967 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-12-25 00:12:04,967 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-12-25 00:12:04,997 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-12-25 00:12:05,001 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;@7ebbaf79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-12-25 00:12:05,002 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-12-25 00:12:05,005 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 75 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2023-12-25 00:12:05,011 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2023-12-25 00:12:05,011 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-25 00:12:05,011 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-25 00:12:05,012 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-25 00:12:05,015 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-25 00:12:05,016 INFO  L85        PathProgramCache]: Analyzing trace with hash 320711133, now seen corresponding path program 1 times
[2023-12-25 00:12:05,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-25 00:12:05,024 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120561686]
[2023-12-25 00:12:05,024 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-25 00:12:05,025 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-25 00:12:05,025 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-25 00:12:05,027 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-25 00:12:05,029 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-25 00:12:05,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-25 00:12:05,116 INFO  L262         TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-12-25 00:12:05,120 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-25 00:12:05,169 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-25 00:12:05,169 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-25 00:12:05,170 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-25 00:12:05,170 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120561686]
[2023-12-25 00:12:05,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120561686] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-25 00:12:05,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-25 00:12:05,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-12-25 00:12:05,171 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467043244]
[2023-12-25 00:12:05,172 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-25 00:12:05,174 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-25 00:12:05,175 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-25 00:12:05,192 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-25 00:12:05,193 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-12-25 00:12:05,195 INFO  L87              Difference]: Start difference. First operand  has 75 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand  has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2023-12-25 00:12:05,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-25 00:12:05,280 INFO  L93              Difference]: Finished difference Result 129 states and 178 transitions.
[2023-12-25 00:12:05,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-12-25 00:12:05,283 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35
[2023-12-25 00:12:05,283 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-25 00:12:05,289 INFO  L225             Difference]: With dead ends: 129
[2023-12-25 00:12:05,289 INFO  L226             Difference]: Without dead ends: 75
[2023-12-25 00:12:05,291 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-12-25 00:12:05,293 INFO  L413           NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-25 00:12:05,294 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-25 00:12:05,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2023-12-25 00:12:05,319 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75.
[2023-12-25 00:12:05,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 75 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 48 states have internal predecessors, (55), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23)
[2023-12-25 00:12:05,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions.
[2023-12-25 00:12:05,322 INFO  L78                 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 35
[2023-12-25 00:12:05,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-25 00:12:05,323 INFO  L495      AbstractCegarLoop]: Abstraction has 75 states and 98 transitions.
[2023-12-25 00:12:05,323 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2023-12-25 00:12:05,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions.
[2023-12-25 00:12:05,325 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2023-12-25 00:12:05,325 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-25 00:12:05,325 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-25 00:12:05,341 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-25 00:12:05,528 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-25 00:12:05,529 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-25 00:12:05,529 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-25 00:12:05,530 INFO  L85        PathProgramCache]: Analyzing trace with hash 944594216, now seen corresponding path program 1 times
[2023-12-25 00:12:05,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-25 00:12:05,530 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465615000]
[2023-12-25 00:12:05,530 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-25 00:12:05,530 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-25 00:12:05,531 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-25 00:12:05,532 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-25 00:12:05,534 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-25 00:12:05,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-25 00:12:05,609 INFO  L262         TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-12-25 00:12:05,612 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-25 00:12:05,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2023-12-25 00:12:05,717 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-25 00:12:05,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2023-12-25 00:12:05,945 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-25 00:12:05,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465615000]
[2023-12-25 00:12:05,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465615000] provided 0 perfect and 2 imperfect interpolant sequences
[2023-12-25 00:12:05,945 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-12-25 00:12:05,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8
[2023-12-25 00:12:05,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684823647]
[2023-12-25 00:12:05,946 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-12-25 00:12:05,947 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-12-25 00:12:05,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-25 00:12:05,948 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-12-25 00:12:05,948 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2023-12-25 00:12:05,949 INFO  L87              Difference]: Start difference. First operand 75 states and 98 transitions. Second operand  has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9)
[2023-12-25 00:12:06,128 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-25 00:12:06,128 INFO  L93              Difference]: Finished difference Result 133 states and 175 transitions.
[2023-12-25 00:12:06,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-12-25 00:12:06,129 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47
[2023-12-25 00:12:06,129 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-25 00:12:06,130 INFO  L225             Difference]: With dead ends: 133
[2023-12-25 00:12:06,130 INFO  L226             Difference]: Without dead ends: 77
[2023-12-25 00:12:06,131 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2023-12-25 00:12:06,132 INFO  L413           NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-25 00:12:06,132 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 404 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-25 00:12:06,133 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2023-12-25 00:12:06,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77.
[2023-12-25 00:12:06,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 77 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25)
[2023-12-25 00:12:06,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions.
[2023-12-25 00:12:06,140 INFO  L78                 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 47
[2023-12-25 00:12:06,140 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-25 00:12:06,140 INFO  L495      AbstractCegarLoop]: Abstraction has 77 states and 101 transitions.
[2023-12-25 00:12:06,141 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9)
[2023-12-25 00:12:06,141 INFO  L276                IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions.
[2023-12-25 00:12:06,142 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2023-12-25 00:12:06,142 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-25 00:12:06,142 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-25 00:12:06,150 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 (3)] Ended with exit code 0
[2023-12-25 00:12:06,347 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-25 00:12:06,347 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-25 00:12:06,348 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-25 00:12:06,348 INFO  L85        PathProgramCache]: Analyzing trace with hash -1061745653, now seen corresponding path program 1 times
[2023-12-25 00:12:06,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-25 00:12:06,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393361518]
[2023-12-25 00:12:06,349 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-25 00:12:06,349 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-25 00:12:06,349 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-25 00:12:06,366 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-25 00:12:06,396 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-25 00:12:06,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-25 00:12:06,466 INFO  L262         TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core
[2023-12-25 00:12:06,468 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-25 00:12:06,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2023-12-25 00:12:06,513 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-25 00:12:06,513 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-25 00:12:06,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393361518]
[2023-12-25 00:12:06,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [393361518] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-25 00:12:06,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-25 00:12:06,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-12-25 00:12:06,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735036491]
[2023-12-25 00:12:06,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-25 00:12:06,514 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-12-25 00:12:06,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-25 00:12:06,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-12-25 00:12:06,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2023-12-25 00:12:06,515 INFO  L87              Difference]: Start difference. First operand 77 states and 101 transitions. Second operand  has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9)
[2023-12-25 00:12:06,673 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-25 00:12:06,673 INFO  L93              Difference]: Finished difference Result 133 states and 175 transitions.
[2023-12-25 00:12:06,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-12-25 00:12:06,674 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 59
[2023-12-25 00:12:06,674 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-25 00:12:06,675 INFO  L225             Difference]: With dead ends: 133
[2023-12-25 00:12:06,675 INFO  L226             Difference]: Without dead ends: 79
[2023-12-25 00:12:06,676 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2023-12-25 00:12:06,677 INFO  L413           NwaCegarLoop]: 84 mSDtfsCounter, 51 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-25 00:12:06,677 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 503 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-25 00:12:06,677 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2023-12-25 00:12:06,687 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2023-12-25 00:12:06,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79 states, 49 states have (on average 1.163265306122449) internal successors, (57), 52 states have internal predecessors, (57), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27)
[2023-12-25 00:12:06,691 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions.
[2023-12-25 00:12:06,691 INFO  L78                 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 59
[2023-12-25 00:12:06,691 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-25 00:12:06,691 INFO  L495      AbstractCegarLoop]: Abstraction has 79 states and 104 transitions.
[2023-12-25 00:12:06,692 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9)
[2023-12-25 00:12:06,692 INFO  L276                IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions.
[2023-12-25 00:12:06,697 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2023-12-25 00:12:06,698 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-25 00:12:06,698 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-25 00:12:06,717 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 (4)] Forceful destruction successful, exit code 0
[2023-12-25 00:12:06,901 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-25 00:12:06,904 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-25 00:12:06,905 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-25 00:12:06,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 1631947453, now seen corresponding path program 1 times
[2023-12-25 00:12:06,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-25 00:12:06,906 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046365951]
[2023-12-25 00:12:06,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-25 00:12:06,906 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-25 00:12:06,906 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-25 00:12:06,907 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-25 00:12:06,909 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-25 00:12:07,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-25 00:12:07,020 INFO  L262         TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core
[2023-12-25 00:12:07,025 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-25 00:12:07,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2023-12-25 00:12:07,082 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-25 00:12:07,082 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-12-25 00:12:07,082 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046365951]
[2023-12-25 00:12:07,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046365951] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-25 00:12:07,082 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-25 00:12:07,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-12-25 00:12:07,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886566316]
[2023-12-25 00:12:07,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-25 00:12:07,083 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-12-25 00:12:07,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-12-25 00:12:07,083 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-12-25 00:12:07,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2023-12-25 00:12:07,084 INFO  L87              Difference]: Start difference. First operand 79 states and 104 transitions. Second operand  has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11)
[2023-12-25 00:12:07,281 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-25 00:12:07,281 INFO  L93              Difference]: Finished difference Result 127 states and 168 transitions.
[2023-12-25 00:12:07,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-12-25 00:12:07,282 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 72
[2023-12-25 00:12:07,282 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-25 00:12:07,283 INFO  L225             Difference]: With dead ends: 127
[2023-12-25 00:12:07,283 INFO  L226             Difference]: Without dead ends: 81
[2023-12-25 00:12:07,284 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2023-12-25 00:12:07,285 INFO  L413           NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-12-25 00:12:07,285 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 498 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-12-25 00:12:07,285 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2023-12-25 00:12:07,292 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81.
[2023-12-25 00:12:07,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 50 states have (on average 1.16) internal successors, (58), 54 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30)
[2023-12-25 00:12:07,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions.
[2023-12-25 00:12:07,293 INFO  L78                 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 72
[2023-12-25 00:12:07,294 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-25 00:12:07,294 INFO  L495      AbstractCegarLoop]: Abstraction has 81 states and 108 transitions.
[2023-12-25 00:12:07,294 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11)
[2023-12-25 00:12:07,294 INFO  L276                IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions.
[2023-12-25 00:12:07,295 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2023-12-25 00:12:07,295 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-25 00:12:07,295 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 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-25 00:12:07,302 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-25 00:12:07,499 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-25 00:12:07,499 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-25 00:12:07,500 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-25 00:12:07,500 INFO  L85        PathProgramCache]: Analyzing trace with hash -582366336, now seen corresponding path program 1 times
[2023-12-25 00:12:07,501 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-12-25 00:12:07,501 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203693530]
[2023-12-25 00:12:07,501 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-25 00:12:07,501 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-25 00:12:07,501 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-12-25 00:12:07,502 INFO  L229       MonitoredProcess]: Starting monitored process 6 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-25 00:12:07,505 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 (6)] Waiting until timeout for monitored process
[2023-12-25 00:12:07,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-25 00:12:07,819 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-12-25 00:12:08,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-25 00:12:08,109 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2023-12-25 00:12:08,110 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-12-25 00:12:08,110 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-12-25 00:12:08,120 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 (6)] Forceful destruction successful, exit code 0
[2023-12-25 00:12:08,312 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-25 00:12:08,314 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-12-25 00:12:08,318 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2023-12-25 00:12:08,345 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:12:08 BoogieIcfgContainer
[2023-12-25 00:12:08,345 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-12-25 00:12:08,345 INFO  L158              Benchmark]: Toolchain (without parser) took 4420.49ms. Allocated memory is still 245.4MB. Free memory was 199.5MB in the beginning and 94.6MB in the end (delta: 105.0MB). Peak memory consumption was 106.5MB. Max. memory is 8.0GB.
[2023-12-25 00:12:08,345 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 173.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-12-25 00:12:08,346 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 315.30ms. Allocated memory is still 245.4MB. Free memory was 199.5MB in the beginning and 184.5MB in the end (delta: 15.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB.
[2023-12-25 00:12:08,346 INFO  L158              Benchmark]: Boogie Procedure Inliner took 47.59ms. Allocated memory is still 245.4MB. Free memory was 184.5MB in the beginning and 182.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2023-12-25 00:12:08,346 INFO  L158              Benchmark]: Boogie Preprocessor took 57.53ms. Allocated memory is still 245.4MB. Free memory was 182.5MB in the beginning and 178.6MB in the end (delta: 3.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2023-12-25 00:12:08,346 INFO  L158              Benchmark]: RCFGBuilder took 599.75ms. Allocated memory is still 245.4MB. Free memory was 178.3MB in the beginning and 209.6MB in the end (delta: -31.3MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB.
[2023-12-25 00:12:08,347 INFO  L158              Benchmark]: TraceAbstraction took 3393.94ms. Allocated memory is still 245.4MB. Free memory was 209.0MB in the beginning and 94.6MB in the end (delta: 114.5MB). Peak memory consumption was 114.5MB. Max. memory is 8.0GB.
[2023-12-25 00:12:08,348 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.14ms. Allocated memory is still 173.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 315.30ms. Allocated memory is still 245.4MB. Free memory was 199.5MB in the beginning and 184.5MB in the end (delta: 15.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 47.59ms. Allocated memory is still 245.4MB. Free memory was 184.5MB in the beginning and 182.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 57.53ms. Allocated memory is still 245.4MB. Free memory was 182.5MB in the beginning and 178.6MB in the end (delta: 3.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 599.75ms. Allocated memory is still 245.4MB. Free memory was 178.3MB in the beginning and 209.6MB in the end (delta: -31.3MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB.
 * TraceAbstraction took 3393.94ms. Allocated memory is still 245.4MB. Free memory was 209.0MB in the beginning and 94.6MB in the end (delta: 114.5MB). Peak memory consumption was 114.5MB. 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: 16]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L105]  CALL, EXPR   nondet_tree()
[L25]   COND FALSE   !(__VERIFIER_nondet_bool())
[L28]                struct node *n = (struct node *)malloc(sizeof(struct node));
[L29]                n->data = __VERIFIER_nondet_int()
[L30]   CALL, EXPR   nondet_tree()
[L25]   COND TRUE    __VERIFIER_nondet_bool()
[L26]                return 0;
        VAL          [\result={0:0}]
[L30]   RET, EXPR    nondet_tree()
        VAL          [n={6:0}]
[L30]                n->left = nondet_tree()
[L31]   CALL, EXPR   nondet_tree()
[L25]   COND TRUE    __VERIFIER_nondet_bool()
[L26]                return 0;
        VAL          [\result={0:0}]
[L31]   RET, EXPR    nondet_tree()
        VAL          [n={6:0}]
[L31]                n->right = nondet_tree()
[L32]                return n;
        VAL          [\result={6:0}, n={6:0}]
[L105]  RET, EXPR    nondet_tree()
[L105]  CALL         task(nondet_tree())
[L83]   CALL, EXPR   min(t)
        VAL          [n={6:0}]
[L37]   COND FALSE   !(!n)
[L40]   EXPR         n->left
        VAL          [n={6:0}, n={6:0}]
[L40]   CALL, EXPR   min(n->left)
        VAL          [n={0:0}]
[L37]   COND TRUE    !n
[L38]                return 2147483647;
        VAL          [\result=2147483647, n={0:0}, n={0:0}]
[L40]   RET, EXPR    min(n->left)
        VAL          [n={6:0}, n={6:0}]
[L40]                int a = min(n->left);
[L41]   EXPR         n->right
        VAL          [a=2147483647, n={6:0}, n={6:0}]
[L41]   CALL, EXPR   min(n->right)
        VAL          [n={0:0}]
[L37]   COND TRUE    !n
[L38]                return 2147483647;
        VAL          [\result=2147483647, n={0:0}, n={0:0}]
[L41]   RET, EXPR    min(n->right)
        VAL          [a=2147483647, n={6:0}, n={6:0}]
[L41]                int b = min(n->right);
[L42]   COND TRUE    a <= b
[L42]                return a;
        VAL          [\result=2147483647, a=2147483647, b=2147483647, n={6:0}, n={6:0}]
[L83]   RET, EXPR    min(t)
        VAL          [t={6:0}, t={6:0}]
[L83]                int a = min(t);
[L84]                int b;
        VAL          [a=2147483647, b={38:0}, t={6:0}, t={6:0}]
[L86]   CALL, EXPR   size(t)
        VAL          [t={6:0}]
[L78]   COND FALSE   !(!t)
[L79]   EXPR         t->left
        VAL          [t={6:0}, t={6:0}]
[L79]   CALL, EXPR   size(t->left)
        VAL          [t={0:0}]
[L78]   COND TRUE    !t
[L78]                return 0;
        VAL          [\result=0, t={0:0}, t={0:0}]
[L79]   RET, EXPR    size(t->left)
        VAL          [t={6:0}, t={6:0}]
[L79]   EXPR         t->right
        VAL          [t={6:0}, t={6:0}]
[L79]   CALL, EXPR   size(t->right)
        VAL          [t={0:0}]
[L78]   COND TRUE    !t
[L78]                return 0;
        VAL          [\result=0, t={0:0}, t={0:0}]
[L79]   RET, EXPR    size(t->right)
        VAL          [t={6:0}, t={6:0}]
[L79]                return size(t->left) + size(t->right) + 1;
[L86]   RET, EXPR    size(t)
        VAL          [a=2147483647, b={38:0}, t={6:0}, t={6:0}]
[L86]                int n = size(t);
[L87]   CALL         assume_abort_if_not(n != 0)
[L10]   COND FALSE   !(!cond)
        VAL          [\old(cond)=1, cond=1]
[L87]   RET          assume_abort_if_not(n != 0)
[L88]   EXPR, FCALL  calloc(n, sizeof(int))
        VAL          [a=2147483647, b={38:0}, n=1, t={6:0}, t={6:0}]
[L88]                int *x = calloc(n, sizeof(int));
        VAL          [a=2147483647, b={38:0}, n=1, t={6:0}, t={6:0}, x={7:0}]
[L89]   CALL         tree_inorder(t, x, n)
        VAL          [\old(i)=1, a={7:0}, t={6:0}]
[L67]   COND FALSE   !(!t)
[L70]   EXPR         t->left
        VAL          [\old(i)=1, a={7:0}, a={7:0}, i=1, t={6:0}, t={6:0}]
[L70]   CALL, EXPR   tree_inorder(t->left,  a, i)
        VAL          [\old(i)=1, a={7:0}, t={0:0}]
[L67]   COND TRUE    !t
[L68]                return i;
        VAL          [\old(i)=1, \result=1, a={7:0}, a={7:0}, i=1, t={0:0}, t={0:0}]
[L70]   RET, EXPR    tree_inorder(t->left,  a, i)
        VAL          [\old(i)=1, a={7:0}, a={7:0}, i=1, t={6:0}, t={6:0}]
[L70]                i = tree_inorder(t->left,  a, i)
[L71]   EXPR         i++
[L71]   EXPR         t->data
[L71]                a[i++] = t->data
[L72]   EXPR         t->right
        VAL          [\old(i)=1, a={7:0}, a={7:0}, i=2, t={6:0}, t={6:0}]
[L72]   CALL, EXPR   tree_inorder(t->right, a, i)
        VAL          [\old(i)=2, a={7:0}, t={0:0}]
[L67]   COND TRUE    !t
[L68]                return i;
        VAL          [\old(i)=2, \result=2, a={7:0}, a={7:0}, i=2, t={0:0}, t={0:0}]
[L72]   RET, EXPR    tree_inorder(t->right, a, i)
        VAL          [\old(i)=1, a={7:0}, a={7:0}, i=2, t={6:0}, t={6:0}]
[L72]                i = tree_inorder(t->right, a, i)
[L73]                return i;
        VAL          [\old(i)=1, \result=2, a={7:0}, a={7:0}, i=2, t={6:0}, t={6:0}]
[L89]   RET          tree_inorder(t, x, n)
        VAL          [a=2147483647, b={38:0}, n=1, t={6:0}, t={6:0}, x={7:0}]
[L90]   EXPR         x[0]
[L90]   CALL         __VERIFIER_assert(a == x[0])
        VAL          [\old(cond)=0]
[L16]   COND TRUE    !cond
        VAL          [\old(cond)=0, cond=0]
[L16]                reach_error()
        VAL          [\old(cond)=0, cond=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 7 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 1764 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1422 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 288 IncrementalHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 342 mSDtfsCounter, 288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=4, InterpolantAutomatonStates: 28, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 536 SizeOfPredicates, 16 NumberOfNonLiveVariables, 731 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 80/84 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-25 00:12:08,370 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...