/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.1.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:30:00,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 18:30:00,959 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:30:00,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 18:30:00,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 18:30:01,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 18:30:01,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 18:30:01,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 18:30:01,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 18:30:01,005 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 18:30:01,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 18:30:01,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 18:30:01,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 18:30:01,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 18:30:01,008 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 18:30:01,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 18:30:01,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 18:30:01,009 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 18:30:01,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 18:30:01,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 18:30:01,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 18:30:01,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 18:30:01,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 18:30:01,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 18:30:01,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 18:30:01,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 18:30:01,012 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 18:30:01,012 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 18:30:01,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 18:30:01,012 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 18:30:01,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 18:30:01,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 18:30:01,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 18:30:01,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 18:30:01,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:30:01,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 18:30:01,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 18:30:01,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 18:30:01,014 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 18:30:01,014 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 18:30:01,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 18:30:01,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 18:30:01,015 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 18:30:01,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 18:30:01,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 18:30:01,015 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 18:30:01,016 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:30:01,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 18:30:01,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 18:30:01,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 18:30:01,284 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 18:30:01,286 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 18:30:01,288 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2023-12-16 18:30:02,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 18:30:02,852 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 18:30:02,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2023-12-16 18:30:02,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74eb4cffa/77ef4df99d6b4adcb143948966ecf601/FLAGfde2f4666 [2023-12-16 18:30:02,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74eb4cffa/77ef4df99d6b4adcb143948966ecf601 [2023-12-16 18:30:02,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 18:30:02,906 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 18:30:02,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 18:30:02,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 18:30:02,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 18:30:02,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:30:02" (1/1) ... [2023-12-16 18:30:02,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d2a63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:02, skipping insertion in model container [2023-12-16 18:30:02,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:30:02" (1/1) ... [2023-12-16 18:30:03,164 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 18:30:03,613 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17604,17617] [2023-12-16 18:30:03,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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22921,22934] [2023-12-16 18:30: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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24278,24291] [2023-12-16 18:30:03,691 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25086,25099] [2023-12-16 18:30:03,711 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26814,26827] [2023-12-16 18:30:03,720 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27622,27635] [2023-12-16 18:30:03,727 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28801,28814] [2023-12-16 18:30:03,744 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31541,31554] [2023-12-16 18:30: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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32352,32365] [2023-12-16 18:30:03,755 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33534,33547] [2023-12-16 18:30:03,765 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35725,35738] [2023-12-16 18:30:03,785 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2023-12-16 18:30:03,790 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40796,40809] [2023-12-16 18:30:03,795 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41978,41991] [2023-12-16 18:30:03,821 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44169,44182] [2023-12-16 18:30: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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47880,47893] [2023-12-16 18:30:03,865 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54627,54640] [2023-12-16 18:30:03,870 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55438,55451] [2023-12-16 18:30:03,877 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56581,56594] [2023-12-16 18:30:03,887 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58733,58746] [2023-12-16 18:30:03,911 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62650,62663] [2023-12-16 18:30:03,939 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69599,69612] [2023-12-16 18:30:04,008 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2023-12-16 18:30:04,013 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83146,83159] [2023-12-16 18:30:04,019 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2023-12-16 18:30:04,032 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86519,86532] [2023-12-16 18:30:04,061 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90230,90243] [2023-12-16 18:30:04,093 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96428,96441] [2023-12-16 18:30:04,131 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[107019,107032] [2023-12-16 18:30:04,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:30:04,726 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 18:30:04,845 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17604,17617] [2023-12-16 18:30:04,879 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22921,22934] [2023-12-16 18:30:04,883 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24278,24291] [2023-12-16 18:30:04,887 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25086,25099] [2023-12-16 18:30:04,893 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26814,26827] [2023-12-16 18:30:04,897 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27622,27635] [2023-12-16 18:30:04,901 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28801,28814] [2023-12-16 18:30:04,909 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31541,31554] [2023-12-16 18:30:04,921 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32352,32365] [2023-12-16 18:30:04,926 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33534,33547] [2023-12-16 18:30:04,936 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35725,35738] [2023-12-16 18:30:04,948 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2023-12-16 18:30:05,002 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40796,40809] [2023-12-16 18:30:05,007 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41978,41991] [2023-12-16 18:30:05,019 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44169,44182] [2023-12-16 18:30:05,030 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47880,47893] [2023-12-16 18:30:05,047 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54627,54640] [2023-12-16 18:30:05,051 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55438,55451] [2023-12-16 18:30:05,056 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56581,56594] [2023-12-16 18:30:05,062 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58733,58746] [2023-12-16 18:30:05,073 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62650,62663] [2023-12-16 18:30:05,099 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69599,69612] [2023-12-16 18:30:05,131 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2023-12-16 18:30:05,134 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83146,83159] [2023-12-16 18:30:05,138 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2023-12-16 18:30:05,145 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86519,86532] [2023-12-16 18:30:05,156 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90230,90243] [2023-12-16 18:30:05,172 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96428,96441] [2023-12-16 18:30:05,198 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.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[107019,107032] [2023-12-16 18:30:05,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:30:05,655 INFO L206 MainTranslator]: Completed translation [2023-12-16 18:30:05,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05 WrapperNode [2023-12-16 18:30:05,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 18:30:05,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 18:30:05,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 18:30:05,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 18:30:05,664 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:30:05" (1/1) ... [2023-12-16 18:30:05,743 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:30:05" (1/1) ... [2023-12-16 18:30:05,952 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13485 [2023-12-16 18:30:05,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 18:30:05,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 18:30:05,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 18:30:05,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 18:30:05,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (1/1) ... [2023-12-16 18:30:05,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (1/1) ... [2023-12-16 18:30:05,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (1/1) ... [2023-12-16 18:30:06,089 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:30:06,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (1/1) ... [2023-12-16 18:30:06,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (1/1) ... [2023-12-16 18:30:06,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (1/1) ... [2023-12-16 18:30:06,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (1/1) ... [2023-12-16 18:30:06,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (1/1) ... [2023-12-16 18:30:06,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (1/1) ... [2023-12-16 18:30:06,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 18:30:06,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 18:30:06,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 18:30:06,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 18:30:06,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (1/1) ... [2023-12-16 18:30:06,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:30:06,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 18:30:06,317 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:30:06,343 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:30:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 18:30:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 18:30:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 18:30:06,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 18:30:06,706 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 18:30:06,708 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 18:30:13,720 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 18:30:13,811 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 18:30:13,811 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 18:30:13,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:30:13 BoogieIcfgContainer [2023-12-16 18:30:13,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 18:30:13,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 18:30:13,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 18:30:13,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 18:30:13,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:30:02" (1/3) ... [2023-12-16 18:30:13,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9ee80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:30:13, skipping insertion in model container [2023-12-16 18:30:13,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:05" (2/3) ... [2023-12-16 18:30:13,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9ee80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:30:13, skipping insertion in model container [2023-12-16 18:30:13,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:30:13" (3/3) ... [2023-12-16 18:30:13,819 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2023-12-16 18:30:13,833 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 18:30:13,833 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2023-12-16 18:30:13,904 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 18:30:13,909 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;@210bd636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 18:30:13,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-12-16 18:30:13,920 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:30:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 18:30:13,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:13,943 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:30:13,944 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:30:13,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash -393314146, now seen corresponding path program 1 times [2023-12-16 18:30:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:13,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992850821] [2023-12-16 18:30:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:13,960 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:30:13,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:13,963 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:30:13,976 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:30:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:14,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:30:14,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:15,197 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:30:15,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:15,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992850821] [2023-12-16 18:30:15,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992850821] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:15,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:15,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:30:15,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434665759] [2023-12-16 18:30:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:15,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:30:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:15,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:30:15,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:30:15,233 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:30:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:17,425 INFO L93 Difference]: Finished difference Result 3676 states and 6453 transitions. [2023-12-16 18:30:17,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:30:17,427 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:30:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:17,447 INFO L225 Difference]: With dead ends: 3676 [2023-12-16 18:30:17,447 INFO L226 Difference]: Without dead ends: 2155 [2023-12-16 18:30:17,456 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:30:17,458 INFO L413 NwaCegarLoop]: 1853 mSDtfsCounter, 10067 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10067 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:17,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10067 Valid, 2444 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-16 18:30:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2023-12-16 18:30:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2053. [2023-12-16 18:30:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2024 states have (on average 1.3690711462450593) internal successors, (2771), 2052 states have internal predecessors, (2771), 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:30:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2771 transitions. [2023-12-16 18:30:17,542 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2771 transitions. Word has length 100 [2023-12-16 18:30:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:17,543 INFO L495 AbstractCegarLoop]: Abstraction has 2053 states and 2771 transitions. [2023-12-16 18:30:17,543 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:30:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2771 transitions. [2023-12-16 18:30:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-16 18:30:17,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:17,549 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:30:17,557 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 (2)] Ended with exit code 0 [2023-12-16 18:30:17,754 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:30:17,755 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:30:17,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:17,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1198583076, now seen corresponding path program 1 times [2023-12-16 18:30:17,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:17,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900801405] [2023-12-16 18:30:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:17,756 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:30:17,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:17,757 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:30:17,758 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:30:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:18,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:30:18,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:18,570 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:30:18,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:18,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:18,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900801405] [2023-12-16 18:30:18,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900801405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:18,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:18,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:30:18,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051248179] [2023-12-16 18:30:18,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:18,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:30:18,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:18,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:30:18,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:30:18,573 INFO L87 Difference]: Start difference. First operand 2053 states and 2771 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:30:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:19,631 INFO L93 Difference]: Finished difference Result 3541 states and 4914 transitions. [2023-12-16 18:30:19,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:30:19,631 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:30:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:19,638 INFO L225 Difference]: With dead ends: 3541 [2023-12-16 18:30:19,638 INFO L226 Difference]: Without dead ends: 1800 [2023-12-16 18:30:19,641 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:30:19,642 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 5149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5149 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:19,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5149 Valid, 1019 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 18:30:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2023-12-16 18:30:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1800. [2023-12-16 18:30:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1771 states have (on average 1.4025974025974026) internal successors, (2484), 1799 states have internal predecessors, (2484), 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:30:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2484 transitions. [2023-12-16 18:30:19,674 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2484 transitions. Word has length 101 [2023-12-16 18:30:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:19,674 INFO L495 AbstractCegarLoop]: Abstraction has 1800 states and 2484 transitions. [2023-12-16 18:30:19,674 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:30:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2484 transitions. [2023-12-16 18:30:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-16 18:30:19,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:19,678 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:30:19,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:19,885 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:30:19,886 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:30:19,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:19,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1508928607, now seen corresponding path program 1 times [2023-12-16 18:30:19,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:19,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381020234] [2023-12-16 18:30:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:19,887 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:30:19,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:19,888 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:30:19,890 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:30:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:20,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:30:20,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:20,703 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:30:20,704 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:20,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:20,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381020234] [2023-12-16 18:30:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381020234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:20,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:30:20,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085207984] [2023-12-16 18:30:20,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:20,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:30:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:20,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:30:20,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:30:20,706 INFO L87 Difference]: Start difference. First operand 1800 states and 2484 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:30:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:21,677 INFO L93 Difference]: Finished difference Result 3288 states and 4625 transitions. [2023-12-16 18:30:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:30:21,678 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:30:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:21,684 INFO L225 Difference]: With dead ends: 3288 [2023-12-16 18:30:21,684 INFO L226 Difference]: Without dead ends: 1675 [2023-12-16 18:30:21,687 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:30:21,688 INFO L413 NwaCegarLoop]: 906 mSDtfsCounter, 3155 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3155 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:21,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3155 Valid, 926 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 18:30:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2023-12-16 18:30:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2023-12-16 18:30:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1646 states have (on average 1.422235722964763) internal successors, (2341), 1674 states have internal predecessors, (2341), 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:30:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2341 transitions. [2023-12-16 18:30:21,715 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2341 transitions. Word has length 102 [2023-12-16 18:30:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:21,716 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2341 transitions. [2023-12-16 18:30:21,716 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:30:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2341 transitions. [2023-12-16 18:30:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 18:30:21,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:21,719 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:30:21,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 18:30:21,924 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:30:21,924 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:30:21,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:21,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1210391741, now seen corresponding path program 1 times [2023-12-16 18:30:21,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:21,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681159998] [2023-12-16 18:30:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:21,926 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:30:21,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:21,927 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:30:21,928 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:30:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:22,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:30:22,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:22,710 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:30:22,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:22,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:22,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681159998] [2023-12-16 18:30:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681159998] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:22,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:30:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924325809] [2023-12-16 18:30:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:22,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:30:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:30:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:30:22,712 INFO L87 Difference]: Start difference. First operand 1675 states and 2341 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:30:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:23,599 INFO L93 Difference]: Finished difference Result 3163 states and 4480 transitions. [2023-12-16 18:30:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:30:23,600 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:30:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:23,615 INFO L225 Difference]: With dead ends: 3163 [2023-12-16 18:30:23,615 INFO L226 Difference]: Without dead ends: 1614 [2023-12-16 18:30:23,617 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:30:23,619 INFO L413 NwaCegarLoop]: 847 mSDtfsCounter, 3004 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3004 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:23,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3004 Valid, 875 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 18:30:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2023-12-16 18:30:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2023-12-16 18:30:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1585 states have (on average 1.4321766561514195) internal successors, (2270), 1613 states have internal predecessors, (2270), 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:30:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2270 transitions. [2023-12-16 18:30:23,654 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2270 transitions. Word has length 103 [2023-12-16 18:30:23,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:23,655 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 2270 transitions. [2023-12-16 18:30:23,655 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:30:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2270 transitions. [2023-12-16 18:30:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 18:30:23,657 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:23,658 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:30:23,664 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:30:23,858 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:30:23,858 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:30:23,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash 561178400, now seen corresponding path program 1 times [2023-12-16 18:30:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:23,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467238679] [2023-12-16 18:30:23,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:23,860 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:30:23,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:23,861 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:30:23,863 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:30:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:24,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:30:24,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:24,584 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:30:24,584 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:24,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467238679] [2023-12-16 18:30:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467238679] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:24,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:24,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:30:24,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134284290] [2023-12-16 18:30:24,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:24,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:30:24,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:24,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:30:24,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:30:24,587 INFO L87 Difference]: Start difference. First operand 1614 states and 2270 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:30:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:25,459 INFO L93 Difference]: Finished difference Result 3102 states and 4407 transitions. [2023-12-16 18:30:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:30:25,459 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:30:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:25,465 INFO L225 Difference]: With dead ends: 3102 [2023-12-16 18:30:25,465 INFO L226 Difference]: Without dead ends: 1585 [2023-12-16 18:30:25,467 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:30:25,468 INFO L413 NwaCegarLoop]: 800 mSDtfsCounter, 2921 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2921 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:25,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2921 Valid, 836 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 18:30:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2023-12-16 18:30:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2023-12-16 18:30:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1556 states have (on average 1.436375321336761) internal successors, (2235), 1584 states have internal predecessors, (2235), 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:30:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2235 transitions. [2023-12-16 18:30:25,498 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2235 transitions. Word has length 104 [2023-12-16 18:30:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:25,499 INFO L495 AbstractCegarLoop]: Abstraction has 1585 states and 2235 transitions. [2023-12-16 18:30:25,499 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:30:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2235 transitions. [2023-12-16 18:30:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 18:30:25,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:25,502 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:30:25,510 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:30:25,707 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:30:25,708 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:30:25,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash 654674334, now seen corresponding path program 1 times [2023-12-16 18:30:25,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:25,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654349602] [2023-12-16 18:30:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:25,709 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:30:25,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:25,710 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:30:25,711 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:30:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:26,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:30:26,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:26,409 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:30:26,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:26,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654349602] [2023-12-16 18:30:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654349602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:26,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:26,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:30:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416744321] [2023-12-16 18:30:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:26,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:30:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:30:26,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:30:26,411 INFO L87 Difference]: Start difference. First operand 1585 states and 2235 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:30:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:27,255 INFO L93 Difference]: Finished difference Result 3073 states and 4370 transitions. [2023-12-16 18:30:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:30:27,256 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:30:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:27,259 INFO L225 Difference]: With dead ends: 3073 [2023-12-16 18:30:27,260 INFO L226 Difference]: Without dead ends: 1572 [2023-12-16 18:30:27,262 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:30:27,262 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 2866 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2866 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:27,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2866 Valid, 784 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 18:30:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-12-16 18:30:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2023-12-16 18:30:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.4374594944912509) internal successors, (2218), 1571 states have internal predecessors, (2218), 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:30:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2218 transitions. [2023-12-16 18:30:27,291 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2218 transitions. Word has length 105 [2023-12-16 18:30:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:27,292 INFO L495 AbstractCegarLoop]: Abstraction has 1572 states and 2218 transitions. [2023-12-16 18:30:27,292 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:30:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2218 transitions. [2023-12-16 18:30:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 18:30:27,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:27,295 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:30:27,304 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:30:27,499 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:30:27,500 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:30:27,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash -756882207, now seen corresponding path program 1 times [2023-12-16 18:30:27,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:27,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71361301] [2023-12-16 18:30:27,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:27,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:30:27,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:27,502 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:30:27,503 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:30:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:27,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:30:27,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:28,198 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:30:28,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:28,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:28,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71361301] [2023-12-16 18:30:28,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71361301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:28,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:30:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65866887] [2023-12-16 18:30:28,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:28,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:30:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:28,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:30:28,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:30:28,208 INFO L87 Difference]: Start difference. First operand 1572 states and 2218 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:30:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:29,352 INFO L93 Difference]: Finished difference Result 3060 states and 4351 transitions. [2023-12-16 18:30:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:30:29,352 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:30:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:29,355 INFO L225 Difference]: With dead ends: 3060 [2023-12-16 18:30:29,355 INFO L226 Difference]: Without dead ends: 1567 [2023-12-16 18:30:29,357 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:30:29,358 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 2814 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:29,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2814 Valid, 664 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 18:30:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2023-12-16 18:30:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2023-12-16 18:30:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.436931079323797) internal successors, (2210), 1566 states have internal predecessors, (2210), 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:30:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2210 transitions. [2023-12-16 18:30:29,381 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2210 transitions. Word has length 106 [2023-12-16 18:30:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:29,382 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 2210 transitions. [2023-12-16 18:30:29,382 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:30:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2210 transitions. [2023-12-16 18:30:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 18:30:29,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:29,385 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:30:29,395 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 (8)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:29,589 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:30:29,590 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:30:29,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash 10049727, now seen corresponding path program 1 times [2023-12-16 18:30:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:29,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513971025] [2023-12-16 18:30:29,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:29,591 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:30:29,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:29,591 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:30:29,592 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:30:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:29,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 18:30:29,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:30,378 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:30:30,378 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:30,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513971025] [2023-12-16 18:30:30,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513971025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:30,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:30,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 18:30:30,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255447973] [2023-12-16 18:30:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:30,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 18:30:30,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 18:30:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 18:30:30,380 INFO L87 Difference]: Start difference. First operand 1567 states and 2210 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:30:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:32,836 INFO L93 Difference]: Finished difference Result 2236 states and 3139 transitions. [2023-12-16 18:30:32,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 18:30:32,836 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:30:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:32,840 INFO L225 Difference]: With dead ends: 2236 [2023-12-16 18:30:32,840 INFO L226 Difference]: Without dead ends: 1567 [2023-12-16 18:30:32,840 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:30:32,841 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 5673 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5673 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:32,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5673 Valid, 1277 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-16 18:30:32,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2023-12-16 18:30:32,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2023-12-16 18:30:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4362808842652797) internal successors, (2209), 1566 states have internal predecessors, (2209), 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:30:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2209 transitions. [2023-12-16 18:30:32,862 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2209 transitions. Word has length 107 [2023-12-16 18:30:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:32,863 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 2209 transitions. [2023-12-16 18:30:32,863 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:30:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2209 transitions. [2023-12-16 18:30:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 18:30:32,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:32,866 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:30:32,873 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:30:33,070 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:30:33,070 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:30:33,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1673844547, now seen corresponding path program 1 times [2023-12-16 18:30:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:33,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594918485] [2023-12-16 18:30:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:33,071 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:30:33,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:33,072 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:30:33,074 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:30:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:33,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:33,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:34,033 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:30:34,033 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:34,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:34,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594918485] [2023-12-16 18:30:34,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594918485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:34,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:34,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:34,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951125490] [2023-12-16 18:30:34,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:34,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:34,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:34,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:34,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:34,035 INFO L87 Difference]: Start difference. First operand 1567 states and 2209 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:30:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:37,121 INFO L93 Difference]: Finished difference Result 2005 states and 2855 transitions. [2023-12-16 18:30:37,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:37,121 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:30:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:37,125 INFO L225 Difference]: With dead ends: 2005 [2023-12-16 18:30:37,125 INFO L226 Difference]: Without dead ends: 1737 [2023-12-16 18:30:37,126 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:30:37,126 INFO L413 NwaCegarLoop]: 870 mSDtfsCounter, 4593 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4593 SdHoareTripleChecker+Valid, 3196 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:37,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4593 Valid, 3196 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2627 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-16 18:30:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2023-12-16 18:30:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1567. [2023-12-16 18:30:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.435630689206762) internal successors, (2208), 1566 states have internal predecessors, (2208), 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:30:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2208 transitions. [2023-12-16 18:30:37,153 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2208 transitions. Word has length 107 [2023-12-16 18:30:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:37,153 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 2208 transitions. [2023-12-16 18:30:37,154 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:30:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2208 transitions. [2023-12-16 18:30:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 18:30:37,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:37,157 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:30:37,164 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:30:37,362 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:30:37,363 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:30:37,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:37,363 INFO L85 PathProgramCache]: Analyzing trace with hash 124559761, now seen corresponding path program 1 times [2023-12-16 18:30:37,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:37,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128444713] [2023-12-16 18:30:37,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:37,364 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:30:37,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:37,365 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:30:37,368 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:30:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:37,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:37,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:38,301 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:30:38,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:38,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:38,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128444713] [2023-12-16 18:30:38,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128444713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:38,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:38,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:38,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901931903] [2023-12-16 18:30:38,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:38,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:38,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:38,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:38,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:38,303 INFO L87 Difference]: Start difference. First operand 1567 states and 2208 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:30:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:41,707 INFO L93 Difference]: Finished difference Result 2233 states and 3110 transitions. [2023-12-16 18:30:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 18:30:41,708 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:30:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:41,712 INFO L225 Difference]: With dead ends: 2233 [2023-12-16 18:30:41,712 INFO L226 Difference]: Without dead ends: 1841 [2023-12-16 18:30:41,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-16 18:30:41,714 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 4913 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 2744 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4913 SdHoareTripleChecker+Valid, 3410 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:41,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4913 Valid, 3410 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2744 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-16 18:30:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2023-12-16 18:30:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1567. [2023-12-16 18:30:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4349804941482445) internal successors, (2207), 1566 states have internal predecessors, (2207), 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:30:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2207 transitions. [2023-12-16 18:30:41,740 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2207 transitions. Word has length 107 [2023-12-16 18:30:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:41,740 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 2207 transitions. [2023-12-16 18:30:41,741 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:30:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2207 transitions. [2023-12-16 18:30:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:30:41,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:41,743 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:30:41,752 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:41,948 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:30:41,949 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:30:41,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:41,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1528536076, now seen corresponding path program 1 times [2023-12-16 18:30:41,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553840813] [2023-12-16 18:30:41,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:41,950 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:30:41,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:41,951 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:30:41,951 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:30:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:42,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:42,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:42,943 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:30:42,943 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:42,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:42,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553840813] [2023-12-16 18:30:42,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553840813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:42,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:42,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794327054] [2023-12-16 18:30:42,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:42,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:42,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:42,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:42,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:42,945 INFO L87 Difference]: Start difference. First operand 1567 states and 2207 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:30:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:46,072 INFO L93 Difference]: Finished difference Result 1957 states and 2782 transitions. [2023-12-16 18:30:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:46,073 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:30:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:46,077 INFO L225 Difference]: With dead ends: 1957 [2023-12-16 18:30:46,077 INFO L226 Difference]: Without dead ends: 1737 [2023-12-16 18:30:46,078 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:30:46,079 INFO L413 NwaCegarLoop]: 889 mSDtfsCounter, 3306 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3306 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:46,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3306 Valid, 3313 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2707 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-16 18:30:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2023-12-16 18:30:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1567. [2023-12-16 18:30:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4343302990897269) internal successors, (2206), 1566 states have internal predecessors, (2206), 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:30:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2206 transitions. [2023-12-16 18:30:46,106 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2206 transitions. Word has length 109 [2023-12-16 18:30:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:46,106 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 2206 transitions. [2023-12-16 18:30:46,106 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:30:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2206 transitions. [2023-12-16 18:30:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:30:46,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:46,109 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:30:46,116 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 (12)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:46,314 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:30:46,315 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:30:46,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash -473795284, now seen corresponding path program 1 times [2023-12-16 18:30:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:46,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423847210] [2023-12-16 18:30:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:46,316 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:30:46,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:46,317 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:30:46,317 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:30:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:46,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:46,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:47,297 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:30:47,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:47,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:47,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423847210] [2023-12-16 18:30:47,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423847210] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:47,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:47,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:47,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161309459] [2023-12-16 18:30:47,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:47,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:47,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:47,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:47,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:47,298 INFO L87 Difference]: Start difference. First operand 1567 states and 2206 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:30:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:50,314 INFO L93 Difference]: Finished difference Result 2026 states and 2873 transitions. [2023-12-16 18:30:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:50,315 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:30:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:50,319 INFO L225 Difference]: With dead ends: 2026 [2023-12-16 18:30:50,319 INFO L226 Difference]: Without dead ends: 1737 [2023-12-16 18:30:50,319 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:30:50,320 INFO L413 NwaCegarLoop]: 895 mSDtfsCounter, 4829 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4829 SdHoareTripleChecker+Valid, 3242 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:50,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4829 Valid, 3242 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2628 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-16 18:30:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2023-12-16 18:30:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1567. [2023-12-16 18:30:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4336801040312093) internal successors, (2205), 1566 states have internal predecessors, (2205), 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:30:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2205 transitions. [2023-12-16 18:30:50,355 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2205 transitions. Word has length 109 [2023-12-16 18:30:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:50,355 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 2205 transitions. [2023-12-16 18:30:50,356 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:30:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2205 transitions. [2023-12-16 18:30:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:30:50,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:50,358 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:30:50,365 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:30:50,559 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:30:50,559 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:30:50,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1344450106, now seen corresponding path program 1 times [2023-12-16 18:30:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:50,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512056428] [2023-12-16 18:30:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:50,560 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:30:50,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:50,561 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:30:50,562 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:30:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:50,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:50,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:51,538 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:30:51,538 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:51,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:51,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512056428] [2023-12-16 18:30:51,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512056428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:51,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:51,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:51,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434289835] [2023-12-16 18:30:51,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:51,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:51,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:51,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:51,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:51,539 INFO L87 Difference]: Start difference. First operand 1567 states and 2205 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:30:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:54,536 INFO L93 Difference]: Finished difference Result 1957 states and 2779 transitions. [2023-12-16 18:30:54,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:54,537 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:30:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:54,541 INFO L225 Difference]: With dead ends: 1957 [2023-12-16 18:30:54,541 INFO L226 Difference]: Without dead ends: 1737 [2023-12-16 18:30:54,541 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:30:54,542 INFO L413 NwaCegarLoop]: 889 mSDtfsCounter, 4688 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:54,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 3317 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-16 18:30:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2023-12-16 18:30:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1567. [2023-12-16 18:30:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.433029908972692) internal successors, (2204), 1566 states have internal predecessors, (2204), 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:30:54,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2204 transitions. [2023-12-16 18:30:54,567 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2204 transitions. Word has length 109 [2023-12-16 18:30:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:54,568 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 2204 transitions. [2023-12-16 18:30:54,568 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:30:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2204 transitions. [2023-12-16 18:30:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:30:54,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:54,571 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:30:54,579 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:30:54,776 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:30:54,777 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:30:54,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1668784820, now seen corresponding path program 1 times [2023-12-16 18:30:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:54,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613077042] [2023-12-16 18:30:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:54,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:30:54,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:54,779 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:30:54,780 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:30:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:55,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:55,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:55,762 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:30:55,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:55,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:55,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613077042] [2023-12-16 18:30:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613077042] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:55,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390953687] [2023-12-16 18:30:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:55,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:55,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:55,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:55,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:55,765 INFO L87 Difference]: Start difference. First operand 1567 states and 2204 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:30:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:58,789 INFO L93 Difference]: Finished difference Result 1950 states and 2772 transitions. [2023-12-16 18:30:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:58,789 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:30:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:58,793 INFO L225 Difference]: With dead ends: 1950 [2023-12-16 18:30:58,793 INFO L226 Difference]: Without dead ends: 1737 [2023-12-16 18:30:58,793 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:30:58,794 INFO L413 NwaCegarLoop]: 868 mSDtfsCounter, 3340 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2679 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3340 SdHoareTripleChecker+Valid, 3261 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.9s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:58,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3340 Valid, 3261 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2679 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-16 18:30:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2023-12-16 18:30:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1567. [2023-12-16 18:30:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4323797139141743) internal successors, (2203), 1566 states have internal predecessors, (2203), 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:30:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2203 transitions. [2023-12-16 18:30:58,814 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2203 transitions. Word has length 109 [2023-12-16 18:30:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:58,814 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 2203 transitions. [2023-12-16 18:30:58,814 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:30:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2203 transitions. [2023-12-16 18:30:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 18:30:58,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:58,817 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:30:58,824 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 (15)] Ended with exit code 0 [2023-12-16 18:30:59,022 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:30:59,022 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:30:59,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash 395359209, now seen corresponding path program 1 times [2023-12-16 18:30:59,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:59,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591793527] [2023-12-16 18:30:59,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:59,023 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:30:59,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:59,024 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:30:59,025 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:30:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:59,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:59,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-12-16 18:30:59,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (28 of 29 remaining) [2023-12-16 18:30:59,911 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 (16)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:59,922 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:30:59,927 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 (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 18:31:00,103 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:00,103 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. [2023-12-16 18:31:00,105 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2023-12-16 18:31:00,105 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2023-12-16 18:31:00,105 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2023-12-16 18:31:00,105 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2023-12-16 18:31:00,105 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2023-12-16 18:31:00,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2023-12-16 18:31:00,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2023-12-16 18:31:00,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2023-12-16 18:31:00,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2023-12-16 18:31:00,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2023-12-16 18:31:00,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2023-12-16 18:31:00,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2023-12-16 18:31:00,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2023-12-16 18:31:00,107 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2023-12-16 18:31:00,107 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2023-12-16 18:31:00,107 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2023-12-16 18:31:00,107 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2023-12-16 18:31:00,107 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2023-12-16 18:31:00,107 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2023-12-16 18:31:00,107 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2023-12-16 18:31:00,107 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2023-12-16 18:31:00,107 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2023-12-16 18:31:00,108 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2023-12-16 18:31:00,108 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2023-12-16 18:31:00,108 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2023-12-16 18:31:00,108 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2023-12-16 18:31:00,108 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2023-12-16 18:31:00,108 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2023-12-16 18:31:00,115 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:31:00,119 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 18:31:00,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:31:00 BoogieIcfgContainer [2023-12-16 18:31:00,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 18:31:00,123 INFO L158 Benchmark]: Toolchain (without parser) took 57217.24ms. Allocated memory was 188.7MB in the beginning and 719.3MB in the end (delta: 530.6MB). Free memory was 127.3MB in the beginning and 315.4MB in the end (delta: -188.1MB). Peak memory consumption was 342.9MB. Max. memory is 8.0GB. [2023-12-16 18:31:00,123 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 188.7MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 18:31:00,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2749.39ms. Allocated memory was 188.7MB in the beginning and 254.8MB in the end (delta: 66.1MB). Free memory was 126.8MB in the beginning and 118.7MB in the end (delta: 8.1MB). Peak memory consumption was 131.1MB. Max. memory is 8.0GB. [2023-12-16 18:31:00,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 294.52ms. Allocated memory is still 254.8MB. Free memory was 118.7MB in the beginning and 169.3MB in the end (delta: -50.5MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. [2023-12-16 18:31:00,125 INFO L158 Benchmark]: Boogie Preprocessor took 328.54ms. Allocated memory is still 254.8MB. Free memory was 169.3MB in the beginning and 117.4MB in the end (delta: 51.9MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. [2023-12-16 18:31:00,125 INFO L158 Benchmark]: RCFGBuilder took 7528.76ms. Allocated memory was 254.8MB in the beginning and 456.1MB in the end (delta: 201.3MB). Free memory was 117.4MB in the beginning and 170.7MB in the end (delta: -53.3MB). Peak memory consumption was 175.8MB. Max. memory is 8.0GB. [2023-12-16 18:31:00,125 INFO L158 Benchmark]: TraceAbstraction took 46308.68ms. Allocated memory was 456.1MB in the beginning and 719.3MB in the end (delta: 263.2MB). Free memory was 169.7MB in the beginning and 315.4MB in the end (delta: -145.7MB). Peak memory consumption was 117.0MB. Max. memory is 8.0GB. [2023-12-16 18:31:00,127 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.57ms. Allocated memory is still 188.7MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2749.39ms. Allocated memory was 188.7MB in the beginning and 254.8MB in the end (delta: 66.1MB). Free memory was 126.8MB in the beginning and 118.7MB in the end (delta: 8.1MB). Peak memory consumption was 131.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 294.52ms. Allocated memory is still 254.8MB. Free memory was 118.7MB in the beginning and 169.3MB in the end (delta: -50.5MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 328.54ms. Allocated memory is still 254.8MB. Free memory was 169.3MB in the beginning and 117.4MB in the end (delta: 51.9MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. * RCFGBuilder took 7528.76ms. Allocated memory was 254.8MB in the beginning and 456.1MB in the end (delta: 201.3MB). Free memory was 117.4MB in the beginning and 170.7MB in the end (delta: -53.3MB). Peak memory consumption was 175.8MB. Max. memory is 8.0GB. * TraceAbstraction took 46308.68ms. Allocated memory was 456.1MB in the beginning and 719.3MB in the end (delta: 263.2MB). Free memory was 169.7MB in the beginning and 315.4MB in the end (delta: -145.7MB). Peak memory consumption was 117.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 3747]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3747). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 924]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 924). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1360]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1360). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1456]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1456). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1511]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1511). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1635]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1635). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1690]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1690). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1773]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1773). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1966]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1966). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 2021]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2021). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 2104]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2104). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 2256]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2256). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 2560]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2560). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 2615]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2615). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 2698]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2698). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 2850]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2850). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 3113]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3113). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 3610]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3610). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 3665]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3665). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 3898]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3898). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 4174]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4174). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 4673]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4673). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 5614]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5614). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 5669]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5669). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 5752]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5752). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 5904]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5904). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 6167]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6167). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 6623]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6623). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 7434]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 7434). Cancelled while NwaCegarLoop was analyzing trace of length 110 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2080 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 46.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 29.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61318 SdHoareTripleChecker+Valid, 27.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61318 mSDsluCounter, 28564 SdHoareTripleChecker+Invalid, 24.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15953 mSDsCounter, 243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23659 IncrementalHoareTripleChecker+Invalid, 23902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 243 mSolverCounterUnsat, 12611 mSDtfsCounter, 23659 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1519 GetRequests, 1402 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2080occurred in iteration=0, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1226 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1478 NumberOfCodeBlocks, 1478 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1464 ConstructedInterpolants, 878 QuantifiedInterpolants, 17466 SizeOfPredicates, 56 NumberOfNonLiveVariables, 6591 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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