/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/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 18:31:01,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 18:31:01,166 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-16 18:31:01,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 18:31:01,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 18:31:01,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 18:31:01,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 18:31:01,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 18:31:01,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 18:31:01,195 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 18:31:01,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 18:31:01,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 18:31:01,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 18:31:01,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 18:31:01,197 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 18:31:01,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 18:31:01,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 18:31:01,197 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 18:31:01,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 18:31:01,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 18:31:01,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 18:31:01,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 18:31:01,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 18:31:01,200 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 18:31:01,201 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 18:31:01,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 18:31:01,201 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 18:31:01,201 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 18:31:01,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 18:31:01,201 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 18:31:01,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 18:31:01,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 18:31:01,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 18:31:01,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 18:31:01,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:31:01,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 18:31:01,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 18:31:01,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 18:31:01,203 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 18:31:01,203 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 18:31:01,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 18:31:01,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 18:31:01,203 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 18:31:01,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 18:31:01,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 18:31:01,204 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 18:31:01,204 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-16 18:31:01,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 18:31:01,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 18:31:01,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 18:31:01,425 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 18:31:01,425 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 18:31:01,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2023-12-16 18:31:02,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 18:31:02,985 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 18:31:02,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2023-12-16 18:31:03,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc5f7f90/31211a22965b44bb9bd53575e779f9fd/FLAG7aa8fefb1 [2023-12-16 18:31:03,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc5f7f90/31211a22965b44bb9bd53575e779f9fd [2023-12-16 18:31:03,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 18:31:03,032 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 18:31:03,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 18:31:03,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 18:31:03,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 18:31:03,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:31:03" (1/1) ... [2023-12-16 18:31:03,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f81e0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:03, skipping insertion in model container [2023-12-16 18:31:03,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:31:03" (1/1) ... [2023-12-16 18:31:03,186 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 18:31:03,575 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17602,17615] [2023-12-16 18:31:03,616 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22899,22912] [2023-12-16 18:31:03,623 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24256,24269] [2023-12-16 18:31:03,627 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25064,25077] [2023-12-16 18:31:03,649 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26792,26805] [2023-12-16 18:31:03,655 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27600,27613] [2023-12-16 18:31:03,663 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28779,28792] [2023-12-16 18:31:03,679 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31519,31532] [2023-12-16 18:31:03,698 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32330,32343] [2023-12-16 18:31:03,703 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33512,33525] [2023-12-16 18:31:03,718 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35703,35716] [2023-12-16 18:31:03,734 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39963,39976] [2023-12-16 18:31:03,738 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40774,40787] [2023-12-16 18:31:03,743 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41956,41969] [2023-12-16 18:31:03,749 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44147,44160] [2023-12-16 18:31:03,768 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47858,47871] [2023-12-16 18:31:03,801 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54605,54618] [2023-12-16 18:31:03,805 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55416,55429] [2023-12-16 18:31:03,810 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56559,56572] [2023-12-16 18:31:03,836 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58711,58724] [2023-12-16 18:31:03,852 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62628,62641] [2023-12-16 18:31:03,880 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69577,69590] [2023-12-16 18:31:03,919 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82313,82326] [2023-12-16 18:31:03,931 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83124,83137] [2023-12-16 18:31:03,935 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84306,84319] [2023-12-16 18:31:03,943 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86497,86510] [2023-12-16 18:31:03,959 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90208,90221] [2023-12-16 18:31:03,979 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96406,96419] [2023-12-16 18:31:04,005 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[106997,107010] [2023-12-16 18:31:04,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:31:04,428 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 18:31:04,484 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17602,17615] [2023-12-16 18:31:04,493 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22899,22912] [2023-12-16 18:31:04,497 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24256,24269] [2023-12-16 18:31:04,500 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25064,25077] [2023-12-16 18:31:04,506 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26792,26805] [2023-12-16 18:31:04,509 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27600,27613] [2023-12-16 18:31:04,515 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28779,28792] [2023-12-16 18:31:04,522 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31519,31532] [2023-12-16 18:31:04,525 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32330,32343] [2023-12-16 18:31:04,529 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33512,33525] [2023-12-16 18:31:04,534 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35703,35716] [2023-12-16 18:31:04,545 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39963,39976] [2023-12-16 18:31:04,548 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40774,40787] [2023-12-16 18:31:04,551 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41956,41969] [2023-12-16 18:31:04,557 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44147,44160] [2023-12-16 18:31:04,569 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47858,47871] [2023-12-16 18:31:04,583 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54605,54618] [2023-12-16 18:31:04,586 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55416,55429] [2023-12-16 18:31:04,590 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56559,56572] [2023-12-16 18:31:04,596 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58711,58724] [2023-12-16 18:31:04,605 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62628,62641] [2023-12-16 18:31:04,621 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69577,69590] [2023-12-16 18:31:04,646 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82313,82326] [2023-12-16 18:31:04,649 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83124,83137] [2023-12-16 18:31:04,652 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84306,84319] [2023-12-16 18:31:04,658 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86497,86510] [2023-12-16 18:31:04,716 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90208,90221] [2023-12-16 18:31:04,728 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96406,96419] [2023-12-16 18:31:04,746 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[106997,107010] [2023-12-16 18:31:05,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:31:05,082 INFO L206 MainTranslator]: Completed translation [2023-12-16 18:31:05,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05 WrapperNode [2023-12-16 18:31:05,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 18:31:05,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 18:31:05,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 18:31:05,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 18:31:05,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,271 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13483 [2023-12-16 18:31:05,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 18:31:05,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 18:31:05,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 18:31:05,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 18:31:05,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,404 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 18:31:05,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 18:31:05,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 18:31:05,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 18:31:05,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 18:31:05,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (1/1) ... [2023-12-16 18:31:05,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:31:05,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 18:31:05,729 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-16 18:31:05,823 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-16 18:31:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 18:31:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 18:31:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 18:31:05,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 18:31:06,115 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 18:31:06,117 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 18:31:11,867 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 18:31:11,927 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 18:31:11,927 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 18:31:11,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:31:11 BoogieIcfgContainer [2023-12-16 18:31:11,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 18:31:11,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 18:31:11,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 18:31:11,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 18:31:11,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:31:03" (1/3) ... [2023-12-16 18:31:11,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3951dc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:31:11, skipping insertion in model container [2023-12-16 18:31:11,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:05" (2/3) ... [2023-12-16 18:31:11,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3951dc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:31:11, skipping insertion in model container [2023-12-16 18:31:11,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:31:11" (3/3) ... [2023-12-16 18:31:11,933 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2023-12-16 18:31:11,944 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 18:31:11,944 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2023-12-16 18:31:11,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 18:31:11,996 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;@4a6b5b73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 18:31:11,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-12-16 18:31:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 2080 states, 2050 states have (on average 1.8614634146341464) internal successors, (3816), 2079 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 18:31:12,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:12,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:12,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:12,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash -393314146, now seen corresponding path program 1 times [2023-12-16 18:31:12,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:12,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088983106] [2023-12-16 18:31:12,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:12,040 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-16 18:31:12,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:12,042 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-16 18:31:12,086 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-16 18:31:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:12,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:31:12,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:13,016 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-16 18:31:13,016 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:13,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088983106] [2023-12-16 18:31:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088983106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:13,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:13,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:31:13,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40922304] [2023-12-16 18:31:13,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:13,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:31:13,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:13,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:31:13,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:31:13,049 INFO L87 Difference]: Start difference. First operand has 2080 states, 2050 states have (on average 1.8614634146341464) internal successors, (3816), 2079 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:14,095 INFO L93 Difference]: Finished difference Result 3090 states and 5487 transitions. [2023-12-16 18:31:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:31:14,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-12-16 18:31:14,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:14,111 INFO L225 Difference]: With dead ends: 3090 [2023-12-16 18:31:14,111 INFO L226 Difference]: Without dead ends: 1569 [2023-12-16 18:31:14,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:31:14,118 INFO L413 NwaCegarLoop]: 1853 mSDtfsCounter, 8181 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8181 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:14,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8181 Valid, 1861 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 18:31:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2023-12-16 18:31:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2023-12-16 18:31:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1540 states have (on average 1.3266233766233766) internal successors, (2043), 1568 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2043 transitions. [2023-12-16 18:31:14,178 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2043 transitions. Word has length 100 [2023-12-16 18:31:14,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:14,178 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2043 transitions. [2023-12-16 18:31:14,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2043 transitions. [2023-12-16 18:31:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-16 18:31:14,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:14,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:14,189 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-16 18:31:14,387 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-16 18:31:14,387 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:14,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1198583076, now seen corresponding path program 1 times [2023-12-16 18:31:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:14,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823826054] [2023-12-16 18:31:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:14,388 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-16 18:31:14,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:14,389 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-16 18:31:14,422 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-16 18:31:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:14,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:31:14,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:15,131 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-16 18:31:15,132 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:15,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:15,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823826054] [2023-12-16 18:31:15,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823826054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:15,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:15,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:31:15,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498680647] [2023-12-16 18:31:15,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:15,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:31:15,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:15,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:31:15,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:31:15,134 INFO L87 Difference]: Start difference. First operand 1569 states and 2043 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:15,932 INFO L93 Difference]: Finished difference Result 2573 states and 3458 transitions. [2023-12-16 18:31:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:31:15,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-12-16 18:31:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:15,936 INFO L225 Difference]: With dead ends: 2573 [2023-12-16 18:31:15,936 INFO L226 Difference]: Without dead ends: 1316 [2023-12-16 18:31:15,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:31:15,938 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 3446 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3446 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:15,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3446 Valid, 1019 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 18:31:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2023-12-16 18:31:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2023-12-16 18:31:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1287 states have (on average 1.3651903651903652) internal successors, (1757), 1315 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1757 transitions. [2023-12-16 18:31:15,954 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1757 transitions. Word has length 101 [2023-12-16 18:31:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:15,955 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1757 transitions. [2023-12-16 18:31:15,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1757 transitions. [2023-12-16 18:31:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-16 18:31:15,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:15,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:15,964 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-16 18:31:16,162 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-16 18:31:16,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:16,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1508928607, now seen corresponding path program 1 times [2023-12-16 18:31:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:16,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322984530] [2023-12-16 18:31:16,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:16,164 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-16 18:31:16,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:16,165 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-16 18:31:16,167 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-16 18:31:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:16,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:31:16,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:16,789 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-16 18:31:16,789 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:16,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:16,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322984530] [2023-12-16 18:31:16,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322984530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:16,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:16,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:31:16,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704373146] [2023-12-16 18:31:16,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:16,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:31:16,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:16,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:31:16,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:31:16,791 INFO L87 Difference]: Start difference. First operand 1316 states and 1757 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:17,523 INFO L93 Difference]: Finished difference Result 2320 states and 3171 transitions. [2023-12-16 18:31:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:31:17,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-16 18:31:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:17,527 INFO L225 Difference]: With dead ends: 2320 [2023-12-16 18:31:17,527 INFO L226 Difference]: Without dead ends: 1191 [2023-12-16 18:31:17,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:31:17,529 INFO L413 NwaCegarLoop]: 906 mSDtfsCounter, 3153 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3153 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:17,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3153 Valid, 926 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 18:31:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2023-12-16 18:31:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2023-12-16 18:31:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1162 states have (on average 1.3898450946643717) internal successors, (1615), 1190 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1615 transitions. [2023-12-16 18:31:17,543 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1615 transitions. Word has length 102 [2023-12-16 18:31:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:17,543 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1615 transitions. [2023-12-16 18:31:17,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1615 transitions. [2023-12-16 18:31:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 18:31:17,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:17,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:17,549 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-16 18:31:17,749 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-16 18:31:17,750 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:17,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:17,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1210391741, now seen corresponding path program 1 times [2023-12-16 18:31:17,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:17,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413028193] [2023-12-16 18:31:17,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:17,751 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-16 18:31:17,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:17,752 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-16 18:31:17,754 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-16 18:31:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:18,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:31:18,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:18,406 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-16 18:31:18,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:18,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:18,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413028193] [2023-12-16 18:31:18,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413028193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:18,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:18,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:31:18,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371971311] [2023-12-16 18:31:18,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:18,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:31:18,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:31:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:31:18,408 INFO L87 Difference]: Start difference. First operand 1191 states and 1615 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:19,148 INFO L93 Difference]: Finished difference Result 2195 states and 3028 transitions. [2023-12-16 18:31:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:31:19,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-12-16 18:31:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:19,151 INFO L225 Difference]: With dead ends: 2195 [2023-12-16 18:31:19,151 INFO L226 Difference]: Without dead ends: 1130 [2023-12-16 18:31:19,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:31:19,153 INFO L413 NwaCegarLoop]: 847 mSDtfsCounter, 3002 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3002 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:19,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3002 Valid, 875 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 18:31:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2023-12-16 18:31:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2023-12-16 18:31:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1101 states have (on average 1.4032697547683923) internal successors, (1545), 1129 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1545 transitions. [2023-12-16 18:31:19,167 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1545 transitions. Word has length 103 [2023-12-16 18:31:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:19,167 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1545 transitions. [2023-12-16 18:31:19,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1545 transitions. [2023-12-16 18:31:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 18:31:19,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:19,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:19,175 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 (5)] Ended with exit code 0 [2023-12-16 18:31:19,372 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-16 18:31:19,373 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:19,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:19,373 INFO L85 PathProgramCache]: Analyzing trace with hash 561178400, now seen corresponding path program 1 times [2023-12-16 18:31:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:19,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633438290] [2023-12-16 18:31:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:19,374 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-16 18:31:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:19,375 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-16 18:31:19,377 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-16 18:31:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:19,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:31:19,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:20,000 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-16 18:31:20,000 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:20,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633438290] [2023-12-16 18:31:20,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633438290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:20,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:20,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:31:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123030301] [2023-12-16 18:31:20,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:20,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:31:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:20,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:31:20,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:31:20,002 INFO L87 Difference]: Start difference. First operand 1130 states and 1545 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:20,793 INFO L93 Difference]: Finished difference Result 2134 states and 2957 transitions. [2023-12-16 18:31:20,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:31:20,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-12-16 18:31:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:20,796 INFO L225 Difference]: With dead ends: 2134 [2023-12-16 18:31:20,796 INFO L226 Difference]: Without dead ends: 1101 [2023-12-16 18:31:20,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:31:20,798 INFO L413 NwaCegarLoop]: 800 mSDtfsCounter, 2919 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2919 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:20,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2919 Valid, 836 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 18:31:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2023-12-16 18:31:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1101. [2023-12-16 18:31:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1072 states have (on average 1.4095149253731343) internal successors, (1511), 1100 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1511 transitions. [2023-12-16 18:31:20,811 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1511 transitions. Word has length 104 [2023-12-16 18:31:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:20,812 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1511 transitions. [2023-12-16 18:31:20,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1511 transitions. [2023-12-16 18:31:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 18:31:20,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:20,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:20,829 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-16 18:31:21,018 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-16 18:31:21,018 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:21,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash 654674334, now seen corresponding path program 1 times [2023-12-16 18:31:21,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663732011] [2023-12-16 18:31:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:21,020 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-16 18:31:21,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:21,021 INFO L229 MonitoredProcess]: Starting monitored process 7 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-16 18:31:21,054 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 (7)] Waiting until timeout for monitored process [2023-12-16 18:31:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:21,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:31:21,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:21,683 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-16 18:31:21,683 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:21,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:21,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663732011] [2023-12-16 18:31:21,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663732011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:31:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788521418] [2023-12-16 18:31:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:21,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:31:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:31:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:31:21,685 INFO L87 Difference]: Start difference. First operand 1101 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:22,452 INFO L93 Difference]: Finished difference Result 2105 states and 2922 transitions. [2023-12-16 18:31:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:31:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2023-12-16 18:31:22,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:22,455 INFO L225 Difference]: With dead ends: 2105 [2023-12-16 18:31:22,455 INFO L226 Difference]: Without dead ends: 1088 [2023-12-16 18:31:22,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:31:22,458 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 2864 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2864 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:22,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2864 Valid, 784 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 18:31:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2023-12-16 18:31:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2023-12-16 18:31:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.4117091595845137) internal successors, (1495), 1087 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1495 transitions. [2023-12-16 18:31:22,472 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1495 transitions. Word has length 105 [2023-12-16 18:31:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:22,473 INFO L495 AbstractCegarLoop]: Abstraction has 1088 states and 1495 transitions. [2023-12-16 18:31:22,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1495 transitions. [2023-12-16 18:31:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 18:31:22,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:22,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:22,490 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 (7)] Forceful destruction successful, exit code 0 [2023-12-16 18:31:22,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-16 18:31:22,681 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:22,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash -756882207, now seen corresponding path program 1 times [2023-12-16 18:31:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554512093] [2023-12-16 18:31:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:22,682 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-16 18:31:22,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:22,683 INFO L229 MonitoredProcess]: Starting monitored process 8 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-16 18:31:22,688 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 (8)] Waiting until timeout for monitored process [2023-12-16 18:31:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:23,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:31:23,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:23,328 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-16 18:31:23,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:23,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:23,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554512093] [2023-12-16 18:31:23,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554512093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:23,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:23,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:31:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016675062] [2023-12-16 18:31:23,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:23,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:31:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:31:23,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:31:23,336 INFO L87 Difference]: Start difference. First operand 1088 states and 1495 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:23,994 INFO L93 Difference]: Finished difference Result 2092 states and 2905 transitions. [2023-12-16 18:31:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:31:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-16 18:31:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:24,011 INFO L225 Difference]: With dead ends: 2092 [2023-12-16 18:31:24,012 INFO L226 Difference]: Without dead ends: 1083 [2023-12-16 18:31:24,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:31:24,014 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 2812 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2812 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:24,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2812 Valid, 664 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 18:31:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2023-12-16 18:31:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2023-12-16 18:31:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.411764705882353) internal successors, (1488), 1082 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1488 transitions. [2023-12-16 18:31:24,040 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1488 transitions. Word has length 106 [2023-12-16 18:31:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:24,040 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1488 transitions. [2023-12-16 18:31:24,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1488 transitions. [2023-12-16 18:31:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 18:31:24,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:24,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:24,047 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 (8)] Ended with exit code 0 [2023-12-16 18:31:24,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-16 18:31:24,250 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:24,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash 10049727, now seen corresponding path program 1 times [2023-12-16 18:31:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961584657] [2023-12-16 18:31:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:24,251 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-16 18:31:24,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:24,252 INFO L229 MonitoredProcess]: Starting monitored process 9 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-16 18:31:24,253 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 (9)] Waiting until timeout for monitored process [2023-12-16 18:31:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:24,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 18:31:24,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:24,891 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-16 18:31:24,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:24,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:24,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961584657] [2023-12-16 18:31:24,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961584657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:24,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:24,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 18:31:24,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560442042] [2023-12-16 18:31:24,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:24,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 18:31:24,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 18:31:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 18:31:24,892 INFO L87 Difference]: Start difference. First operand 1083 states and 1488 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:27,123 INFO L93 Difference]: Finished difference Result 1668 states and 2291 transitions. [2023-12-16 18:31:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 18:31:27,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-16 18:31:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:27,126 INFO L225 Difference]: With dead ends: 1668 [2023-12-16 18:31:27,126 INFO L226 Difference]: Without dead ends: 1083 [2023-12-16 18:31:27,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 18:31:27,127 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 5669 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5669 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:27,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5669 Valid, 1277 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 18:31:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2023-12-16 18:31:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2023-12-16 18:31:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4108159392789374) internal successors, (1487), 1082 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1487 transitions. [2023-12-16 18:31:27,138 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1487 transitions. Word has length 107 [2023-12-16 18:31:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:27,138 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1487 transitions. [2023-12-16 18:31:27,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1487 transitions. [2023-12-16 18:31:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 18:31:27,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:27,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:27,151 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 (9)] Forceful destruction successful, exit code 0 [2023-12-16 18:31:27,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-16 18:31:27,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:27,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1673844547, now seen corresponding path program 1 times [2023-12-16 18:31:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:27,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593704492] [2023-12-16 18:31:27,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:27,347 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-16 18:31:27,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:27,347 INFO L229 MonitoredProcess]: Starting monitored process 10 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-16 18:31:27,353 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 (10)] Waiting until timeout for monitored process [2023-12-16 18:31:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:27,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:31:27,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:28,188 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-16 18:31:28,188 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:28,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593704492] [2023-12-16 18:31:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593704492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:28,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:31:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045148373] [2023-12-16 18:31:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:28,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:31:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:31:28,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:31:28,190 INFO L87 Difference]: Start difference. First operand 1083 states and 1487 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:31,231 INFO L93 Difference]: Finished difference Result 1353 states and 1881 transitions. [2023-12-16 18:31:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:31:31,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-16 18:31:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:31,234 INFO L225 Difference]: With dead ends: 1353 [2023-12-16 18:31:31,234 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:31:31,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:31:31,235 INFO L413 NwaCegarLoop]: 870 mSDtfsCounter, 4911 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4911 SdHoareTripleChecker+Valid, 3196 SdHoareTripleChecker+Invalid, 2625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:31,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4911 Valid, 3196 Invalid, 2625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-16 18:31:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:31:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:31:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4098671726755219) internal successors, (1486), 1082 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1486 transitions. [2023-12-16 18:31:31,246 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1486 transitions. Word has length 107 [2023-12-16 18:31:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:31,246 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1486 transitions. [2023-12-16 18:31:31,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1486 transitions. [2023-12-16 18:31:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 18:31:31,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:31,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:31,253 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 (10)] Forceful destruction successful, exit code 0 [2023-12-16 18:31:31,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-16 18:31:31,453 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:31,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:31,453 INFO L85 PathProgramCache]: Analyzing trace with hash 124559761, now seen corresponding path program 1 times [2023-12-16 18:31:31,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:31,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235403586] [2023-12-16 18:31:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:31,454 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-16 18:31:31,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:31,463 INFO L229 MonitoredProcess]: Starting monitored process 11 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-16 18:31:31,474 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 (11)] Waiting until timeout for monitored process [2023-12-16 18:31:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:31,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:31:31,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:32,321 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-16 18:31:32,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:32,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:32,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235403586] [2023-12-16 18:31:32,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235403586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:32,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:32,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:31:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281733000] [2023-12-16 18:31:32,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:32,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:31:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:31:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:31:32,323 INFO L87 Difference]: Start difference. First operand 1083 states and 1486 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:35,070 INFO L93 Difference]: Finished difference Result 1477 states and 2052 transitions. [2023-12-16 18:31:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:31:35,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-16 18:31:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:35,073 INFO L225 Difference]: With dead ends: 1477 [2023-12-16 18:31:35,073 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:31:35,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:31:35,074 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 5508 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5508 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:35,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5508 Valid, 2887 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 18:31:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:31:35,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:31:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4089184060721063) internal successors, (1485), 1082 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1485 transitions. [2023-12-16 18:31:35,085 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1485 transitions. Word has length 107 [2023-12-16 18:31:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:35,085 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1485 transitions. [2023-12-16 18:31:35,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1485 transitions. [2023-12-16 18:31:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:31:35,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:35,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:35,091 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 (11)] Ended with exit code 0 [2023-12-16 18:31:35,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-16 18:31:35,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:35,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:35,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1528536076, now seen corresponding path program 1 times [2023-12-16 18:31:35,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:35,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712070010] [2023-12-16 18:31:35,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:35,292 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-16 18:31:35,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:35,293 INFO L229 MonitoredProcess]: Starting monitored process 12 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-16 18:31:35,326 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 (12)] Waiting until timeout for monitored process [2023-12-16 18:31:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:35,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:31:35,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:36,189 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-16 18:31:36,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:36,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:36,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712070010] [2023-12-16 18:31:36,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712070010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:36,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:36,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:31:36,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567816120] [2023-12-16 18:31:36,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:36,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:31:36,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:31:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:31:36,191 INFO L87 Difference]: Start difference. First operand 1083 states and 1485 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:39,152 INFO L93 Difference]: Finished difference Result 1305 states and 1808 transitions. [2023-12-16 18:31:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:31:39,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 18:31:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:39,155 INFO L225 Difference]: With dead ends: 1305 [2023-12-16 18:31:39,155 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:31:39,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:31:39,156 INFO L413 NwaCegarLoop]: 889 mSDtfsCounter, 3303 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3303 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:39,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3303 Valid, 3313 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-16 18:31:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:31:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:31:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4079696394686907) internal successors, (1484), 1082 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1484 transitions. [2023-12-16 18:31:39,167 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1484 transitions. Word has length 109 [2023-12-16 18:31:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:39,167 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1484 transitions. [2023-12-16 18:31:39,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1484 transitions. [2023-12-16 18:31:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:31:39,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:39,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:39,189 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 (12)] Ended with exit code 0 [2023-12-16 18:31:39,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-16 18:31:39,373 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:39,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:39,374 INFO L85 PathProgramCache]: Analyzing trace with hash -473795284, now seen corresponding path program 1 times [2023-12-16 18:31:39,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:39,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045035997] [2023-12-16 18:31:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:39,374 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-16 18:31:39,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:39,375 INFO L229 MonitoredProcess]: Starting monitored process 13 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-16 18:31:39,376 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 (13)] Waiting until timeout for monitored process [2023-12-16 18:31:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:39,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:31:39,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:40,140 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-16 18:31:40,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:40,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:40,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045035997] [2023-12-16 18:31:40,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045035997] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:40,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:40,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:31:40,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12332695] [2023-12-16 18:31:40,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:40,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:31:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:31:40,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:31:40,142 INFO L87 Difference]: Start difference. First operand 1083 states and 1484 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:43,018 INFO L93 Difference]: Finished difference Result 1374 states and 1899 transitions. [2023-12-16 18:31:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:31:43,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 18:31:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:43,021 INFO L225 Difference]: With dead ends: 1374 [2023-12-16 18:31:43,021 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:31:43,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:31:43,022 INFO L413 NwaCegarLoop]: 895 mSDtfsCounter, 4841 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4841 SdHoareTripleChecker+Valid, 3242 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:43,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4841 Valid, 3242 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2621 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-16 18:31:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:31:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:31:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.407020872865275) internal successors, (1483), 1082 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1483 transitions. [2023-12-16 18:31:43,035 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1483 transitions. Word has length 109 [2023-12-16 18:31:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:43,035 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1483 transitions. [2023-12-16 18:31:43,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1483 transitions. [2023-12-16 18:31:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:31:43,037 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:43,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:43,056 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 18:31:43,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-16 18:31:43,241 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:43,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1344450106, now seen corresponding path program 1 times [2023-12-16 18:31:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:43,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763564806] [2023-12-16 18:31:43,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:43,242 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-16 18:31:43,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:43,243 INFO L229 MonitoredProcess]: Starting monitored process 14 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-16 18:31:43,244 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 (14)] Waiting until timeout for monitored process [2023-12-16 18:31:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:43,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:31:43,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:44,193 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-16 18:31:44,193 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:44,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:44,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763564806] [2023-12-16 18:31:44,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763564806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:44,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:44,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:31:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315711060] [2023-12-16 18:31:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:44,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:31:44,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:44,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:31:44,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:31:44,195 INFO L87 Difference]: Start difference. First operand 1083 states and 1483 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:46,976 INFO L93 Difference]: Finished difference Result 1305 states and 1805 transitions. [2023-12-16 18:31:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:31:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 18:31:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:46,980 INFO L225 Difference]: With dead ends: 1305 [2023-12-16 18:31:46,980 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:31:46,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:31:46,986 INFO L413 NwaCegarLoop]: 889 mSDtfsCounter, 4638 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 2690 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4638 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:46,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4638 Valid, 3317 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2690 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 18:31:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:31:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:31:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4060721062618595) internal successors, (1482), 1082 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1482 transitions. [2023-12-16 18:31:46,997 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1482 transitions. Word has length 109 [2023-12-16 18:31:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:46,997 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1482 transitions. [2023-12-16 18:31:46,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1482 transitions. [2023-12-16 18:31:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:31:46,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:46,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:47,005 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 (14)] Forceful destruction successful, exit code 0 [2023-12-16 18:31:47,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-16 18:31:47,204 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:47,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1668784820, now seen corresponding path program 1 times [2023-12-16 18:31:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:47,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533569356] [2023-12-16 18:31:47,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:47,205 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-16 18:31:47,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:47,206 INFO L229 MonitoredProcess]: Starting monitored process 15 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-16 18:31:47,207 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 (15)] Waiting until timeout for monitored process [2023-12-16 18:31:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:47,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:31:47,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:48,010 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-16 18:31:48,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:48,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:48,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533569356] [2023-12-16 18:31:48,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533569356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:48,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:48,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:31:48,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132302890] [2023-12-16 18:31:48,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:48,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:31:48,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:48,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:31:48,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:31:48,012 INFO L87 Difference]: Start difference. First operand 1083 states and 1482 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:50,892 INFO L93 Difference]: Finished difference Result 1298 states and 1798 transitions. [2023-12-16 18:31:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:31:50,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 18:31:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:50,907 INFO L225 Difference]: With dead ends: 1298 [2023-12-16 18:31:50,907 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:31:50,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:31:50,911 INFO L413 NwaCegarLoop]: 868 mSDtfsCounter, 3337 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3337 SdHoareTripleChecker+Valid, 3261 SdHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:50,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3337 Valid, 3261 Invalid, 2679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2672 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-16 18:31:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:31:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:31:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.405123339658444) internal successors, (1481), 1082 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1481 transitions. [2023-12-16 18:31:50,934 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1481 transitions. Word has length 109 [2023-12-16 18:31:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:50,934 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1481 transitions. [2023-12-16 18:31:50,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1481 transitions. [2023-12-16 18:31:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:31:50,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:50,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:50,942 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 (15)] Forceful destruction successful, exit code 0 [2023-12-16 18:31:51,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-16 18:31:51,139 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:51,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash 395359209, now seen corresponding path program 1 times [2023-12-16 18:31:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:51,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930619228] [2023-12-16 18:31:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:51,140 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-16 18:31:51,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:51,144 INFO L229 MonitoredProcess]: Starting monitored process 16 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-16 18:31:51,151 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 (16)] Waiting until timeout for monitored process [2023-12-16 18:31:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:51,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:31:51,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:51,948 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-16 18:31:51,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:51,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930619228] [2023-12-16 18:31:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930619228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:51,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:31:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60415380] [2023-12-16 18:31:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:51,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:31:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:51,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:31:51,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:31:51,950 INFO L87 Difference]: Start difference. First operand 1083 states and 1481 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:54,712 INFO L93 Difference]: Finished difference Result 1374 states and 1892 transitions. [2023-12-16 18:31:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:31:54,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 18:31:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:54,715 INFO L225 Difference]: With dead ends: 1374 [2023-12-16 18:31:54,715 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:31:54,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:31:54,718 INFO L413 NwaCegarLoop]: 895 mSDtfsCounter, 3439 mSDsluCounter, 2358 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3439 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:54,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3439 Valid, 3253 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2602 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 18:31:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:31:54,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:31:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4041745730550284) internal successors, (1480), 1082 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1480 transitions. [2023-12-16 18:31:54,727 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1480 transitions. Word has length 109 [2023-12-16 18:31:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:54,728 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1480 transitions. [2023-12-16 18:31:54,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1480 transitions. [2023-12-16 18:31:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:31:54,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:54,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:54,736 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 (16)] Ended with exit code 0 [2023-12-16 18:31:54,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-16 18:31:54,934 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:54,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1897276727, now seen corresponding path program 1 times [2023-12-16 18:31:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:54,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646013628] [2023-12-16 18:31:54,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:54,935 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-16 18:31:54,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:54,936 INFO L229 MonitoredProcess]: Starting monitored process 17 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-16 18:31:54,938 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 (17)] Waiting until timeout for monitored process [2023-12-16 18:31:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:55,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:31:55,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:55,755 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-16 18:31:55,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:55,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:55,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646013628] [2023-12-16 18:31:55,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646013628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:55,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:55,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:31:55,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618807640] [2023-12-16 18:31:55,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:55,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:31:55,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:55,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:31:55,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:31:55,756 INFO L87 Difference]: Start difference. First operand 1083 states and 1480 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:58,666 INFO L93 Difference]: Finished difference Result 1305 states and 1802 transitions. [2023-12-16 18:31:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:31:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 18:31:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:58,669 INFO L225 Difference]: With dead ends: 1305 [2023-12-16 18:31:58,669 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:31:58,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:31:58,670 INFO L413 NwaCegarLoop]: 889 mSDtfsCounter, 3290 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 2679 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3290 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:58,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3290 Valid, 3317 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2679 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-16 18:31:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:31:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:31:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.403225806451613) internal successors, (1479), 1082 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1479 transitions. [2023-12-16 18:31:58,679 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1479 transitions. Word has length 109 [2023-12-16 18:31:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:58,679 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1479 transitions. [2023-12-16 18:31:58,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:31:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1479 transitions. [2023-12-16 18:31:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:31:58,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:58,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:58,692 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 (17)] Forceful destruction successful, exit code 0 [2023-12-16 18:31:58,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-16 18:31:58,885 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:31:58,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:58,885 INFO L85 PathProgramCache]: Analyzing trace with hash -211267848, now seen corresponding path program 1 times [2023-12-16 18:31:58,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:58,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984059347] [2023-12-16 18:31:58,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:58,886 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-16 18:31:58,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:58,887 INFO L229 MonitoredProcess]: Starting monitored process 18 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-16 18:31:58,888 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 (18)] Waiting until timeout for monitored process [2023-12-16 18:31:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:59,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:31:59,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:59,699 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-16 18:31:59,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:59,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:59,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984059347] [2023-12-16 18:31:59,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984059347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:59,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:59,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:31:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272681049] [2023-12-16 18:31:59,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:59,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:31:59,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:59,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:31:59,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:31:59,704 INFO L87 Difference]: Start difference. First operand 1083 states and 1479 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:32:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:02,412 INFO L93 Difference]: Finished difference Result 1527 states and 2091 transitions. [2023-12-16 18:32:02,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:32:02,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 18:32:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:02,415 INFO L225 Difference]: With dead ends: 1527 [2023-12-16 18:32:02,415 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:32:02,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:32:02,416 INFO L413 NwaCegarLoop]: 898 mSDtfsCounter, 3796 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3796 SdHoareTripleChecker+Valid, 3047 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:02,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3796 Valid, 3047 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 18:32:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:32:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:32:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4022770398481974) internal successors, (1478), 1082 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:32:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1478 transitions. [2023-12-16 18:32:02,427 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1478 transitions. Word has length 109 [2023-12-16 18:32:02,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:02,427 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1478 transitions. [2023-12-16 18:32:02,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:32:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1478 transitions. [2023-12-16 18:32:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 18:32:02,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:02,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:32:02,435 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 (18)] Forceful destruction successful, exit code 0 [2023-12-16 18:32:02,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-16 18:32:02,633 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:32:02,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2057277300, now seen corresponding path program 1 times [2023-12-16 18:32:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:02,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228642043] [2023-12-16 18:32:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:02,634 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-16 18:32:02,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:02,635 INFO L229 MonitoredProcess]: Starting monitored process 19 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-16 18:32:02,636 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 (19)] Waiting until timeout for monitored process [2023-12-16 18:32:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:02,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:32:02,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:03,526 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-16 18:32:03,527 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:03,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:03,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228642043] [2023-12-16 18:32:03,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228642043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:03,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:03,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:32:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974832006] [2023-12-16 18:32:03,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:03,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:32:03,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:32:03,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:32:03,535 INFO L87 Difference]: Start difference. First operand 1083 states and 1478 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:32:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:06,392 INFO L93 Difference]: Finished difference Result 1319 states and 1814 transitions. [2023-12-16 18:32:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:32:06,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-12-16 18:32:06,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:06,395 INFO L225 Difference]: With dead ends: 1319 [2023-12-16 18:32:06,395 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:32:06,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:32:06,396 INFO L413 NwaCegarLoop]: 842 mSDtfsCounter, 3490 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3490 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:06,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3490 Valid, 3160 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-16 18:32:06,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:32:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:32:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4013282732447818) internal successors, (1477), 1082 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:32:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1477 transitions. [2023-12-16 18:32:06,405 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1477 transitions. Word has length 111 [2023-12-16 18:32:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:06,405 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1477 transitions. [2023-12-16 18:32:06,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:32:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1477 transitions. [2023-12-16 18:32:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 18:32:06,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:06,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:32:06,420 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 (19)] Forceful destruction successful, exit code 0 [2023-12-16 18:32:06,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-16 18:32:06,621 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:32:06,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:06,621 INFO L85 PathProgramCache]: Analyzing trace with hash -177768362, now seen corresponding path program 1 times [2023-12-16 18:32:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:06,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057747281] [2023-12-16 18:32:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:06,622 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-16 18:32:06,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:06,623 INFO L229 MonitoredProcess]: Starting monitored process 20 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-16 18:32:06,624 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 (20)] Waiting until timeout for monitored process [2023-12-16 18:32:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:06,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:32:06,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:07,405 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-16 18:32:07,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:07,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057747281] [2023-12-16 18:32:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057747281] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:07,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:32:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630015451] [2023-12-16 18:32:07,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:07,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:32:07,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:07,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:32:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:32:07,407 INFO L87 Difference]: Start difference. First operand 1083 states and 1477 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:32:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:10,210 INFO L93 Difference]: Finished difference Result 1280 states and 1763 transitions. [2023-12-16 18:32:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:32:10,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-12-16 18:32:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:10,213 INFO L225 Difference]: With dead ends: 1280 [2023-12-16 18:32:10,213 INFO L226 Difference]: Without dead ends: 1169 [2023-12-16 18:32:10,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:32:10,214 INFO L413 NwaCegarLoop]: 877 mSDtfsCounter, 3263 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3263 SdHoareTripleChecker+Valid, 3293 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:10,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3263 Valid, 3293 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2707 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 18:32:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-16 18:32:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1083. [2023-12-16 18:32:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4003795066413662) internal successors, (1476), 1082 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:32:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1476 transitions. [2023-12-16 18:32:10,223 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1476 transitions. Word has length 111 [2023-12-16 18:32:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:10,223 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1476 transitions. [2023-12-16 18:32:10,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:32:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1476 transitions. [2023-12-16 18:32:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 18:32:10,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:10,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:32:10,240 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 (20)] Ended with exit code 0 [2023-12-16 18:32:10,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-16 18:32:10,429 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 18:32:10,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1855263288, now seen corresponding path program 1 times [2023-12-16 18:32:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:10,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419135830] [2023-12-16 18:32:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:10,430 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-16 18:32:10,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:10,431 INFO L229 MonitoredProcess]: Starting monitored process 21 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-16 18:32:10,434 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 (21)] Waiting until timeout for monitored process [2023-12-16 18:32:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:10,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:32:10,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:11,354 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-16 18:32:11,355 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:11,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419135830] [2023-12-16 18:32:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419135830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:32:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951975104] [2023-12-16 18:32:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:11,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:32:11,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:11,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:32:11,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:32:11,356 INFO L87 Difference]: Start difference. First operand 1083 states and 1476 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 18:32:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:32:11,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 18:32:11,437 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:11,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 58 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:32:11,438 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (28 of 29 remaining) [2023-12-16 18:32:11,445 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 18:32:11,445 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 (21)] Ended with exit code 0 [2023-12-16 18:32:11,445 WARN L340 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 (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 18:32:11,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-16 18:32:11,646 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. [2023-12-16 18:32:11,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2023-12-16 18:32:11,648 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2023-12-16 18:32:11,648 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2023-12-16 18:32:11,648 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2023-12-16 18:32:11,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2023-12-16 18:32:11,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2023-12-16 18:32:11,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2023-12-16 18:32:11,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2023-12-16 18:32:11,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2023-12-16 18:32:11,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2023-12-16 18:32:11,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2023-12-16 18:32:11,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2023-12-16 18:32:11,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2023-12-16 18:32:11,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2023-12-16 18:32:11,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2023-12-16 18:32:11,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2023-12-16 18:32:11,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2023-12-16 18:32:11,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2023-12-16 18:32:11,659 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:32:11,662 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 18:32:11,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:32:11 BoogieIcfgContainer [2023-12-16 18:32:11,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 18:32:11,669 INFO L158 Benchmark]: Toolchain (without parser) took 68631.53ms. Allocated memory was 295.7MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 236.9MB in the beginning and 1.2GB in the end (delta: -989.2MB). Peak memory consumption was 287.5MB. Max. memory is 8.0GB. [2023-12-16 18:32:11,669 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 204.5MB. Free memory was 152.8MB in the beginning and 152.7MB in the end (delta: 119.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 18:32:11,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2051.33ms. Allocated memory is still 295.7MB. Free memory was 236.4MB in the beginning and 173.7MB in the end (delta: 62.7MB). Peak memory consumption was 135.5MB. Max. memory is 8.0GB. [2023-12-16 18:32:11,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 186.17ms. Allocated memory is still 295.7MB. Free memory was 173.7MB in the beginning and 133.4MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-12-16 18:32:11,673 INFO L158 Benchmark]: Boogie Preprocessor took 420.15ms. Allocated memory was 295.7MB in the beginning and 487.6MB in the end (delta: 191.9MB). Free memory was 133.4MB in the beginning and 376.7MB in the end (delta: -243.4MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. [2023-12-16 18:32:11,673 INFO L158 Benchmark]: RCFGBuilder took 6234.37ms. Allocated memory was 487.6MB in the beginning and 975.2MB in the end (delta: 487.6MB). Free memory was 376.7MB in the beginning and 493.7MB in the end (delta: -116.9MB). Peak memory consumption was 377.0MB. Max. memory is 8.0GB. [2023-12-16 18:32:11,674 INFO L158 Benchmark]: TraceAbstraction took 59734.28ms. Allocated memory was 975.2MB in the beginning and 1.6GB in the end (delta: 597.7MB). Free memory was 493.1MB in the beginning and 1.2GB in the end (delta: -733.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 18:32:11,677 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.13ms. Allocated memory is still 204.5MB. Free memory was 152.8MB in the beginning and 152.7MB in the end (delta: 119.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2051.33ms. Allocated memory is still 295.7MB. Free memory was 236.4MB in the beginning and 173.7MB in the end (delta: 62.7MB). Peak memory consumption was 135.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 186.17ms. Allocated memory is still 295.7MB. Free memory was 173.7MB in the beginning and 133.4MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 420.15ms. Allocated memory was 295.7MB in the beginning and 487.6MB in the end (delta: 191.9MB). Free memory was 133.4MB in the beginning and 376.7MB in the end (delta: -243.4MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. * RCFGBuilder took 6234.37ms. Allocated memory was 487.6MB in the beginning and 975.2MB in the end (delta: 487.6MB). Free memory was 376.7MB in the beginning and 493.7MB in the end (delta: -116.9MB). Peak memory consumption was 377.0MB. Max. memory is 8.0GB. * TraceAbstraction took 59734.28ms. Allocated memory was 975.2MB in the beginning and 1.6GB in the end (delta: 597.7MB). Free memory was 493.1MB in the beginning and 1.2GB in the end (delta: -733.0MB). There was no memory consumed. 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 - TimeoutResultAtElement [Line: 6622]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6622). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 924]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 924). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 1359]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1359). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 1455]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1455). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 1510]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1510). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 1634]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1634). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 1689]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1689). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 1772]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1772). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 1965]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1965). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 2020]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2020). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 2103]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2103). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 2255]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2255). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 2559]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2559). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 2614]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2614). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 2697]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2697). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 2849]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2849). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 3112]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3112). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 3609]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3609). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 3664]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3664). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 3746]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3746). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 3897]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3897). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 4173]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4173). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 4672]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4672). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 5613]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5613). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 5668]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5668). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 5751]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5751). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 5903]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5903). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 6166]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6166). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - TimeoutResultAtElement [Line: 7433]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 7433). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-4-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2080 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 59.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 39.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75895 SdHoareTripleChecker+Valid, 36.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75895 mSDsluCounter, 43586 SdHoareTripleChecker+Invalid, 33.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26559 mSDsCounter, 278 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35802 IncrementalHoareTripleChecker+Invalid, 36080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 278 mSolverCounterUnsat, 17027 mSDtfsCounter, 35802 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2209 GetRequests, 2020 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2080occurred in iteration=0, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 946 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 2138 NumberOfCodeBlocks, 2138 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2118 ConstructedInterpolants, 1379 QuantifiedInterpolants, 27498 SizeOfPredicates, 86 NumberOfNonLiveVariables, 9441 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown