/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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 10:11:18,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 10:11:18,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 10:11:18,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 10:11:18,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 10:11:18,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 10:11:18,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 10:11:18,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 10:11:18,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 10:11:18,358 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 10:11:18,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 10:11:18,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 10:11:18,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 10:11:18,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 10:11:18,359 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 10:11:18,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 10:11:18,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 10:11:18,360 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 10:11:18,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 10:11:18,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 10:11:18,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 10:11:18,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 10:11:18,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 10:11:18,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 10:11:18,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 10:11:18,362 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 10:11:18,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 10:11:18,362 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 10:11:18,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 10:11:18,363 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 10:11:18,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 10:11:18,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 10:11:18,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 10:11:18,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 10:11:18,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 10:11:18,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 10:11:18,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 10:11:18,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 10:11:18,365 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 10:11:18,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 10:11:18,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 10:11:18,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 10:11:18,366 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 10:11:18,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 10:11:18,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 10:11:18,366 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 10:11:18,366 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 10:11:18,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 10:11:18,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 10:11:18,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 10:11:18,585 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 10:11:18,585 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 10:11:18,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2023-12-25 10:11:19,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 10:11:19,937 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 10:11:19,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2023-12-25 10:11:19,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88fa88b75/f8ce845568c74c838a90c88d6de63a8f/FLAGee0008661 [2023-12-25 10:11:19,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88fa88b75/f8ce845568c74c838a90c88d6de63a8f [2023-12-25 10:11:19,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 10:11:19,963 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 10:11:19,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 10:11:19,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 10:11:19,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 10:11:19,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 10:11:19" (1/1) ... [2023-12-25 10:11:19,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d9b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:19, skipping insertion in model container [2023-12-25 10:11:19,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 10:11:19" (1/1) ... [2023-12-25 10:11:20,035 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 10:11:20,240 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9419,9432] [2023-12-25 10:11:20,270 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12891,12904] [2023-12-25 10:11:20,293 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14047,14060] [2023-12-25 10:11:20,296 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14703,14716] [2023-12-25 10:11:20,301 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16224,16237] [2023-12-25 10:11:20,304 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16880,16893] [2023-12-25 10:11:20,308 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17864,17877] [2023-12-25 10:11:20,327 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20202,20215] [2023-12-25 10:11:20,330 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20861,20874] [2023-12-25 10:11:20,333 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21885,21898] [2023-12-25 10:11:20,352 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23760,23773] [2023-12-25 10:11:20,425 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 10:11:20,443 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 10:11:20,546 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9419,9432] [2023-12-25 10:11:20,564 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12891,12904] [2023-12-25 10:11:20,568 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14047,14060] [2023-12-25 10:11:20,571 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14703,14716] [2023-12-25 10:11:20,581 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16224,16237] [2023-12-25 10:11:20,585 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16880,16893] [2023-12-25 10:11:20,592 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17864,17877] [2023-12-25 10:11:20,602 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20202,20215] [2023-12-25 10:11:20,607 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20861,20874] [2023-12-25 10:11:20,610 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21885,21898] [2023-12-25 10:11:20,616 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23760,23773] [2023-12-25 10:11:20,679 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 10:11:20,690 INFO L206 MainTranslator]: Completed translation [2023-12-25 10:11:20,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20 WrapperNode [2023-12-25 10:11:20,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 10:11:20,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 10:11:20,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 10:11:20,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 10:11:20,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,771 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2003 [2023-12-25 10:11:20,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 10:11:20,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 10:11:20,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 10:11:20,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 10:11:20,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,802 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-25 10:11:20,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 10:11:20,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 10:11:20,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 10:11:20,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 10:11:20,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (1/1) ... [2023-12-25 10:11:20,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 10:11:20,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 10:11:20,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 10:11:20,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 10:11:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 10:11:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 10:11:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 10:11:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 10:11:21,059 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 10:11:21,060 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 10:11:22,177 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 10:11:22,202 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 10:11:22,202 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 10:11:22,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 10:11:22 BoogieIcfgContainer [2023-12-25 10:11:22,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 10:11:22,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 10:11:22,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 10:11:22,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 10:11:22,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 10:11:19" (1/3) ... [2023-12-25 10:11:22,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354d3406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 10:11:22, skipping insertion in model container [2023-12-25 10:11:22,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:11:20" (2/3) ... [2023-12-25 10:11:22,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354d3406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 10:11:22, skipping insertion in model container [2023-12-25 10:11:22,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 10:11:22" (3/3) ... [2023-12-25 10:11:22,208 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2023-12-25 10:11:22,222 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 10:11:22,222 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-12-25 10:11:22,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 10:11:22,285 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;@265de784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 10:11:22,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-12-25 10:11:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 356 states, 344 states have (on average 1.8430232558139534) internal successors, (634), 355 states have internal predecessors, (634), 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-25 10:11:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 10:11:22,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:22,312 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] [2023-12-25 10:11:22,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:22,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash -972469851, now seen corresponding path program 1 times [2023-12-25 10:11:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:22,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382467718] [2023-12-25 10:11:22,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:22,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:22,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:22,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:22,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 10:11:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:22,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:11:22,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:22,956 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:22,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:22,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382467718] [2023-12-25 10:11:22,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382467718] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:22,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:11:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066856756] [2023-12-25 10:11:22,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:22,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:11:22,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:11:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:11:22,986 INFO L87 Difference]: Start difference. First operand has 356 states, 344 states have (on average 1.8430232558139534) internal successors, (634), 355 states have internal predecessors, (634), 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 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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-25 10:11:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:23,262 INFO L93 Difference]: Finished difference Result 565 states and 969 transitions. [2023-12-25 10:11:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 10:11:23,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2023-12-25 10:11:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:23,278 INFO L225 Difference]: With dead ends: 565 [2023-12-25 10:11:23,278 INFO L226 Difference]: Without dead ends: 293 [2023-12-25 10:11:23,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-25 10:11:23,286 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 962 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:23,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 349 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 10:11:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-12-25 10:11:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2023-12-25 10:11:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 282 states have (on average 1.297872340425532) internal successors, (366), 292 states have internal predecessors, (366), 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-25 10:11:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 366 transitions. [2023-12-25 10:11:23,335 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 366 transitions. Word has length 58 [2023-12-25 10:11:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:23,335 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 366 transitions. [2023-12-25 10:11:23,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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-25 10:11:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 366 transitions. [2023-12-25 10:11:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 10:11:23,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:23,338 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] [2023-12-25 10:11:23,342 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-25 10:11:23,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:23,542 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:23,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1746385456, now seen corresponding path program 1 times [2023-12-25 10:11:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:23,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408477836] [2023-12-25 10:11:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:23,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:23,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:23,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 10:11:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:23,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:11:23,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:23,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:23,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:23,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408477836] [2023-12-25 10:11:23,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408477836] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:23,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:23,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:11:23,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286644818] [2023-12-25 10:11:23,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:23,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:11:23,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:23,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:11:23,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:11:23,829 INFO L87 Difference]: Start difference. First operand 293 states and 366 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-25 10:11:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:23,988 INFO L93 Difference]: Finished difference Result 496 states and 635 transitions. [2023-12-25 10:11:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 10:11:23,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2023-12-25 10:11:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:23,990 INFO L225 Difference]: With dead ends: 496 [2023-12-25 10:11:23,990 INFO L226 Difference]: Without dead ends: 264 [2023-12-25 10:11:23,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-25 10:11:23,991 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 623 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:23,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 207 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:11:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-12-25 10:11:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2023-12-25 10:11:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 253 states have (on average 1.3122529644268774) internal successors, (332), 263 states have internal predecessors, (332), 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-25 10:11:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 332 transitions. [2023-12-25 10:11:23,998 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 332 transitions. Word has length 59 [2023-12-25 10:11:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:23,998 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 332 transitions. [2023-12-25 10:11:23,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-25 10:11:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 332 transitions. [2023-12-25 10:11:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 10:11:24,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:24,000 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] [2023-12-25 10:11:24,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 10:11:24,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:24,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:24,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1577617572, now seen corresponding path program 1 times [2023-12-25 10:11:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828315386] [2023-12-25 10:11:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:24,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:24,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:24,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:24,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 10:11:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:24,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:11:24,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:24,512 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:24,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:24,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828315386] [2023-12-25 10:11:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828315386] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:24,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:11:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482433781] [2023-12-25 10:11:24,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:24,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:11:24,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:24,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:11:24,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:11:24,514 INFO L87 Difference]: Start difference. First operand 264 states and 332 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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-25 10:11:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:24,671 INFO L93 Difference]: Finished difference Result 467 states and 600 transitions. [2023-12-25 10:11:24,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 10:11:24,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2023-12-25 10:11:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:24,672 INFO L225 Difference]: With dead ends: 467 [2023-12-25 10:11:24,672 INFO L226 Difference]: Without dead ends: 251 [2023-12-25 10:11:24,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-25 10:11:24,673 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 582 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:24,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 198 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:11:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-25 10:11:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2023-12-25 10:11:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.3166666666666667) internal successors, (316), 250 states have internal predecessors, (316), 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-25 10:11:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 316 transitions. [2023-12-25 10:11:24,678 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 316 transitions. Word has length 60 [2023-12-25 10:11:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:24,678 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 316 transitions. [2023-12-25 10:11:24,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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-25 10:11:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 316 transitions. [2023-12-25 10:11:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 10:11:24,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:24,680 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] [2023-12-25 10:11:24,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 10:11:24,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:24,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:24,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash -604190513, now seen corresponding path program 1 times [2023-12-25 10:11:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:24,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189040761] [2023-12-25 10:11:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:24,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:24,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:24,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:24,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 10:11:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:25,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:11:25,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:25,174 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:25,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:25,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189040761] [2023-12-25 10:11:25,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189040761] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:25,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:25,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:11:25,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868306578] [2023-12-25 10:11:25,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:25,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:11:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:11:25,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:11:25,175 INFO L87 Difference]: Start difference. First operand 251 states and 316 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-25 10:11:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:25,352 INFO L93 Difference]: Finished difference Result 454 states and 583 transitions. [2023-12-25 10:11:25,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 10:11:25,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2023-12-25 10:11:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:25,353 INFO L225 Difference]: With dead ends: 454 [2023-12-25 10:11:25,353 INFO L226 Difference]: Without dead ends: 246 [2023-12-25 10:11:25,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 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-25 10:11:25,354 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 557 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:25,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 189 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 10:11:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-12-25 10:11:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2023-12-25 10:11:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 245 states have internal predecessors, (309), 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-25 10:11:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 309 transitions. [2023-12-25 10:11:25,358 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 309 transitions. Word has length 61 [2023-12-25 10:11:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:25,359 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 309 transitions. [2023-12-25 10:11:25,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-25 10:11:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 309 transitions. [2023-12-25 10:11:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 10:11:25,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:25,360 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] [2023-12-25 10:11:25,365 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-25 10:11:25,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:25,565 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:25,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:25,566 INFO L85 PathProgramCache]: Analyzing trace with hash -617130845, now seen corresponding path program 1 times [2023-12-25 10:11:25,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:25,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403683329] [2023-12-25 10:11:25,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:25,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:25,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:25,567 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:25,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 10:11:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:25,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:11:25,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:26,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:26,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403683329] [2023-12-25 10:11:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403683329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:26,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:26,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:11:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12340896] [2023-12-25 10:11:26,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:26,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:11:26,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:26,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:11:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:11:26,117 INFO L87 Difference]: Start difference. First operand 246 states and 309 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 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-25 10:11:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:26,996 INFO L93 Difference]: Finished difference Result 388 states and 509 transitions. [2023-12-25 10:11:26,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:11:26,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 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 62 [2023-12-25 10:11:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:27,000 INFO L225 Difference]: With dead ends: 388 [2023-12-25 10:11:27,000 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 10:11:27,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 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-25 10:11:27,001 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 1098 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:27,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 714 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 10:11:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 10:11:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2023-12-25 10:11:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 245 states have internal predecessors, (308), 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-25 10:11:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 308 transitions. [2023-12-25 10:11:27,005 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 308 transitions. Word has length 62 [2023-12-25 10:11:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:27,005 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 308 transitions. [2023-12-25 10:11:27,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 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-25 10:11:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 308 transitions. [2023-12-25 10:11:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 10:11:27,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:27,007 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] [2023-12-25 10:11:27,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 10:11:27,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:27,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:27,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1025976073, now seen corresponding path program 1 times [2023-12-25 10:11:27,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:27,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387516635] [2023-12-25 10:11:27,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:27,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:27,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:27,214 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-25 10:11:27,215 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-25 10:11:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:27,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:11:27,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:27,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:27,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387516635] [2023-12-25 10:11:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387516635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:27,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:27,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:11:27,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630632281] [2023-12-25 10:11:27,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:27,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:11:27,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:27,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:11:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:11:27,713 INFO L87 Difference]: Start difference. First operand 246 states and 308 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 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-25 10:11:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:28,472 INFO L93 Difference]: Finished difference Result 366 states and 480 transitions. [2023-12-25 10:11:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:11:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 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 62 [2023-12-25 10:11:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:28,474 INFO L225 Difference]: With dead ends: 366 [2023-12-25 10:11:28,474 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 10:11:28,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 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-25 10:11:28,475 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 1046 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:28,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 736 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 10:11:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 10:11:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2023-12-25 10:11:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3063829787234043) internal successors, (307), 245 states have internal predecessors, (307), 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-25 10:11:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 307 transitions. [2023-12-25 10:11:28,478 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 307 transitions. Word has length 62 [2023-12-25 10:11:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:28,479 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 307 transitions. [2023-12-25 10:11:28,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 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-25 10:11:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 307 transitions. [2023-12-25 10:11:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 10:11:28,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:28,479 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] [2023-12-25 10:11:28,483 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-25 10:11:28,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:28,680 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:28,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:28,680 INFO L85 PathProgramCache]: Analyzing trace with hash 762232665, now seen corresponding path program 1 times [2023-12-25 10:11:28,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:28,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147462269] [2023-12-25 10:11:28,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:28,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:28,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:28,683 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:28,716 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-25 10:11:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:28,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 10:11:28,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:29,085 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:29,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:29,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147462269] [2023-12-25 10:11:29,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147462269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:29,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:29,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 10:11:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956557406] [2023-12-25 10:11:29,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:29,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 10:11:29,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:29,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 10:11:29,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:11:29,086 INFO L87 Difference]: Start difference. First operand 246 states and 307 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 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-25 10:11:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:29,495 INFO L93 Difference]: Finished difference Result 379 states and 481 transitions. [2023-12-25 10:11:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 10:11:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 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 62 [2023-12-25 10:11:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:29,496 INFO L225 Difference]: With dead ends: 379 [2023-12-25 10:11:29,496 INFO L226 Difference]: Without dead ends: 246 [2023-12-25 10:11:29,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 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-25 10:11:29,497 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 833 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:29,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 348 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:11:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-12-25 10:11:29,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2023-12-25 10:11:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 245 states have internal predecessors, (306), 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-25 10:11:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 306 transitions. [2023-12-25 10:11:29,501 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 306 transitions. Word has length 62 [2023-12-25 10:11:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:29,501 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 306 transitions. [2023-12-25 10:11:29,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 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-25 10:11:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 306 transitions. [2023-12-25 10:11:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 10:11:29,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:29,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] [2023-12-25 10:11:29,505 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-25 10:11:29,705 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-25 10:11:29,707 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:29,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:29,710 INFO L85 PathProgramCache]: Analyzing trace with hash 350648810, now seen corresponding path program 1 times [2023-12-25 10:11:29,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:29,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384883519] [2023-12-25 10:11:29,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:29,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:29,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:29,712 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-25 10:11:29,713 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-25 10:11:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:29,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:11:29,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:30,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:30,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:30,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384883519] [2023-12-25 10:11:30,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384883519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:30,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:30,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:11:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337195518] [2023-12-25 10:11:30,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:30,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:11:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:11:30,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:11:30,210 INFO L87 Difference]: Start difference. First operand 246 states and 306 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:31,024 INFO L93 Difference]: Finished difference Result 359 states and 469 transitions. [2023-12-25 10:11:31,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:11:31,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2023-12-25 10:11:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:31,026 INFO L225 Difference]: With dead ends: 359 [2023-12-25 10:11:31,026 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 10:11:31,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 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-25 10:11:31,026 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 743 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:31,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 767 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 10:11:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 10:11:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2023-12-25 10:11:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.297872340425532) internal successors, (305), 245 states have internal predecessors, (305), 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-25 10:11:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 305 transitions. [2023-12-25 10:11:31,030 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 305 transitions. Word has length 64 [2023-12-25 10:11:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:31,030 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 305 transitions. [2023-12-25 10:11:31,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 305 transitions. [2023-12-25 10:11:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 10:11:31,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:31,031 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] [2023-12-25 10:11:31,036 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 (9)] Ended with exit code 0 [2023-12-25 10:11:31,233 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-25 10:11:31,234 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:31,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:31,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2032121384, now seen corresponding path program 1 times [2023-12-25 10:11:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:31,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149636289] [2023-12-25 10:11:31,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:31,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:31,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:31,236 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-25 10:11:31,239 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-25 10:11:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:31,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:11:31,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:31,698 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:31,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:31,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149636289] [2023-12-25 10:11:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149636289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:31,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:11:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185110606] [2023-12-25 10:11:31,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:31,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:11:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:31,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:11:31,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:11:31,699 INFO L87 Difference]: Start difference. First operand 246 states and 305 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:32,450 INFO L93 Difference]: Finished difference Result 371 states and 482 transitions. [2023-12-25 10:11:32,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:11:32,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2023-12-25 10:11:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:32,452 INFO L225 Difference]: With dead ends: 371 [2023-12-25 10:11:32,452 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 10:11:32,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 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-25 10:11:32,453 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 745 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:32,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 775 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 10:11:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 10:11:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2023-12-25 10:11:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2936170212765958) internal successors, (304), 245 states have internal predecessors, (304), 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-25 10:11:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 304 transitions. [2023-12-25 10:11:32,456 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 304 transitions. Word has length 64 [2023-12-25 10:11:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:32,457 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 304 transitions. [2023-12-25 10:11:32,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 304 transitions. [2023-12-25 10:11:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 10:11:32,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:32,458 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] [2023-12-25 10:11:32,481 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 (10)] Ended with exit code 0 [2023-12-25 10:11:32,661 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-25 10:11:32,661 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:32,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash 861544116, now seen corresponding path program 1 times [2023-12-25 10:11:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:32,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000785854] [2023-12-25 10:11:32,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:32,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:32,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:32,663 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-25 10:11:32,665 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-25 10:11:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:32,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:11:32,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:33,185 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:33,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000785854] [2023-12-25 10:11:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000785854] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:33,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:33,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:11:33,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008306144] [2023-12-25 10:11:33,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:33,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:11:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:33,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:11:33,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:11:33,186 INFO L87 Difference]: Start difference. First operand 246 states and 304 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:33,937 INFO L93 Difference]: Finished difference Result 356 states and 464 transitions. [2023-12-25 10:11:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:11:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2023-12-25 10:11:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:33,939 INFO L225 Difference]: With dead ends: 356 [2023-12-25 10:11:33,939 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 10:11:33,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 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-25 10:11:33,939 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 759 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:33,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 735 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 10:11:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 10:11:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2023-12-25 10:11:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2893617021276595) internal successors, (303), 245 states have internal predecessors, (303), 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-25 10:11:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 303 transitions. [2023-12-25 10:11:33,943 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 303 transitions. Word has length 64 [2023-12-25 10:11:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:33,943 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 303 transitions. [2023-12-25 10:11:33,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 303 transitions. [2023-12-25 10:11:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 10:11:33,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:33,944 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] [2023-12-25 10:11:33,947 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-25 10:11:34,144 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-25 10:11:34,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:34,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:34,145 INFO L85 PathProgramCache]: Analyzing trace with hash -404487765, now seen corresponding path program 1 times [2023-12-25 10:11:34,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:34,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515295769] [2023-12-25 10:11:34,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:34,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:34,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:34,146 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-25 10:11:34,148 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-25 10:11:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:34,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:11:34,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:34,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:34,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515295769] [2023-12-25 10:11:34,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515295769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:34,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:11:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854639910] [2023-12-25 10:11:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:34,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:11:34,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:34,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:11:34,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:11:34,573 INFO L87 Difference]: Start difference. First operand 246 states and 303 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:35,293 INFO L93 Difference]: Finished difference Result 305 states and 386 transitions. [2023-12-25 10:11:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:11:35,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2023-12-25 10:11:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:35,294 INFO L225 Difference]: With dead ends: 305 [2023-12-25 10:11:35,294 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 10:11:35,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 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-25 10:11:35,295 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 932 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:35,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 768 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 10:11:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 10:11:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2023-12-25 10:11:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 245 states have internal predecessors, (302), 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-25 10:11:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 302 transitions. [2023-12-25 10:11:35,298 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 302 transitions. Word has length 64 [2023-12-25 10:11:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:35,299 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 302 transitions. [2023-12-25 10:11:35,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 302 transitions. [2023-12-25 10:11:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 10:11:35,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:35,299 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] [2023-12-25 10:11:35,311 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-25 10:11:35,502 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-25 10:11:35,502 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:35,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:35,502 INFO L85 PathProgramCache]: Analyzing trace with hash 334726124, now seen corresponding path program 1 times [2023-12-25 10:11:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489365626] [2023-12-25 10:11:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:35,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:35,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:35,504 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-25 10:11:35,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 10:11:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:35,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:11:35,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:35,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:35,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:35,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489365626] [2023-12-25 10:11:35,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489365626] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:35,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:35,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:11:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183665187] [2023-12-25 10:11:35,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:35,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:11:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:35,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:11:35,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:11:35,925 INFO L87 Difference]: Start difference. First operand 246 states and 302 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:36,590 INFO L93 Difference]: Finished difference Result 394 states and 507 transitions. [2023-12-25 10:11:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:11:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2023-12-25 10:11:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:36,593 INFO L225 Difference]: With dead ends: 394 [2023-12-25 10:11:36,593 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 10:11:36,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 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-25 10:11:36,594 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 1038 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:36,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 750 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 10:11:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 10:11:36,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2023-12-25 10:11:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2808510638297872) internal successors, (301), 245 states have internal predecessors, (301), 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-25 10:11:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 301 transitions. [2023-12-25 10:11:36,597 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 301 transitions. Word has length 64 [2023-12-25 10:11:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:36,597 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 301 transitions. [2023-12-25 10:11:36,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 301 transitions. [2023-12-25 10:11:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 10:11:36,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:36,598 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] [2023-12-25 10:11:36,609 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-25 10:11:36,807 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-25 10:11:36,807 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:36,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1265909968, now seen corresponding path program 1 times [2023-12-25 10:11:36,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:36,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64148654] [2023-12-25 10:11:36,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:36,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:36,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:36,810 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-25 10:11:36,810 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-25 10:11:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:36,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:11:36,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:37,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:37,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:37,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64148654] [2023-12-25 10:11:37,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64148654] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:37,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:37,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:11:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548904915] [2023-12-25 10:11:37,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:37,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:11:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:37,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:11:37,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:11:37,287 INFO L87 Difference]: Start difference. First operand 246 states and 301 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:37,978 INFO L93 Difference]: Finished difference Result 305 states and 384 transitions. [2023-12-25 10:11:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:11:37,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2023-12-25 10:11:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:37,979 INFO L225 Difference]: With dead ends: 305 [2023-12-25 10:11:37,979 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 10:11:37,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-25 10:11:37,980 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 730 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:37,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 768 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 10:11:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 10:11:37,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2023-12-25 10:11:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2765957446808511) internal successors, (300), 245 states have internal predecessors, (300), 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-25 10:11:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 300 transitions. [2023-12-25 10:11:37,983 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 300 transitions. Word has length 64 [2023-12-25 10:11:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:37,983 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 300 transitions. [2023-12-25 10:11:37,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 300 transitions. [2023-12-25 10:11:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 10:11:37,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:37,984 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] [2023-12-25 10:11:38,002 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-25 10:11:38,187 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-25 10:11:38,187 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:38,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 646287134, now seen corresponding path program 1 times [2023-12-25 10:11:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:38,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775613345] [2023-12-25 10:11:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:38,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:38,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:38,189 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-25 10:11:38,240 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-25 10:11:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:38,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:11:38,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:38,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:38,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:38,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775613345] [2023-12-25 10:11:38,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775613345] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:38,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:38,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:11:38,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523103307] [2023-12-25 10:11:38,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:38,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:11:38,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:38,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:11:38,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:11:38,619 INFO L87 Difference]: Start difference. First operand 246 states and 300 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:39,388 INFO L93 Difference]: Finished difference Result 317 states and 397 transitions. [2023-12-25 10:11:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:11:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2023-12-25 10:11:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:39,390 INFO L225 Difference]: With dead ends: 317 [2023-12-25 10:11:39,390 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 10:11:39,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 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-25 10:11:39,391 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 732 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:39,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 777 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 10:11:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 10:11:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2023-12-25 10:11:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 245 states have internal predecessors, (299), 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-25 10:11:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 299 transitions. [2023-12-25 10:11:39,395 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 299 transitions. Word has length 64 [2023-12-25 10:11:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:39,395 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 299 transitions. [2023-12-25 10:11:39,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-25 10:11:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 299 transitions. [2023-12-25 10:11:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-25 10:11:39,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:39,396 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] [2023-12-25 10:11:39,401 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-25 10:11:39,599 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-25 10:11:39,599 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:39,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash 107558087, now seen corresponding path program 1 times [2023-12-25 10:11:39,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:39,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139541206] [2023-12-25 10:11:39,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:39,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:39,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:39,602 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-25 10:11:39,602 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-25 10:11:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:39,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 10:11:39,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:40,497 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:40,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:40,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139541206] [2023-12-25 10:11:40,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139541206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:40,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:40,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-25 10:11:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804467732] [2023-12-25 10:11:40,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:40,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 10:11:40,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:40,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 10:11:40,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-25 10:11:40,498 INFO L87 Difference]: Start difference. First operand 246 states and 299 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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-25 10:11:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:41,253 INFO L93 Difference]: Finished difference Result 474 states and 602 transitions. [2023-12-25 10:11:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 10:11:41,253 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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 66 [2023-12-25 10:11:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:41,254 INFO L225 Difference]: With dead ends: 474 [2023-12-25 10:11:41,254 INFO L226 Difference]: Without dead ends: 357 [2023-12-25 10:11:41,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2023-12-25 10:11:41,255 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 1100 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:41,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1449 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 10:11:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-12-25 10:11:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 183. [2023-12-25 10:11:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 182 states have internal predecessors, (222), 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-25 10:11:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 222 transitions. [2023-12-25 10:11:41,258 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 222 transitions. Word has length 66 [2023-12-25 10:11:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:41,258 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 222 transitions. [2023-12-25 10:11:41,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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-25 10:11:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 222 transitions. [2023-12-25 10:11:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-25 10:11:41,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:41,258 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] [2023-12-25 10:11:41,268 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-25 10:11:41,465 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-25 10:11:41,466 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:41,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash 89242274, now seen corresponding path program 1 times [2023-12-25 10:11:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:41,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035129036] [2023-12-25 10:11:41,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:41,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:41,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:41,468 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:41,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 10:11:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:41,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 10:11:41,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:43,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:43,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035129036] [2023-12-25 10:11:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035129036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-25 10:11:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127918463] [2023-12-25 10:11:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:43,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 10:11:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:43,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 10:11:43,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2023-12-25 10:11:43,635 INFO L87 Difference]: Start difference. First operand 183 states and 222 transitions. Second operand has 22 states, 22 states have (on average 3.0) internal successors, (66), 22 states have internal predecessors, (66), 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-25 10:11:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:49,652 INFO L93 Difference]: Finished difference Result 665 states and 854 transitions. [2023-12-25 10:11:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 10:11:49,653 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0) internal successors, (66), 22 states have internal predecessors, (66), 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 66 [2023-12-25 10:11:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:49,655 INFO L225 Difference]: With dead ends: 665 [2023-12-25 10:11:49,655 INFO L226 Difference]: Without dead ends: 595 [2023-12-25 10:11:49,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2023-12-25 10:11:49,656 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 1286 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 4331 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:49,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 4331 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2099 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-12-25 10:11:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-12-25 10:11:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 194. [2023-12-25 10:11:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 187 states have (on average 1.2620320855614973) internal successors, (236), 193 states have internal predecessors, (236), 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-25 10:11:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2023-12-25 10:11:49,661 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 66 [2023-12-25 10:11:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:49,661 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2023-12-25 10:11:49,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0) internal successors, (66), 22 states have internal predecessors, (66), 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-25 10:11:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2023-12-25 10:11:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-25 10:11:49,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:49,662 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] [2023-12-25 10:11:49,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 10:11:49,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:49,862 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:49,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:49,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1372728877, now seen corresponding path program 1 times [2023-12-25 10:11:49,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:49,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864393318] [2023-12-25 10:11:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:49,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:49,864 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:49,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 10:11:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:49,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 10:11:49,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:50,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:50,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:50,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864393318] [2023-12-25 10:11:50,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864393318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:50,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:50,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 10:11:50,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137675420] [2023-12-25 10:11:50,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:50,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 10:11:50,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:50,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 10:11:50,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 10:11:50,360 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-25 10:11:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:50,743 INFO L93 Difference]: Finished difference Result 344 states and 444 transitions. [2023-12-25 10:11:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 10:11:50,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 66 [2023-12-25 10:11:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:50,744 INFO L225 Difference]: With dead ends: 344 [2023-12-25 10:11:50,744 INFO L226 Difference]: Without dead ends: 257 [2023-12-25 10:11:50,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-25 10:11:50,745 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 655 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:50,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1130 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 10:11:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-12-25 10:11:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 161. [2023-12-25 10:11:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 160 states have internal predecessors, (198), 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-25 10:11:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2023-12-25 10:11:50,747 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 66 [2023-12-25 10:11:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:50,748 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2023-12-25 10:11:50,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-25 10:11:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2023-12-25 10:11:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-25 10:11:50,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:50,748 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] [2023-12-25 10:11:50,751 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 (18)] Ended with exit code 0 [2023-12-25 10:11:50,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:50,949 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:50,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1736033602, now seen corresponding path program 1 times [2023-12-25 10:11:50,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:50,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570667227] [2023-12-25 10:11:50,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:50,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-25 10:11:50,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:50,964 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:50,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 10:11:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:51,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 10:11:51,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:51,986 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:51,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570667227] [2023-12-25 10:11:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570667227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:51,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:51,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-25 10:11:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019210326] [2023-12-25 10:11:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:51,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 10:11:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:51,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 10:11:51,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 10:11:51,989 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-25 10:11:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:53,007 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2023-12-25 10:11:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 10:11:53,007 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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 67 [2023-12-25 10:11:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:53,008 INFO L225 Difference]: With dead ends: 367 [2023-12-25 10:11:53,008 INFO L226 Difference]: Without dead ends: 297 [2023-12-25 10:11:53,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2023-12-25 10:11:53,009 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 767 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:53,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1672 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 10:11:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-25 10:11:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 134. [2023-12-25 10:11:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 132 states have (on average 1.25) internal successors, (165), 133 states have internal predecessors, (165), 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-25 10:11:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 165 transitions. [2023-12-25 10:11:53,011 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 165 transitions. Word has length 67 [2023-12-25 10:11:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:53,011 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 165 transitions. [2023-12-25 10:11:53,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-25 10:11:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2023-12-25 10:11:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-25 10:11:53,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:53,012 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] [2023-12-25 10:11:53,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 10:11:53,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:53,212 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:53,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1116116258, now seen corresponding path program 1 times [2023-12-25 10:11:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:53,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358168253] [2023-12-25 10:11:53,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:53,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:53,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:53,234 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:53,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 10:11:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:53,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:11:53,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:53,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:53,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358168253] [2023-12-25 10:11:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358168253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:53,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:53,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:11:53,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169350573] [2023-12-25 10:11:53,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:53,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:11:53,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:11:53,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:11:53,671 INFO L87 Difference]: Start difference. First operand 134 states and 165 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 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-25 10:11:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:11:54,023 INFO L93 Difference]: Finished difference Result 206 states and 264 transitions. [2023-12-25 10:11:54,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:11:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 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 67 [2023-12-25 10:11:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:11:54,024 INFO L225 Difference]: With dead ends: 206 [2023-12-25 10:11:54,024 INFO L226 Difference]: Without dead ends: 134 [2023-12-25 10:11:54,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 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-25 10:11:54,025 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 441 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:11:54,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 278 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 10:11:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-25 10:11:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-12-25 10:11:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 132 states have (on average 1.2424242424242424) internal successors, (164), 133 states have internal predecessors, (164), 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-25 10:11:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 164 transitions. [2023-12-25 10:11:54,027 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 164 transitions. Word has length 67 [2023-12-25 10:11:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:11:54,027 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 164 transitions. [2023-12-25 10:11:54,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 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-25 10:11:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2023-12-25 10:11:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-25 10:11:54,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:11:54,027 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] [2023-12-25 10:11:54,046 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 (20)] Forceful destruction successful, exit code 0 [2023-12-25 10:11:54,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:54,228 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:11:54,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:11:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1523699975, now seen corresponding path program 1 times [2023-12-25 10:11:54,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:11:54,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281512680] [2023-12-25 10:11:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:11:54,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:11:54,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:11:54,245 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:11:54,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 10:11:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:11:54,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 10:11:54,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:11:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:11:59,179 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:11:59,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:11:59,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281512680] [2023-12-25 10:11:59,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281512680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:11:59,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:11:59,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-25 10:11:59,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012689340] [2023-12-25 10:11:59,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:11:59,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 10:11:59,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:11:59,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 10:11:59,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2023-12-25 10:11:59,180 INFO L87 Difference]: Start difference. First operand 134 states and 164 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 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-25 10:12:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:23,812 INFO L93 Difference]: Finished difference Result 575 states and 767 transitions. [2023-12-25 10:12:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 10:12:23,812 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 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 69 [2023-12-25 10:12:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:23,813 INFO L225 Difference]: With dead ends: 575 [2023-12-25 10:12:23,813 INFO L226 Difference]: Without dead ends: 508 [2023-12-25 10:12:23,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 10:12:23,814 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 1077 mSDsluCounter, 4164 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 4535 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:23,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 4535 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 22.2s Time] [2023-12-25 10:12:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2023-12-25 10:12:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 150. [2023-12-25 10:12:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 148 states have (on average 1.2364864864864864) internal successors, (183), 149 states have internal predecessors, (183), 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-25 10:12:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions. [2023-12-25 10:12:23,817 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 183 transitions. Word has length 69 [2023-12-25 10:12:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:23,817 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 183 transitions. [2023-12-25 10:12:23,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 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-25 10:12:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 183 transitions. [2023-12-25 10:12:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 10:12:23,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:23,818 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] [2023-12-25 10:12:23,823 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 (21)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:24,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:24,018 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:24,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash -327269785, now seen corresponding path program 1 times [2023-12-25 10:12:24,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:24,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269974766] [2023-12-25 10:12:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:24,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:24,020 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:24,053 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 (22)] Waiting until timeout for monitored process [2023-12-25 10:12:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:24,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 10:12:24,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:24,542 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:12:24,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:24,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269974766] [2023-12-25 10:12:24,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269974766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:12:24,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:12:24,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 10:12:24,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273986574] [2023-12-25 10:12:24,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:12:24,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 10:12:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:24,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 10:12:24,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 10:12:24,543 INFO L87 Difference]: Start difference. First operand 150 states and 183 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-25 10:12:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:24,956 INFO L93 Difference]: Finished difference Result 217 states and 278 transitions. [2023-12-25 10:12:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 10:12:24,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2023-12-25 10:12:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:24,957 INFO L225 Difference]: With dead ends: 217 [2023-12-25 10:12:24,957 INFO L226 Difference]: Without dead ends: 211 [2023-12-25 10:12:24,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-25 10:12:24,958 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 444 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:24,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 895 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:12:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-25 10:12:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 143. [2023-12-25 10:12:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.2394366197183098) internal successors, (176), 142 states have internal predecessors, (176), 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-25 10:12:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 176 transitions. [2023-12-25 10:12:24,960 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 176 transitions. Word has length 70 [2023-12-25 10:12:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:24,960 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 176 transitions. [2023-12-25 10:12:24,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-25 10:12:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 176 transitions. [2023-12-25 10:12:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-25 10:12:24,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:24,961 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] [2023-12-25 10:12:24,963 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 (22)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:25,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:25,163 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:25,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:25,164 INFO L85 PathProgramCache]: Analyzing trace with hash 258319301, now seen corresponding path program 1 times [2023-12-25 10:12:25,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:25,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818010261] [2023-12-25 10:12:25,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:25,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:25,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:25,165 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:25,168 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 (23)] Waiting until timeout for monitored process [2023-12-25 10:12:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:25,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:12:25,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:25,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:12:25,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818010261] [2023-12-25 10:12:25,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818010261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:12:25,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:12:25,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:12:25,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99722100] [2023-12-25 10:12:25,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:12:25,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:12:25,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:25,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:12:25,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:12:25,677 INFO L87 Difference]: Start difference. First operand 143 states and 176 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 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-25 10:12:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:25,982 INFO L93 Difference]: Finished difference Result 203 states and 261 transitions. [2023-12-25 10:12:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:12:25,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 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 92 [2023-12-25 10:12:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:25,984 INFO L225 Difference]: With dead ends: 203 [2023-12-25 10:12:25,985 INFO L226 Difference]: Without dead ends: 143 [2023-12-25 10:12:25,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 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-25 10:12:25,988 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 504 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:25,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 272 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 10:12:25,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-12-25 10:12:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-12-25 10:12:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.2253521126760563) internal successors, (174), 142 states have internal predecessors, (174), 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-25 10:12:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2023-12-25 10:12:25,990 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 92 [2023-12-25 10:12:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:25,990 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2023-12-25 10:12:25,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 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-25 10:12:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2023-12-25 10:12:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-25 10:12:25,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:25,991 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] [2023-12-25 10:12:25,996 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 (23)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:26,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:26,194 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:26,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash 382273984, now seen corresponding path program 1 times [2023-12-25 10:12:26,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:26,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121474500] [2023-12-25 10:12:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:26,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:26,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:26,196 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:26,198 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 (24)] Waiting until timeout for monitored process [2023-12-25 10:12:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:26,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:12:26,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:26,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:12:26,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:26,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121474500] [2023-12-25 10:12:26,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121474500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:12:26,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:12:26,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:12:26,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537267966] [2023-12-25 10:12:26,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:12:26,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:12:26,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:26,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:12:26,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:12:26,349 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-25 10:12:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:26,363 INFO L93 Difference]: Finished difference Result 243 states and 320 transitions. [2023-12-25 10:12:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:12:26,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2023-12-25 10:12:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:26,364 INFO L225 Difference]: With dead ends: 243 [2023-12-25 10:12:26,364 INFO L226 Difference]: Without dead ends: 189 [2023-12-25 10:12:26,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:12:26,365 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 96 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:26,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 312 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:12:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-12-25 10:12:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2023-12-25 10:12:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.2849462365591398) internal successors, (239), 186 states have internal predecessors, (239), 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-25 10:12:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 239 transitions. [2023-12-25 10:12:26,367 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 239 transitions. Word has length 95 [2023-12-25 10:12:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:26,367 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 239 transitions. [2023-12-25 10:12:26,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-25 10:12:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 239 transitions. [2023-12-25 10:12:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-25 10:12:26,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:26,368 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] [2023-12-25 10:12:26,392 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 (24)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:26,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:26,571 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:26,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:26,572 INFO L85 PathProgramCache]: Analyzing trace with hash 166066721, now seen corresponding path program 1 times [2023-12-25 10:12:26,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:26,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506423445] [2023-12-25 10:12:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:26,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:26,573 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:26,575 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 (25)] Waiting until timeout for monitored process [2023-12-25 10:12:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:26,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:12:26,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:26,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:12:26,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:26,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506423445] [2023-12-25 10:12:26,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506423445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:12:26,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:12:26,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:12:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599371715] [2023-12-25 10:12:26,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:12:26,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:12:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:12:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:12:26,703 INFO L87 Difference]: Start difference. First operand 187 states and 239 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-25 10:12:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:26,714 INFO L93 Difference]: Finished difference Result 367 states and 503 transitions. [2023-12-25 10:12:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:12:26,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2023-12-25 10:12:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:26,716 INFO L225 Difference]: With dead ends: 367 [2023-12-25 10:12:26,716 INFO L226 Difference]: Without dead ends: 269 [2023-12-25 10:12:26,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:12:26,720 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 88 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:26,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 313 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:12:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-12-25 10:12:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2023-12-25 10:12:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.3383458646616542) internal successors, (356), 266 states have internal predecessors, (356), 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-25 10:12:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 356 transitions. [2023-12-25 10:12:26,724 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 356 transitions. Word has length 96 [2023-12-25 10:12:26,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:26,724 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 356 transitions. [2023-12-25 10:12:26,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-25 10:12:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 356 transitions. [2023-12-25 10:12:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-25 10:12:26,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:26,724 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] [2023-12-25 10:12:26,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 (25)] Ended with exit code 0 [2023-12-25 10:12:26,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:26,928 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:26,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2133037453, now seen corresponding path program 1 times [2023-12-25 10:12:26,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684673827] [2023-12-25 10:12:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:26,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:26,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:26,930 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:26,932 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 (26)] Waiting until timeout for monitored process [2023-12-25 10:12:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:27,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:12:27,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:27,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:12:27,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:27,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684673827] [2023-12-25 10:12:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684673827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:12:27,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:12:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:12:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568745252] [2023-12-25 10:12:27,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:12:27,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:12:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:27,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:12:27,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:12:27,097 INFO L87 Difference]: Start difference. First operand 267 states and 356 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-25 10:12:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:27,110 INFO L93 Difference]: Finished difference Result 591 states and 830 transitions. [2023-12-25 10:12:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:12:27,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 97 [2023-12-25 10:12:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:27,112 INFO L225 Difference]: With dead ends: 591 [2023-12-25 10:12:27,112 INFO L226 Difference]: Without dead ends: 413 [2023-12-25 10:12:27,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:12:27,113 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 80 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:27,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 314 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:12:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-12-25 10:12:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2023-12-25 10:12:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.3756097560975609) internal successors, (564), 410 states have internal predecessors, (564), 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-25 10:12:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 564 transitions. [2023-12-25 10:12:27,128 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 564 transitions. Word has length 97 [2023-12-25 10:12:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:27,128 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 564 transitions. [2023-12-25 10:12:27,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-25 10:12:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 564 transitions. [2023-12-25 10:12:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 10:12:27,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:27,128 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] [2023-12-25 10:12:27,135 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 (26)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:27,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:27,331 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:27,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:27,331 INFO L85 PathProgramCache]: Analyzing trace with hash 21447936, now seen corresponding path program 1 times [2023-12-25 10:12:27,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:27,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926444712] [2023-12-25 10:12:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:27,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:27,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:27,333 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:27,333 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 (27)] Waiting until timeout for monitored process [2023-12-25 10:12:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:27,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:12:27,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:27,477 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:12:27,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926444712] [2023-12-25 10:12:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926444712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:12:27,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:12:27,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:12:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588487578] [2023-12-25 10:12:27,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:12:27,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:12:27,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:27,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:12:27,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:12:27,478 INFO L87 Difference]: Start difference. First operand 411 states and 564 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-25 10:12:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:27,508 INFO L93 Difference]: Finished difference Result 991 states and 1406 transitions. [2023-12-25 10:12:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:12:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2023-12-25 10:12:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:27,509 INFO L225 Difference]: With dead ends: 991 [2023-12-25 10:12:27,509 INFO L226 Difference]: Without dead ends: 669 [2023-12-25 10:12:27,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:12:27,510 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 72 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:27,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 315 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:12:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2023-12-25 10:12:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 667. [2023-12-25 10:12:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.3933933933933933) internal successors, (928), 666 states have internal predecessors, (928), 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-25 10:12:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 928 transitions. [2023-12-25 10:12:27,517 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 928 transitions. Word has length 98 [2023-12-25 10:12:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:27,517 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 928 transitions. [2023-12-25 10:12:27,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-25 10:12:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 928 transitions. [2023-12-25 10:12:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-25 10:12:27,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:27,518 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] [2023-12-25 10:12:27,521 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 (27)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:27,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:27,721 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:27,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1785099454, now seen corresponding path program 1 times [2023-12-25 10:12:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:27,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830173901] [2023-12-25 10:12:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:27,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:27,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:27,749 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:27,765 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 (28)] Waiting until timeout for monitored process [2023-12-25 10:12:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:27,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 10:12:27,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:28,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:12:28,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:28,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830173901] [2023-12-25 10:12:28,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830173901] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:12:28,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:12:28,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 10:12:28,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273581344] [2023-12-25 10:12:28,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:12:28,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 10:12:28,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:28,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 10:12:28,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-25 10:12:28,496 INFO L87 Difference]: Start difference. First operand 667 states and 928 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-25 10:12:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:28,592 INFO L93 Difference]: Finished difference Result 3557 states and 5093 transitions. [2023-12-25 10:12:28,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 10:12:28,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2023-12-25 10:12:28,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:28,599 INFO L225 Difference]: With dead ends: 3557 [2023-12-25 10:12:28,599 INFO L226 Difference]: Without dead ends: 2979 [2023-12-25 10:12:28,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-25 10:12:28,601 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 356 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:28,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 575 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:12:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2023-12-25 10:12:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 1819. [2023-12-25 10:12:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1818 states have (on average 1.3993399339933994) internal successors, (2544), 1818 states have internal predecessors, (2544), 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-25 10:12:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2544 transitions. [2023-12-25 10:12:28,623 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2544 transitions. Word has length 99 [2023-12-25 10:12:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:28,623 INFO L495 AbstractCegarLoop]: Abstraction has 1819 states and 2544 transitions. [2023-12-25 10:12:28,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-25 10:12:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2544 transitions. [2023-12-25 10:12:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-25 10:12:28,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:28,624 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-25 10:12:28,630 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 (28)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:28,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:28,827 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:28,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash -272349698, now seen corresponding path program 1 times [2023-12-25 10:12:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:28,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430608855] [2023-12-25 10:12:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:28,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:28,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:28,829 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:28,830 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 (29)] Waiting until timeout for monitored process [2023-12-25 10:12:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:28,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 10:12:28,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:29,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:12:29,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:29,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430608855] [2023-12-25 10:12:29,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430608855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:12:29,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:12:29,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:12:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145577669] [2023-12-25 10:12:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:12:29,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 10:12:29,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:29,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 10:12:29,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 10:12:29,072 INFO L87 Difference]: Start difference. First operand 1819 states and 2544 transitions. Second operand has 4 states, 4 states have (on average 25.25) 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-25 10:12:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:29,100 INFO L93 Difference]: Finished difference Result 4386 states and 6153 transitions. [2023-12-25 10:12:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 10:12:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) 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-25 10:12:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:29,106 INFO L225 Difference]: With dead ends: 4386 [2023-12-25 10:12:29,106 INFO L226 Difference]: Without dead ends: 2656 [2023-12-25 10:12:29,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 10:12:29,108 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 50 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:29,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 419 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:12:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2023-12-25 10:12:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2654. [2023-12-25 10:12:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2653 states have (on average 1.3807010931021486) internal successors, (3663), 2653 states have internal predecessors, (3663), 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-25 10:12:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3663 transitions. [2023-12-25 10:12:29,133 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3663 transitions. Word has length 101 [2023-12-25 10:12:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:29,133 INFO L495 AbstractCegarLoop]: Abstraction has 2654 states and 3663 transitions. [2023-12-25 10:12:29,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) 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-25 10:12:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3663 transitions. [2023-12-25 10:12:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 10:12:29,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:29,134 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-25 10:12:29,154 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 (29)] Ended with exit code 0 [2023-12-25 10:12:29,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:29,336 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:29,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:29,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1833794586, now seen corresponding path program 1 times [2023-12-25 10:12:29,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:29,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759167914] [2023-12-25 10:12:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:29,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:29,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:29,338 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:29,373 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 (30)] Waiting until timeout for monitored process [2023-12-25 10:12:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:29,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 10:12:29,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:29,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:12:29,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:29,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759167914] [2023-12-25 10:12:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759167914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:12:29,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:12:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 10:12:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646355431] [2023-12-25 10:12:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:12:29,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:12:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:29,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:12:29,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:12:29,505 INFO L87 Difference]: Start difference. First operand 2654 states and 3663 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-25 10:12:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:29,565 INFO L93 Difference]: Finished difference Result 4973 states and 6813 transitions. [2023-12-25 10:12:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 10:12:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-25 10:12:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:29,576 INFO L225 Difference]: With dead ends: 4973 [2023-12-25 10:12:29,576 INFO L226 Difference]: Without dead ends: 4971 [2023-12-25 10:12:29,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:12:29,578 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 254 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:29,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 611 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:12:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4971 states. [2023-12-25 10:12:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4971 to 2822. [2023-12-25 10:12:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2821 states have (on average 1.3551931939028714) internal successors, (3823), 2821 states have internal predecessors, (3823), 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-25 10:12:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 3823 transitions. [2023-12-25 10:12:29,613 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 3823 transitions. Word has length 102 [2023-12-25 10:12:29,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:29,613 INFO L495 AbstractCegarLoop]: Abstraction has 2822 states and 3823 transitions. [2023-12-25 10:12:29,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-25 10:12:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3823 transitions. [2023-12-25 10:12:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-25 10:12:29,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:29,614 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:12:29,619 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 (30)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:29,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:29,817 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:29,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash -2143232600, now seen corresponding path program 1 times [2023-12-25 10:12:29,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:29,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189005280] [2023-12-25 10:12:29,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:29,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:29,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:29,820 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:29,822 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 (31)] Waiting until timeout for monitored process [2023-12-25 10:12:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:29,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:12:29,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:30,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:12:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:30,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:30,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189005280] [2023-12-25 10:12:30,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189005280] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:12:30,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:12:30,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 10:12:30,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531415246] [2023-12-25 10:12:30,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:12:30,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 10:12:30,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:30,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 10:12:30,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 10:12:30,875 INFO L87 Difference]: Start difference. First operand 2822 states and 3823 transitions. Second operand has 16 states, 16 states have (on average 15.0) internal successors, (240), 15 states have internal predecessors, (240), 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-25 10:12:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:33,814 INFO L93 Difference]: Finished difference Result 13145 states and 17779 transitions. [2023-12-25 10:12:33,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-25 10:12:33,815 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.0) internal successors, (240), 15 states have internal predecessors, (240), 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 128 [2023-12-25 10:12:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:33,838 INFO L225 Difference]: With dead ends: 13145 [2023-12-25 10:12:33,838 INFO L226 Difference]: Without dead ends: 10415 [2023-12-25 10:12:33,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1229, Invalid=3601, Unknown=0, NotChecked=0, Total=4830 [2023-12-25 10:12:33,843 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 2796 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2796 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:33,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2796 Valid, 1188 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 10:12:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10415 states. [2023-12-25 10:12:33,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10415 to 2906. [2023-12-25 10:12:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2905 states have (on average 1.344922547332186) internal successors, (3907), 2905 states have internal predecessors, (3907), 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-25 10:12:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 3907 transitions. [2023-12-25 10:12:33,907 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 3907 transitions. Word has length 128 [2023-12-25 10:12:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:33,907 INFO L495 AbstractCegarLoop]: Abstraction has 2906 states and 3907 transitions. [2023-12-25 10:12:33,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.0) internal successors, (240), 15 states have internal predecessors, (240), 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-25 10:12:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 3907 transitions. [2023-12-25 10:12:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-25 10:12:33,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:33,909 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:12:33,912 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 (31)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:34,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:34,112 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:34,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash -977480018, now seen corresponding path program 1 times [2023-12-25 10:12:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620690661] [2023-12-25 10:12:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:34,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:34,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:34,114 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:34,115 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 (32)] Waiting until timeout for monitored process [2023-12-25 10:12:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:34,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:12:34,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:35,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:12:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:35,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:35,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620690661] [2023-12-25 10:12:35,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620690661] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:12:35,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:12:35,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-25 10:12:35,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937876569] [2023-12-25 10:12:35,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:12:35,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 10:12:35,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:35,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 10:12:35,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-25 10:12:35,329 INFO L87 Difference]: Start difference. First operand 2906 states and 3907 transitions. Second operand has 24 states, 24 states have (on average 9.75) internal successors, (234), 23 states have internal predecessors, (234), 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-25 10:12:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:40,952 INFO L93 Difference]: Finished difference Result 15836 states and 21007 transitions. [2023-12-25 10:12:40,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-12-25 10:12:40,953 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.75) internal successors, (234), 23 states have internal predecessors, (234), 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 128 [2023-12-25 10:12:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:40,973 INFO L225 Difference]: With dead ends: 15836 [2023-12-25 10:12:40,973 INFO L226 Difference]: Without dead ends: 13878 [2023-12-25 10:12:40,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1992, Invalid=8310, Unknown=0, NotChecked=0, Total=10302 [2023-12-25 10:12:40,981 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 4104 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4104 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:40,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4104 Valid, 1581 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 10:12:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13878 states. [2023-12-25 10:12:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13878 to 2906. [2023-12-25 10:12:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2905 states have (on average 1.3407917383820998) internal successors, (3895), 2905 states have internal predecessors, (3895), 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-25 10:12:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 3895 transitions. [2023-12-25 10:12:41,086 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 3895 transitions. Word has length 128 [2023-12-25 10:12:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:41,086 INFO L495 AbstractCegarLoop]: Abstraction has 2906 states and 3895 transitions. [2023-12-25 10:12:41,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.75) internal successors, (234), 23 states have internal predecessors, (234), 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-25 10:12:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 3895 transitions. [2023-12-25 10:12:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-25 10:12:41,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:41,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:12:41,106 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 (32)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:41,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:41,292 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:41,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:41,292 INFO L85 PathProgramCache]: Analyzing trace with hash -807680273, now seen corresponding path program 1 times [2023-12-25 10:12:41,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:41,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027731514] [2023-12-25 10:12:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:41,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:41,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:41,294 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:41,300 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 (33)] Waiting until timeout for monitored process [2023-12-25 10:12:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:41,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:12:41,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:42,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:12:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:42,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027731514] [2023-12-25 10:12:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027731514] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:12:42,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:12:42,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-25 10:12:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567810752] [2023-12-25 10:12:42,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:12:42,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 10:12:42,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:42,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 10:12:42,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-25 10:12:42,621 INFO L87 Difference]: Start difference. First operand 2906 states and 3895 transitions. Second operand has 24 states, 24 states have (on average 10.25) internal successors, (246), 23 states have internal predecessors, (246), 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-25 10:12:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:51,015 INFO L93 Difference]: Finished difference Result 20523 states and 27161 transitions. [2023-12-25 10:12:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-12-25 10:12:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.25) internal successors, (246), 23 states have internal predecessors, (246), 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 129 [2023-12-25 10:12:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:51,074 INFO L225 Difference]: With dead ends: 20523 [2023-12-25 10:12:51,074 INFO L226 Difference]: Without dead ends: 17709 [2023-12-25 10:12:51,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5848 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=3525, Invalid=14565, Unknown=0, NotChecked=0, Total=18090 [2023-12-25 10:12:51,082 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 5173 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5173 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:51,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5173 Valid, 1526 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-25 10:12:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17709 states. [2023-12-25 10:12:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17709 to 3032. [2023-12-25 10:12:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 3031 states have (on average 1.3325635103926097) internal successors, (4039), 3031 states have internal predecessors, (4039), 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-25 10:12:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 4039 transitions. [2023-12-25 10:12:51,163 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 4039 transitions. Word has length 129 [2023-12-25 10:12:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:51,163 INFO L495 AbstractCegarLoop]: Abstraction has 3032 states and 4039 transitions. [2023-12-25 10:12:51,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.25) internal successors, (246), 23 states have internal predecessors, (246), 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-25 10:12:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 4039 transitions. [2023-12-25 10:12:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-25 10:12:51,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:51,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:12:51,180 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 (33)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:51,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:51,368 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:51,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2060628775, now seen corresponding path program 1 times [2023-12-25 10:12:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423797485] [2023-12-25 10:12:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:51,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:51,371 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:51,401 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 (34)] Waiting until timeout for monitored process [2023-12-25 10:12:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:51,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:12:51,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:51,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:12:51,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:51,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423797485] [2023-12-25 10:12:51,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423797485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:12:51,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:12:51,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:12:51,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096285873] [2023-12-25 10:12:51,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:12:51,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:12:51,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:51,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:12:51,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:12:51,536 INFO L87 Difference]: Start difference. First operand 3032 states and 4039 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-25 10:12:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:12:51,555 INFO L93 Difference]: Finished difference Result 5848 states and 7819 transitions. [2023-12-25 10:12:51,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:12:51,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 130 [2023-12-25 10:12:51,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:12:51,569 INFO L225 Difference]: With dead ends: 5848 [2023-12-25 10:12:51,569 INFO L226 Difference]: Without dead ends: 2908 [2023-12-25 10:12:51,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:12:51,572 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 70 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:12:51,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 303 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:12:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2023-12-25 10:12:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2906. [2023-12-25 10:12:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2905 states have (on average 1.3180722891566266) internal successors, (3829), 2905 states have internal predecessors, (3829), 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-25 10:12:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 3829 transitions. [2023-12-25 10:12:51,593 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 3829 transitions. Word has length 130 [2023-12-25 10:12:51,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:12:51,593 INFO L495 AbstractCegarLoop]: Abstraction has 2906 states and 3829 transitions. [2023-12-25 10:12:51,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-25 10:12:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 3829 transitions. [2023-12-25 10:12:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-25 10:12:51,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:12:51,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:12:51,600 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 (34)] Forceful destruction successful, exit code 0 [2023-12-25 10:12:51,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:51,798 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:12:51,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:12:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash -22792793, now seen corresponding path program 1 times [2023-12-25 10:12:51,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:12:51,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566868209] [2023-12-25 10:12:51,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:12:51,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:12:51,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:12:51,800 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:12:51,835 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 (35)] Waiting until timeout for monitored process [2023-12-25 10:12:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:12:51,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:12:51,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:12:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:52,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:12:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:12:53,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:12:53,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566868209] [2023-12-25 10:12:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566868209] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:12:53,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:12:53,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-25 10:12:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717412980] [2023-12-25 10:12:53,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:12:53,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 10:12:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:12:53,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 10:12:53,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-25 10:12:53,126 INFO L87 Difference]: Start difference. First operand 2906 states and 3829 transitions. Second operand has 24 states, 24 states have (on average 10.5) internal successors, (252), 23 states have internal predecessors, (252), 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-25 10:13:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:13:02,308 INFO L93 Difference]: Finished difference Result 19839 states and 25851 transitions. [2023-12-25 10:13:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-12-25 10:13:02,309 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.5) internal successors, (252), 23 states have internal predecessors, (252), 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 130 [2023-12-25 10:13:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:13:02,343 INFO L225 Difference]: With dead ends: 19839 [2023-12-25 10:13:02,343 INFO L226 Difference]: Without dead ends: 17025 [2023-12-25 10:13:02,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5834 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3525, Invalid=14565, Unknown=0, NotChecked=0, Total=18090 [2023-12-25 10:13:02,352 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 3462 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3462 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:13:02,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3462 Valid, 2247 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-25 10:13:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2023-12-25 10:13:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 3032. [2023-12-25 10:13:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 3031 states have (on average 1.3107885186407127) internal successors, (3973), 3031 states have internal predecessors, (3973), 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-25 10:13:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 3973 transitions. [2023-12-25 10:13:02,431 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 3973 transitions. Word has length 130 [2023-12-25 10:13:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:13:02,431 INFO L495 AbstractCegarLoop]: Abstraction has 3032 states and 3973 transitions. [2023-12-25 10:13:02,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.5) internal successors, (252), 23 states have internal predecessors, (252), 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-25 10:13:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 3973 transitions. [2023-12-25 10:13:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 10:13:02,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:13:02,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:13:02,437 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 (35)] Forceful destruction successful, exit code 0 [2023-12-25 10:13:02,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:02,636 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:13:02,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:13:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1988231450, now seen corresponding path program 1 times [2023-12-25 10:13:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:13:02,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096502047] [2023-12-25 10:13:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:13:02,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:02,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:13:02,638 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:13:02,639 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 (36)] Waiting until timeout for monitored process [2023-12-25 10:13:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:13:02,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 10:13:02,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:13:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 10:13:03,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:13:03,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:13:03,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096502047] [2023-12-25 10:13:03,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096502047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:13:03,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:13:03,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 10:13:03,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484815083] [2023-12-25 10:13:03,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:13:03,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 10:13:03,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:13:03,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 10:13:03,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-25 10:13:03,310 INFO L87 Difference]: Start difference. First operand 3032 states and 3973 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-25 10:13:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:13:03,397 INFO L93 Difference]: Finished difference Result 7658 states and 10110 transitions. [2023-12-25 10:13:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 10:13:03,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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 131 [2023-12-25 10:13:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:13:03,401 INFO L225 Difference]: With dead ends: 7658 [2023-12-25 10:13:03,401 INFO L226 Difference]: Without dead ends: 4718 [2023-12-25 10:13:03,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-25 10:13:03,403 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 294 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:13:03,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 584 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:13:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2023-12-25 10:13:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 3032. [2023-12-25 10:13:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 3031 states have (on average 1.2896733751237215) internal successors, (3909), 3031 states have internal predecessors, (3909), 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-25 10:13:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 3909 transitions. [2023-12-25 10:13:03,431 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 3909 transitions. Word has length 131 [2023-12-25 10:13:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:13:03,431 INFO L495 AbstractCegarLoop]: Abstraction has 3032 states and 3909 transitions. [2023-12-25 10:13:03,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-25 10:13:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 3909 transitions. [2023-12-25 10:13:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 10:13:03,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:13:03,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:13:03,442 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 (36)] Forceful destruction successful, exit code 0 [2023-12-25 10:13:03,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:03,637 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:13:03,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:13:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash 413636855, now seen corresponding path program 1 times [2023-12-25 10:13:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:13:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522949618] [2023-12-25 10:13:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:13:03,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:13:03,639 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:13:03,639 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 (37)] Waiting until timeout for monitored process [2023-12-25 10:13:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:13:03,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:13:03,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:13:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:13:03,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:13:03,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:13:03,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522949618] [2023-12-25 10:13:03,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522949618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:13:03,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:13:03,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:13:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113304955] [2023-12-25 10:13:03,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:13:03,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:13:03,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:13:03,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:13:03,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:13:03,813 INFO L87 Difference]: Start difference. First operand 3032 states and 3909 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-25 10:13:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:13:03,827 INFO L93 Difference]: Finished difference Result 4505 states and 5816 transitions. [2023-12-25 10:13:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:13:03,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 131 [2023-12-25 10:13:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:13:03,828 INFO L225 Difference]: With dead ends: 4505 [2023-12-25 10:13:03,828 INFO L226 Difference]: Without dead ends: 1565 [2023-12-25 10:13:03,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:13:03,830 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 69 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:13:03,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 280 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:13:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2023-12-25 10:13:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1563. [2023-12-25 10:13:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1562 states have (on average 1.265685019206146) internal successors, (1977), 1562 states have internal predecessors, (1977), 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-25 10:13:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1977 transitions. [2023-12-25 10:13:03,839 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1977 transitions. Word has length 131 [2023-12-25 10:13:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:13:03,839 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1977 transitions. [2023-12-25 10:13:03,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-25 10:13:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1977 transitions. [2023-12-25 10:13:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 10:13:03,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:13:03,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:13:03,853 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 (37)] Forceful destruction successful, exit code 0 [2023-12-25 10:13:04,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:04,044 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:13:04,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:13:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash -832624521, now seen corresponding path program 1 times [2023-12-25 10:13:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:13:04,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104776207] [2023-12-25 10:13:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:13:04,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:04,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:13:04,046 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:13:04,047 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 (38)] Waiting until timeout for monitored process [2023-12-25 10:13:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:13:04,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 10:13:04,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:13:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 10:13:04,656 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:13:04,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:13:04,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104776207] [2023-12-25 10:13:04,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104776207] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:13:04,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:13:04,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 10:13:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149976688] [2023-12-25 10:13:04,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:13:04,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 10:13:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:13:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 10:13:04,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-25 10:13:04,657 INFO L87 Difference]: Start difference. First operand 1563 states and 1977 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-25 10:13:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:13:04,731 INFO L93 Difference]: Finished difference Result 3394 states and 4396 transitions. [2023-12-25 10:13:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 10:13:04,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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 131 [2023-12-25 10:13:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:13:04,733 INFO L225 Difference]: With dead ends: 3394 [2023-12-25 10:13:04,733 INFO L226 Difference]: Without dead ends: 2893 [2023-12-25 10:13:04,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-25 10:13:04,734 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 292 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:13:04,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 591 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:13:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2023-12-25 10:13:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2046. [2023-12-25 10:13:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 2045 states have (on average 1.265036674816626) internal successors, (2587), 2045 states have internal predecessors, (2587), 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-25 10:13:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2587 transitions. [2023-12-25 10:13:04,748 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2587 transitions. Word has length 131 [2023-12-25 10:13:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:13:04,748 INFO L495 AbstractCegarLoop]: Abstraction has 2046 states and 2587 transitions. [2023-12-25 10:13:04,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-25 10:13:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2587 transitions. [2023-12-25 10:13:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 10:13:04,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:13:04,749 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:13:04,755 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 (38)] Ended with exit code 0 [2023-12-25 10:13:04,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:04,954 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:13:04,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:13:04,954 INFO L85 PathProgramCache]: Analyzing trace with hash 271037626, now seen corresponding path program 1 times [2023-12-25 10:13:04,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:13:04,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801694612] [2023-12-25 10:13:04,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:13:04,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:04,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:13:04,956 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:13:04,958 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 (39)] Waiting until timeout for monitored process [2023-12-25 10:13:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:13:05,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 10:13:05,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:13:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 10:13:05,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:13:05,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:13:05,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801694612] [2023-12-25 10:13:05,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801694612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:13:05,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:13:05,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 10:13:05,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304854476] [2023-12-25 10:13:05,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:13:05,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 10:13:05,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:13:05,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 10:13:05,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-25 10:13:05,628 INFO L87 Difference]: Start difference. First operand 2046 states and 2587 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-25 10:13:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:13:05,709 INFO L93 Difference]: Finished difference Result 3877 states and 5006 transitions. [2023-12-25 10:13:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 10:13:05,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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 131 [2023-12-25 10:13:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:13:05,711 INFO L225 Difference]: With dead ends: 3877 [2023-12-25 10:13:05,711 INFO L226 Difference]: Without dead ends: 3376 [2023-12-25 10:13:05,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-25 10:13:05,716 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 293 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:13:05,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 658 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:13:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2023-12-25 10:13:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 2529. [2023-12-25 10:13:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2528 states have (on average 1.2646360759493671) internal successors, (3197), 2528 states have internal predecessors, (3197), 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-25 10:13:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 3197 transitions. [2023-12-25 10:13:05,740 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 3197 transitions. Word has length 131 [2023-12-25 10:13:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:13:05,740 INFO L495 AbstractCegarLoop]: Abstraction has 2529 states and 3197 transitions. [2023-12-25 10:13:05,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-25 10:13:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 3197 transitions. [2023-12-25 10:13:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 10:13:05,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:13:05,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:13:05,746 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 (39)] Forceful destruction successful, exit code 0 [2023-12-25 10:13:05,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:05,944 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:13:05,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:13:05,945 INFO L85 PathProgramCache]: Analyzing trace with hash 574728407, now seen corresponding path program 1 times [2023-12-25 10:13:05,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:13:05,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026779265] [2023-12-25 10:13:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:13:05,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:05,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:13:05,946 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:13:05,948 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 (40)] Waiting until timeout for monitored process [2023-12-25 10:13:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:13:06,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 10:13:06,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:13:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 10:13:06,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:13:06,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:13:06,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026779265] [2023-12-25 10:13:06,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026779265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:13:06,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:13:06,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 10:13:06,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673020483] [2023-12-25 10:13:06,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:13:06,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 10:13:06,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:13:06,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 10:13:06,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-25 10:13:06,676 INFO L87 Difference]: Start difference. First operand 2529 states and 3197 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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-25 10:13:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:13:06,754 INFO L93 Difference]: Finished difference Result 4058 states and 5228 transitions. [2023-12-25 10:13:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 10:13:06,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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 131 [2023-12-25 10:13:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:13:06,758 INFO L225 Difference]: With dead ends: 4058 [2023-12-25 10:13:06,758 INFO L226 Difference]: Without dead ends: 3716 [2023-12-25 10:13:06,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-25 10:13:06,759 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 366 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:13:06,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 598 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:13:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2023-12-25 10:13:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 2869. [2023-12-25 10:13:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2868 states have (on average 1.2653417015341701) internal successors, (3629), 2868 states have internal predecessors, (3629), 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-25 10:13:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 3629 transitions. [2023-12-25 10:13:06,780 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 3629 transitions. Word has length 131 [2023-12-25 10:13:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:13:06,780 INFO L495 AbstractCegarLoop]: Abstraction has 2869 states and 3629 transitions. [2023-12-25 10:13:06,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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-25 10:13:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 3629 transitions. [2023-12-25 10:13:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-25 10:13:06,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:13:06,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:13:06,802 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 (40)] Forceful destruction successful, exit code 0 [2023-12-25 10:13:06,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:06,985 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:13:06,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:13:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash 691417713, now seen corresponding path program 1 times [2023-12-25 10:13:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:13:06,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788580309] [2023-12-25 10:13:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:13:06,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:06,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:13:06,987 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:13:07,011 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 (41)] Waiting until timeout for monitored process [2023-12-25 10:13:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:13:07,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 10:13:07,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:13:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:13:08,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:13:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:13:09,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:13:09,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788580309] [2023-12-25 10:13:09,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788580309] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:13:09,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:13:09,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2023-12-25 10:13:09,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644279260] [2023-12-25 10:13:09,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:13:09,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-25 10:13:09,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:13:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-25 10:13:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 10:13:09,886 INFO L87 Difference]: Start difference. First operand 2869 states and 3629 transitions. Second operand has 41 states, 41 states have (on average 6.048780487804878) internal successors, (248), 41 states have internal predecessors, (248), 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-25 10:13:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:13:48,439 INFO L93 Difference]: Finished difference Result 106949 states and 134250 transitions. [2023-12-25 10:13:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 346 states. [2023-12-25 10:13:48,439 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.048780487804878) internal successors, (248), 41 states have internal predecessors, (248), 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 132 [2023-12-25 10:13:48,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:13:48,544 INFO L225 Difference]: With dead ends: 106949 [2023-12-25 10:13:48,545 INFO L226 Difference]: Without dead ends: 104605 [2023-12-25 10:13:48,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56448 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=14827, Invalid=126173, Unknown=0, NotChecked=0, Total=141000 [2023-12-25 10:13:48,576 INFO L413 NwaCegarLoop]: 933 mSDtfsCounter, 4552 mSDsluCounter, 20514 mSDsCounter, 0 mSdLazyCounter, 6683 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4552 SdHoareTripleChecker+Valid, 21447 SdHoareTripleChecker+Invalid, 6716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 6683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:13:48,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4552 Valid, 21447 Invalid, 6716 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 6683 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-12-25 10:13:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104605 states. [2023-12-25 10:13:49,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104605 to 10383. [2023-12-25 10:13:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10383 states, 10382 states have (on average 1.2674821806973608) internal successors, (13159), 10382 states have internal predecessors, (13159), 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-25 10:13:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10383 states to 10383 states and 13159 transitions. [2023-12-25 10:13:49,129 INFO L78 Accepts]: Start accepts. Automaton has 10383 states and 13159 transitions. Word has length 132 [2023-12-25 10:13:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:13:49,129 INFO L495 AbstractCegarLoop]: Abstraction has 10383 states and 13159 transitions. [2023-12-25 10:13:49,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.048780487804878) internal successors, (248), 41 states have internal predecessors, (248), 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-25 10:13:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 10383 states and 13159 transitions. [2023-12-25 10:13:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-25 10:13:49,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:13:49,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:13:49,136 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 (41)] Forceful destruction successful, exit code 0 [2023-12-25 10:13:49,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:49,336 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:13:49,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:13:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash 338482574, now seen corresponding path program 1 times [2023-12-25 10:13:49,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:13:49,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532432861] [2023-12-25 10:13:49,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:13:49,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:49,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:13:49,338 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:13:49,339 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 (42)] Waiting until timeout for monitored process [2023-12-25 10:13:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:13:49,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:13:49,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:13:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:13:49,507 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:13:49,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:13:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532432861] [2023-12-25 10:13:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532432861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:13:49,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:13:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:13:49,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046946441] [2023-12-25 10:13:49,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:13:49,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:13:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:13:49,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:13:49,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:13:49,510 INFO L87 Difference]: Start difference. First operand 10383 states and 13159 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-25 10:13:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:13:49,545 INFO L93 Difference]: Finished difference Result 15935 states and 20153 transitions. [2023-12-25 10:13:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:13:49,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 132 [2023-12-25 10:13:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:13:49,550 INFO L225 Difference]: With dead ends: 15935 [2023-12-25 10:13:49,550 INFO L226 Difference]: Without dead ends: 5676 [2023-12-25 10:13:49,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:13:49,562 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 57 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:13:49,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 268 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:13:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5676 states. [2023-12-25 10:13:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5676 to 5674. [2023-12-25 10:13:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5674 states, 5673 states have (on average 1.2377930548210823) internal successors, (7022), 5673 states have internal predecessors, (7022), 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-25 10:13:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 7022 transitions. [2023-12-25 10:13:49,613 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 7022 transitions. Word has length 132 [2023-12-25 10:13:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:13:49,613 INFO L495 AbstractCegarLoop]: Abstraction has 5674 states and 7022 transitions. [2023-12-25 10:13:49,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-25 10:13:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 7022 transitions. [2023-12-25 10:13:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-25 10:13:49,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:13:49,614 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:13:49,634 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 (42)] Forceful destruction successful, exit code 0 [2023-12-25 10:13:49,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:49,817 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:13:49,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:13:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1049483918, now seen corresponding path program 1 times [2023-12-25 10:13:49,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:13:49,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688222141] [2023-12-25 10:13:49,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:13:49,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:49,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:13:49,819 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:13:49,852 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 (43)] Waiting until timeout for monitored process [2023-12-25 10:13:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:13:49,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:13:49,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:13:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:13:49,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:13:49,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:13:49,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688222141] [2023-12-25 10:13:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688222141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:13:49,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:13:49,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:13:49,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266982046] [2023-12-25 10:13:49,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:13:49,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:13:49,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:13:49,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:13:49,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:13:49,997 INFO L87 Difference]: Start difference. First operand 5674 states and 7022 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-25 10:13:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:13:50,021 INFO L93 Difference]: Finished difference Result 8038 states and 9949 transitions. [2023-12-25 10:13:50,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:13:50,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 132 [2023-12-25 10:13:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:13:50,023 INFO L225 Difference]: With dead ends: 8038 [2023-12-25 10:13:50,023 INFO L226 Difference]: Without dead ends: 2488 [2023-12-25 10:13:50,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:13:50,027 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 41 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:13:50,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 260 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:13:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2023-12-25 10:13:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2444. [2023-12-25 10:13:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2443 states have (on average 1.2173557101923864) internal successors, (2974), 2443 states have internal predecessors, (2974), 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-25 10:13:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 2974 transitions. [2023-12-25 10:13:50,043 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 2974 transitions. Word has length 132 [2023-12-25 10:13:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:13:50,043 INFO L495 AbstractCegarLoop]: Abstraction has 2444 states and 2974 transitions. [2023-12-25 10:13:50,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-25 10:13:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 2974 transitions. [2023-12-25 10:13:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-25 10:13:50,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:13:50,044 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:13:50,047 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 (43)] Forceful destruction successful, exit code 0 [2023-12-25 10:13:50,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:50,247 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:13:50,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:13:50,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2012070308, now seen corresponding path program 1 times [2023-12-25 10:13:50,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:13:50,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289463435] [2023-12-25 10:13:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:13:50,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:13:50,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:13:50,249 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:13:50,250 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 (44)] Waiting until timeout for monitored process [2023-12-25 10:13:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:13:50,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 10:13:50,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:13:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:13:53,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:13:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:13:54,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:13:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289463435] [2023-12-25 10:13:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289463435] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:13:54,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:13:54,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 38 [2023-12-25 10:13:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169007934] [2023-12-25 10:13:54,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:13:54,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 10:13:54,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:13:54,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 10:13:54,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 10:13:54,788 INFO L87 Difference]: Start difference. First operand 2444 states and 2974 transitions. Second operand has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 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-25 10:14:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:14:16,812 INFO L93 Difference]: Finished difference Result 22070 states and 27160 transitions. [2023-12-25 10:14:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-12-25 10:14:16,813 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 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 132 [2023-12-25 10:14:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:14:16,829 INFO L225 Difference]: With dead ends: 22070 [2023-12-25 10:14:16,829 INFO L226 Difference]: Without dead ends: 20518 [2023-12-25 10:14:16,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4682 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=2128, Invalid=14384, Unknown=0, NotChecked=0, Total=16512 [2023-12-25 10:14:16,836 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 6825 mSDsluCounter, 7777 mSDsCounter, 0 mSdLazyCounter, 3298 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6825 SdHoareTripleChecker+Valid, 8291 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:14:16,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6825 Valid, 8291 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3298 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-12-25 10:14:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20518 states. [2023-12-25 10:14:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20518 to 7919. [2023-12-25 10:14:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7919 states, 7918 states have (on average 1.2171002778479414) internal successors, (9637), 7918 states have internal predecessors, (9637), 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-25 10:14:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7919 states to 7919 states and 9637 transitions. [2023-12-25 10:14:16,939 INFO L78 Accepts]: Start accepts. Automaton has 7919 states and 9637 transitions. Word has length 132 [2023-12-25 10:14:16,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:14:16,939 INFO L495 AbstractCegarLoop]: Abstraction has 7919 states and 9637 transitions. [2023-12-25 10:14:16,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 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-25 10:14:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 7919 states and 9637 transitions. [2023-12-25 10:14:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-25 10:14:16,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:14:16,941 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:14:16,945 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 (44)] Forceful destruction successful, exit code 0 [2023-12-25 10:14:17,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:17,145 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:14:17,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:14:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1187590689, now seen corresponding path program 1 times [2023-12-25 10:14:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:14:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405385779] [2023-12-25 10:14:17,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:14:17,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:17,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:14:17,147 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:14:17,148 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 (45)] Waiting until timeout for monitored process [2023-12-25 10:14:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:14:17,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 10:14:17,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:14:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:14:17,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:14:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:14:18,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:14:18,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405385779] [2023-12-25 10:14:18,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405385779] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:14:18,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:14:18,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-25 10:14:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332344544] [2023-12-25 10:14:18,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:14:18,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 10:14:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:14:18,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 10:14:18,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-25 10:14:18,026 INFO L87 Difference]: Start difference. First operand 7919 states and 9637 transitions. Second operand has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 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-25 10:14:19,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:14:19,775 INFO L93 Difference]: Finished difference Result 30914 states and 37802 transitions. [2023-12-25 10:14:19,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 10:14:19,775 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 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 132 [2023-12-25 10:14:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:14:19,801 INFO L225 Difference]: With dead ends: 30914 [2023-12-25 10:14:19,801 INFO L226 Difference]: Without dead ends: 26064 [2023-12-25 10:14:19,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=430, Invalid=1462, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 10:14:19,812 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 1569 mSDsluCounter, 2898 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 3164 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:14:19,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 3164 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 10:14:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26064 states. [2023-12-25 10:14:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26064 to 17370. [2023-12-25 10:14:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17370 states, 17369 states have (on average 1.2166503540791065) internal successors, (21132), 17369 states have internal predecessors, (21132), 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-25 10:14:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17370 states to 17370 states and 21132 transitions. [2023-12-25 10:14:20,004 INFO L78 Accepts]: Start accepts. Automaton has 17370 states and 21132 transitions. Word has length 132 [2023-12-25 10:14:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:14:20,004 INFO L495 AbstractCegarLoop]: Abstraction has 17370 states and 21132 transitions. [2023-12-25 10:14:20,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 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-25 10:14:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 17370 states and 21132 transitions. [2023-12-25 10:14:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-25 10:14:20,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:14:20,008 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:14:20,014 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 (45)] Forceful destruction successful, exit code 0 [2023-12-25 10:14:20,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:20,213 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:14:20,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:14:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1490308604, now seen corresponding path program 1 times [2023-12-25 10:14:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:14:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354268314] [2023-12-25 10:14:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:14:20,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:20,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:14:20,214 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:14:20,219 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 (46)] Waiting until timeout for monitored process [2023-12-25 10:14:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:14:20,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:14:20,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:14:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:14:21,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:14:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:14:21,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:14:21,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354268314] [2023-12-25 10:14:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354268314] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:14:21,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:14:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-12-25 10:14:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335838304] [2023-12-25 10:14:21,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:14:21,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 10:14:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:14:21,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 10:14:21,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-12-25 10:14:21,487 INFO L87 Difference]: Start difference. First operand 17370 states and 21132 transitions. Second operand has 21 states, 21 states have (on average 11.619047619047619) internal successors, (244), 21 states have internal predecessors, (244), 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-25 10:14:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:14:24,162 INFO L93 Difference]: Finished difference Result 64331 states and 78181 transitions. [2023-12-25 10:14:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-25 10:14:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.619047619047619) internal successors, (244), 21 states have internal predecessors, (244), 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 132 [2023-12-25 10:14:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:14:24,220 INFO L225 Difference]: With dead ends: 64331 [2023-12-25 10:14:24,220 INFO L226 Difference]: Without dead ends: 59985 [2023-12-25 10:14:24,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=701, Invalid=2379, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 10:14:24,239 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 1913 mSDsluCounter, 3539 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1913 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 10:14:24,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1913 Valid, 3900 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 10:14:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59985 states. [2023-12-25 10:14:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59985 to 32883. [2023-12-25 10:14:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32883 states, 32882 states have (on average 1.216592664679764) internal successors, (40004), 32882 states have internal predecessors, (40004), 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-25 10:14:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32883 states to 32883 states and 40004 transitions. [2023-12-25 10:14:24,738 INFO L78 Accepts]: Start accepts. Automaton has 32883 states and 40004 transitions. Word has length 132 [2023-12-25 10:14:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:14:24,738 INFO L495 AbstractCegarLoop]: Abstraction has 32883 states and 40004 transitions. [2023-12-25 10:14:24,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.619047619047619) internal successors, (244), 21 states have internal predecessors, (244), 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-25 10:14:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 32883 states and 40004 transitions. [2023-12-25 10:14:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-25 10:14:24,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:14:24,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:14:24,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 (46)] Forceful destruction successful, exit code 0 [2023-12-25 10:14:24,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:24,948 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:14:24,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:14:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash -812040796, now seen corresponding path program 1 times [2023-12-25 10:14:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:14:24,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865307370] [2023-12-25 10:14:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:14:24,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:24,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:14:24,950 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:14:24,984 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 (47)] Waiting until timeout for monitored process [2023-12-25 10:14:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:14:25,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 10:14:25,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:14:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:14:26,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:14:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:14:26,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:14:26,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865307370] [2023-12-25 10:14:26,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865307370] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:14:26,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:14:26,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-12-25 10:14:26,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258407881] [2023-12-25 10:14:26,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:14:26,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 10:14:26,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:14:26,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 10:14:26,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2023-12-25 10:14:26,370 INFO L87 Difference]: Start difference. First operand 32883 states and 40004 transitions. Second operand has 24 states, 24 states have (on average 9.916666666666666) internal successors, (238), 24 states have internal predecessors, (238), 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-25 10:14:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:14:29,383 INFO L93 Difference]: Finished difference Result 94979 states and 116260 transitions. [2023-12-25 10:14:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 10:14:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.916666666666666) internal successors, (238), 24 states have internal predecessors, (238), 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 132 [2023-12-25 10:14:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:14:29,460 INFO L225 Difference]: With dead ends: 94979 [2023-12-25 10:14:29,460 INFO L226 Difference]: Without dead ends: 91665 [2023-12-25 10:14:29,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=513, Invalid=2139, Unknown=0, NotChecked=0, Total=2652 [2023-12-25 10:14:29,472 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 1584 mSDsluCounter, 4406 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:14:29,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 4750 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 10:14:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91665 states. [2023-12-25 10:14:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91665 to 33073. [2023-12-25 10:14:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33073 states, 33072 states have (on average 1.2171323173681665) internal successors, (40253), 33072 states have internal predecessors, (40253), 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-25 10:14:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33073 states to 33073 states and 40253 transitions. [2023-12-25 10:14:30,067 INFO L78 Accepts]: Start accepts. Automaton has 33073 states and 40253 transitions. Word has length 132 [2023-12-25 10:14:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:14:30,067 INFO L495 AbstractCegarLoop]: Abstraction has 33073 states and 40253 transitions. [2023-12-25 10:14:30,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.916666666666666) internal successors, (238), 24 states have internal predecessors, (238), 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-25 10:14:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 33073 states and 40253 transitions. [2023-12-25 10:14:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 10:14:30,073 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:14:30,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:14:30,077 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 (47)] Forceful destruction successful, exit code 0 [2023-12-25 10:14:30,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:30,277 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:14:30,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:14:30,277 INFO L85 PathProgramCache]: Analyzing trace with hash -251143792, now seen corresponding path program 1 times [2023-12-25 10:14:30,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:14:30,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937332147] [2023-12-25 10:14:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:14:30,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:30,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:14:30,279 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:14:30,281 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 (48)] Waiting until timeout for monitored process [2023-12-25 10:14:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:14:30,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:14:30,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:14:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 10:14:30,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:14:30,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:14:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937332147] [2023-12-25 10:14:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937332147] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:14:30,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:14:30,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:14:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653894431] [2023-12-25 10:14:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:14:30,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:14:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:14:30,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:14:30,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:14:30,459 INFO L87 Difference]: Start difference. First operand 33073 states and 40253 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-25 10:14:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:14:30,593 INFO L93 Difference]: Finished difference Result 54456 states and 66412 transitions. [2023-12-25 10:14:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:14:30,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 133 [2023-12-25 10:14:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:14:30,614 INFO L225 Difference]: With dead ends: 54456 [2023-12-25 10:14:30,615 INFO L226 Difference]: Without dead ends: 22055 [2023-12-25 10:14:30,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:14:30,634 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 90 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:14:30,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 148 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:14:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22055 states. [2023-12-25 10:14:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22055 to 22055. [2023-12-25 10:14:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22055 states, 22054 states have (on average 1.2071733018953479) internal successors, (26623), 22054 states have internal predecessors, (26623), 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-25 10:14:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22055 states to 22055 states and 26623 transitions. [2023-12-25 10:14:31,028 INFO L78 Accepts]: Start accepts. Automaton has 22055 states and 26623 transitions. Word has length 133 [2023-12-25 10:14:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:14:31,028 INFO L495 AbstractCegarLoop]: Abstraction has 22055 states and 26623 transitions. [2023-12-25 10:14:31,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-25 10:14:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 22055 states and 26623 transitions. [2023-12-25 10:14:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 10:14:31,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:14:31,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:14:31,036 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 (48)] Forceful destruction successful, exit code 0 [2023-12-25 10:14:31,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:31,235 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:14:31,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:14:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash 443476932, now seen corresponding path program 1 times [2023-12-25 10:14:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:14:31,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45417904] [2023-12-25 10:14:31,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:14:31,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:31,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:14:31,238 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:14:31,239 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 (49)] Waiting until timeout for monitored process [2023-12-25 10:14:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:14:31,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:14:31,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:14:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 10:14:31,408 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:14:31,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:14:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45417904] [2023-12-25 10:14:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45417904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:14:31,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:14:31,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:14:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96364209] [2023-12-25 10:14:31,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:14:31,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:14:31,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:14:31,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:14:31,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:14:31,409 INFO L87 Difference]: Start difference. First operand 22055 states and 26623 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-25 10:14:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:14:31,505 INFO L93 Difference]: Finished difference Result 32663 states and 39460 transitions. [2023-12-25 10:14:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:14:31,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 133 [2023-12-25 10:14:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:14:31,515 INFO L225 Difference]: With dead ends: 32663 [2023-12-25 10:14:31,516 INFO L226 Difference]: Without dead ends: 11200 [2023-12-25 10:14:31,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:14:31,551 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 96 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:14:31,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 127 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:14:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11200 states. [2023-12-25 10:14:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11200 to 11183. [2023-12-25 10:14:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11183 states, 11182 states have (on average 1.1893221248434984) internal successors, (13299), 11182 states have internal predecessors, (13299), 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-25 10:14:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 13299 transitions. [2023-12-25 10:14:31,662 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 13299 transitions. Word has length 133 [2023-12-25 10:14:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:14:31,663 INFO L495 AbstractCegarLoop]: Abstraction has 11183 states and 13299 transitions. [2023-12-25 10:14:31,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-25 10:14:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 13299 transitions. [2023-12-25 10:14:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 10:14:31,665 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:14:31,665 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:14:31,674 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 (49)] Forceful destruction successful, exit code 0 [2023-12-25 10:14:31,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:31,868 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:14:31,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:14:31,869 INFO L85 PathProgramCache]: Analyzing trace with hash 467111949, now seen corresponding path program 1 times [2023-12-25 10:14:31,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:14:31,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60604160] [2023-12-25 10:14:31,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:14:31,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:14:31,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:14:31,870 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:14:31,895 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 (50)] Waiting until timeout for monitored process [2023-12-25 10:14:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:14:32,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 10:14:32,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:14:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:14:40,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:14:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:14:47,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:14:47,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60604160] [2023-12-25 10:14:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60604160] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:14:47,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:14:47,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2023-12-25 10:14:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179358645] [2023-12-25 10:14:47,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:14:47,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-25 10:14:47,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:14:47,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-25 10:14:47,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1461, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 10:14:47,455 INFO L87 Difference]: Start difference. First operand 11183 states and 13299 transitions. Second operand has 41 states, 41 states have (on average 6.195121951219512) internal successors, (254), 41 states have internal predecessors, (254), 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-25 10:18:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:18:54,401 INFO L93 Difference]: Finished difference Result 53354 states and 63487 transitions. [2023-12-25 10:18:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-12-25 10:18:54,402 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.195121951219512) internal successors, (254), 41 states have internal predecessors, (254), 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 133 [2023-12-25 10:18:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:18:54,447 INFO L225 Difference]: With dead ends: 53354 [2023-12-25 10:18:54,447 INFO L226 Difference]: Without dead ends: 49240 [2023-12-25 10:18:54,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6795 ImplicationChecksByTransitivity, 148.0s TimeCoverageRelationStatistics Valid=2388, Invalid=20253, Unknown=9, NotChecked=0, Total=22650 [2023-12-25 10:18:54,463 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 5406 mSDsluCounter, 18031 mSDsCounter, 0 mSdLazyCounter, 7843 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 108.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5406 SdHoareTripleChecker+Valid, 18883 SdHoareTripleChecker+Invalid, 7886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 7843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 111.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:18:54,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5406 Valid, 18883 Invalid, 7886 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 7843 Invalid, 0 Unknown, 0 Unchecked, 111.0s Time] [2023-12-25 10:18:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49240 states. [2023-12-25 10:18:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49240 to 23891. [2023-12-25 10:18:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23891 states, 23890 states have (on average 1.19430724152365) internal successors, (28532), 23890 states have internal predecessors, (28532), 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-25 10:18:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23891 states to 23891 states and 28532 transitions. [2023-12-25 10:18:54,808 INFO L78 Accepts]: Start accepts. Automaton has 23891 states and 28532 transitions. Word has length 133 [2023-12-25 10:18:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:18:54,809 INFO L495 AbstractCegarLoop]: Abstraction has 23891 states and 28532 transitions. [2023-12-25 10:18:54,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.195121951219512) internal successors, (254), 41 states have internal predecessors, (254), 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-25 10:18:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 23891 states and 28532 transitions. [2023-12-25 10:18:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 10:18:54,813 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:18:54,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:18:54,816 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 (50)] Forceful destruction successful, exit code 0 [2023-12-25 10:18:55,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:18:55,016 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:18:55,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:18:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1482792967, now seen corresponding path program 1 times [2023-12-25 10:18:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:18:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413379306] [2023-12-25 10:18:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:18:55,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:18:55,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:18:55,018 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:18:55,022 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 (51)] Waiting until timeout for monitored process [2023-12-25 10:18:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:18:55,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:18:55,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:18:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 10:18:55,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:18:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 10:18:55,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:18:55,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413379306] [2023-12-25 10:18:55,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413379306] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:18:55,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:18:55,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 10:18:55,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105394306] [2023-12-25 10:18:55,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:18:55,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:18:55,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:18:55,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:18:55,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:18:55,497 INFO L87 Difference]: Start difference. First operand 23891 states and 28532 transitions. Second operand has 8 states, 8 states have (on average 32.0) internal successors, (256), 8 states have internal predecessors, (256), 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-25 10:18:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:18:55,663 INFO L93 Difference]: Finished difference Result 74067 states and 87742 transitions. [2023-12-25 10:18:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 10:18:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.0) internal successors, (256), 8 states have internal predecessors, (256), 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 133 [2023-12-25 10:18:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:18:55,713 INFO L225 Difference]: With dead ends: 74067 [2023-12-25 10:18:55,713 INFO L226 Difference]: Without dead ends: 51252 [2023-12-25 10:18:55,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:18:55,734 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 100 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:18:55,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 676 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:18:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51252 states. [2023-12-25 10:18:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51252 to 48819. [2023-12-25 10:18:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48819 states, 48818 states have (on average 1.1597771313859642) internal successors, (56618), 48818 states have internal predecessors, (56618), 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-25 10:18:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48819 states to 48819 states and 56618 transitions. [2023-12-25 10:18:56,152 INFO L78 Accepts]: Start accepts. Automaton has 48819 states and 56618 transitions. Word has length 133 [2023-12-25 10:18:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:18:56,153 INFO L495 AbstractCegarLoop]: Abstraction has 48819 states and 56618 transitions. [2023-12-25 10:18:56,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.0) internal successors, (256), 8 states have internal predecessors, (256), 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-25 10:18:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 48819 states and 56618 transitions. [2023-12-25 10:18:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-25 10:18:56,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:18:56,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:18:56,162 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 (51)] Forceful destruction successful, exit code 0 [2023-12-25 10:18:56,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:18:56,360 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:18:56,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:18:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash -209166217, now seen corresponding path program 1 times [2023-12-25 10:18:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:18:56,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644770066] [2023-12-25 10:18:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:18:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:18:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:18:56,361 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:18:56,367 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 (52)] Waiting until timeout for monitored process [2023-12-25 10:18:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:18:56,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:18:56,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:18:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 10:18:56,547 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:18:56,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:18:56,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644770066] [2023-12-25 10:18:56,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644770066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:18:56,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:18:56,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:18:56,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776908509] [2023-12-25 10:18:56,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:18:56,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:18:56,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:18:56,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:18:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:18:56,553 INFO L87 Difference]: Start difference. First operand 48819 states and 56618 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-25 10:18:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:18:56,968 INFO L93 Difference]: Finished difference Result 80786 states and 93631 transitions. [2023-12-25 10:18:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:18:56,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 134 [2023-12-25 10:18:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:18:57,002 INFO L225 Difference]: With dead ends: 80786 [2023-12-25 10:18:57,002 INFO L226 Difference]: Without dead ends: 33078 [2023-12-25 10:18:57,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:18:57,024 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 92 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:18:57,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 134 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:18:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33078 states. [2023-12-25 10:18:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33078 to 33078. [2023-12-25 10:18:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33078 states, 33077 states have (on average 1.1384950267557516) internal successors, (37658), 33077 states have internal predecessors, (37658), 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-25 10:18:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33078 states to 33078 states and 37658 transitions. [2023-12-25 10:18:57,432 INFO L78 Accepts]: Start accepts. Automaton has 33078 states and 37658 transitions. Word has length 134 [2023-12-25 10:18:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:18:57,432 INFO L495 AbstractCegarLoop]: Abstraction has 33078 states and 37658 transitions. [2023-12-25 10:18:57,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-25 10:18:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 33078 states and 37658 transitions. [2023-12-25 10:18:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-25 10:18:57,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:18:57,435 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:18:57,440 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 (52)] Forceful destruction successful, exit code 0 [2023-12-25 10:18:57,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:18:57,638 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:18:57,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:18:57,639 INFO L85 PathProgramCache]: Analyzing trace with hash -474364469, now seen corresponding path program 1 times [2023-12-25 10:18:57,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:18:57,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694784941] [2023-12-25 10:18:57,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:18:57,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:18:57,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:18:57,640 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:18:57,641 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 (53)] Waiting until timeout for monitored process [2023-12-25 10:18:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:18:57,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:18:57,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:18:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:18:58,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:18:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:18:58,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:18:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694784941] [2023-12-25 10:18:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694784941] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:18:58,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:18:58,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-12-25 10:18:58,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314188271] [2023-12-25 10:18:58,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:18:58,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 10:18:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:18:58,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 10:18:58,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-12-25 10:18:58,877 INFO L87 Difference]: Start difference. First operand 33078 states and 37658 transitions. Second operand has 21 states, 21 states have (on average 11.80952380952381) internal successors, (248), 21 states have internal predecessors, (248), 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-25 10:19:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:19:01,168 INFO L93 Difference]: Finished difference Result 85323 states and 96685 transitions. [2023-12-25 10:19:01,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-25 10:19:01,169 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.80952380952381) internal successors, (248), 21 states have internal predecessors, (248), 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 134 [2023-12-25 10:19:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:19:01,238 INFO L225 Difference]: With dead ends: 85323 [2023-12-25 10:19:01,239 INFO L226 Difference]: Without dead ends: 72220 [2023-12-25 10:19:01,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=612, Invalid=2144, Unknown=0, NotChecked=0, Total=2756 [2023-12-25 10:19:01,261 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 1504 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 3629 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 10:19:01,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 3629 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 10:19:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72220 states. [2023-12-25 10:19:01,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72220 to 40261. [2023-12-25 10:19:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40261 states, 40260 states have (on average 1.1346249379036264) internal successors, (45680), 40260 states have internal predecessors, (45680), 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-25 10:19:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40261 states to 40261 states and 45680 transitions. [2023-12-25 10:19:01,839 INFO L78 Accepts]: Start accepts. Automaton has 40261 states and 45680 transitions. Word has length 134 [2023-12-25 10:19:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:19:01,839 INFO L495 AbstractCegarLoop]: Abstraction has 40261 states and 45680 transitions. [2023-12-25 10:19:01,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.80952380952381) internal successors, (248), 21 states have internal predecessors, (248), 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-25 10:19:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 40261 states and 45680 transitions. [2023-12-25 10:19:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-25 10:19:01,841 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:19:01,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:19:01,845 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 (53)] Forceful destruction successful, exit code 0 [2023-12-25 10:19:02,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:19:02,045 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:19:02,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:19:02,046 INFO L85 PathProgramCache]: Analyzing trace with hash 891781000, now seen corresponding path program 1 times [2023-12-25 10:19:02,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:19:02,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251625362] [2023-12-25 10:19:02,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:19:02,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:19:02,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:19:02,047 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:19:02,048 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 (54)] Waiting until timeout for monitored process [2023-12-25 10:19:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:19:02,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:19:02,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:19:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 10:19:02,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:19:02,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:19:02,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251625362] [2023-12-25 10:19:02,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251625362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:19:02,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:19:02,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:19:02,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863213978] [2023-12-25 10:19:02,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:19:02,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:19:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:19:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:19:02,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:19:02,219 INFO L87 Difference]: Start difference. First operand 40261 states and 45680 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-25 10:19:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:19:02,361 INFO L93 Difference]: Finished difference Result 65692 states and 74729 transitions. [2023-12-25 10:19:02,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:19:02,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 134 [2023-12-25 10:19:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:19:02,386 INFO L225 Difference]: With dead ends: 65692 [2023-12-25 10:19:02,386 INFO L226 Difference]: Without dead ends: 26094 [2023-12-25 10:19:02,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:19:02,405 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 86 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:19:02,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 149 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:19:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26094 states. [2023-12-25 10:19:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26094 to 26094. [2023-12-25 10:19:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26094 states, 26093 states have (on average 1.1250526961253977) internal successors, (29356), 26093 states have internal predecessors, (29356), 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-25 10:19:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26094 states to 26094 states and 29356 transitions. [2023-12-25 10:19:02,771 INFO L78 Accepts]: Start accepts. Automaton has 26094 states and 29356 transitions. Word has length 134 [2023-12-25 10:19:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:19:02,771 INFO L495 AbstractCegarLoop]: Abstraction has 26094 states and 29356 transitions. [2023-12-25 10:19:02,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-25 10:19:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 26094 states and 29356 transitions. [2023-12-25 10:19:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 10:19:02,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:19:02,773 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:19:02,778 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 (54)] Forceful destruction successful, exit code 0 [2023-12-25 10:19:02,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:19:02,976 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:19:02,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:19:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash 307033567, now seen corresponding path program 1 times [2023-12-25 10:19:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:19:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16340802] [2023-12-25 10:19:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:19:02,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:19:02,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:19:02,984 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:19:02,985 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 (55)] Waiting until timeout for monitored process [2023-12-25 10:19:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:19:03,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 10:19:03,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:19:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:19:04,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:19:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:19:04,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:19:04,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16340802] [2023-12-25 10:19:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16340802] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:19:04,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:19:04,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2023-12-25 10:19:04,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185919024] [2023-12-25 10:19:04,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:19:04,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 10:19:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:19:04,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 10:19:04,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2023-12-25 10:19:04,639 INFO L87 Difference]: Start difference. First operand 26094 states and 29356 transitions. Second operand has 25 states, 25 states have (on average 10.12) internal successors, (253), 25 states have internal predecessors, (253), 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-25 10:19:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:19:07,384 INFO L93 Difference]: Finished difference Result 41688 states and 46950 transitions. [2023-12-25 10:19:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 10:19:07,384 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.12) internal successors, (253), 25 states have internal predecessors, (253), 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 135 [2023-12-25 10:19:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:19:07,419 INFO L225 Difference]: With dead ends: 41688 [2023-12-25 10:19:07,419 INFO L226 Difference]: Without dead ends: 36509 [2023-12-25 10:19:07,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=525, Invalid=2231, Unknown=0, NotChecked=0, Total=2756 [2023-12-25 10:19:07,431 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 1789 mSDsluCounter, 3966 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 4286 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:19:07,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 4286 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:19:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36509 states. [2023-12-25 10:19:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36509 to 18175. [2023-12-25 10:19:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18175 states, 18174 states have (on average 1.1202817211400902) internal successors, (20360), 18174 states have internal predecessors, (20360), 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-25 10:19:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18175 states to 18175 states and 20360 transitions. [2023-12-25 10:19:07,654 INFO L78 Accepts]: Start accepts. Automaton has 18175 states and 20360 transitions. Word has length 135 [2023-12-25 10:19:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:19:07,654 INFO L495 AbstractCegarLoop]: Abstraction has 18175 states and 20360 transitions. [2023-12-25 10:19:07,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.12) internal successors, (253), 25 states have internal predecessors, (253), 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-25 10:19:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 18175 states and 20360 transitions. [2023-12-25 10:19:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-25 10:19:07,667 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:19:07,667 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:19:07,672 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 (55)] Forceful destruction successful, exit code 0 [2023-12-25 10:19:07,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:19:07,870 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:19:07,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:19:07,871 INFO L85 PathProgramCache]: Analyzing trace with hash 156659140, now seen corresponding path program 1 times [2023-12-25 10:19:07,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:19:07,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002851278] [2023-12-25 10:19:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:19:07,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:19:07,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:19:07,886 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:19:07,886 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 (56)] Waiting until timeout for monitored process [2023-12-25 10:19:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:19:08,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 10:19:08,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:19:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 19 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:19:09,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:19:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 19 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:19:10,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:19:10,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002851278] [2023-12-25 10:19:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002851278] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:19:10,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:19:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2023-12-25 10:19:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635810695] [2023-12-25 10:19:10,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:19:10,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 10:19:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:19:10,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 10:19:10,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1377, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 10:19:10,562 INFO L87 Difference]: Start difference. First operand 18175 states and 20360 transitions. Second operand has 39 states, 39 states have (on average 9.58974358974359) internal successors, (374), 39 states have internal predecessors, (374), 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-25 10:19:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:19:44,557 INFO L93 Difference]: Finished difference Result 41720 states and 46571 transitions. [2023-12-25 10:19:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2023-12-25 10:19:44,557 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 9.58974358974359) internal successors, (374), 39 states have internal predecessors, (374), 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 194 [2023-12-25 10:19:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:19:44,594 INFO L225 Difference]: With dead ends: 41720 [2023-12-25 10:19:44,594 INFO L226 Difference]: Without dead ends: 38190 [2023-12-25 10:19:44,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12192 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=5361, Invalid=33645, Unknown=0, NotChecked=0, Total=39006 [2023-12-25 10:19:44,606 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 3158 mSDsluCounter, 10771 mSDsCounter, 0 mSdLazyCounter, 4023 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3158 SdHoareTripleChecker+Valid, 11230 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-25 10:19:44,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3158 Valid, 11230 Invalid, 4084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4023 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-12-25 10:19:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38190 states. [2023-12-25 10:19:44,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38190 to 19865. [2023-12-25 10:19:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19865 states, 19864 states have (on average 1.1202678211840515) internal successors, (22253), 19864 states have internal predecessors, (22253), 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-25 10:19:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19865 states to 19865 states and 22253 transitions. [2023-12-25 10:19:44,835 INFO L78 Accepts]: Start accepts. Automaton has 19865 states and 22253 transitions. Word has length 194 [2023-12-25 10:19:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:19:44,835 INFO L495 AbstractCegarLoop]: Abstraction has 19865 states and 22253 transitions. [2023-12-25 10:19:44,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 9.58974358974359) internal successors, (374), 39 states have internal predecessors, (374), 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-25 10:19:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 19865 states and 22253 transitions. [2023-12-25 10:19:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-25 10:19:44,841 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:19:44,841 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:19:44,844 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 (56)] Forceful destruction successful, exit code 0 [2023-12-25 10:19:45,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:19:45,045 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:19:45,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:19:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1484558654, now seen corresponding path program 1 times [2023-12-25 10:19:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:19:45,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569576671] [2023-12-25 10:19:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:19:45,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:19:45,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:19:45,047 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:19:45,050 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 (57)] Waiting until timeout for monitored process [2023-12-25 10:19:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:19:45,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-25 10:19:45,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:19:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 37 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:19:48,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:19:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:19:51,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:19:51,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569576671] [2023-12-25 10:19:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569576671] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:19:51,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:19:51,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2023-12-25 10:19:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578784462] [2023-12-25 10:19:51,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:19:51,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-12-25 10:19:51,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:19:51,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-12-25 10:19:51,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=3069, Unknown=0, NotChecked=0, Total=3660 [2023-12-25 10:19:51,803 INFO L87 Difference]: Start difference. First operand 19865 states and 22253 transitions. Second operand has 61 states, 61 states have (on average 6.049180327868853) internal successors, (369), 61 states have internal predecessors, (369), 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-25 10:24:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:24:53,765 INFO L93 Difference]: Finished difference Result 119221 states and 135171 transitions. [2023-12-25 10:24:53,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 743 states. [2023-12-25 10:24:53,765 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 6.049180327868853) internal successors, (369), 61 states have internal predecessors, (369), 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 194 [2023-12-25 10:24:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:24:53,904 INFO L225 Difference]: With dead ends: 119221 [2023-12-25 10:24:53,904 INFO L226 Difference]: Without dead ends: 115089 [2023-12-25 10:24:53,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1126 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 799 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291026 ImplicationChecksByTransitivity, 285.1s TimeCoverageRelationStatistics Valid=68647, Invalid=572153, Unknown=0, NotChecked=0, Total=640800 [2023-12-25 10:24:53,946 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 8999 mSDsluCounter, 21674 mSDsCounter, 0 mSdLazyCounter, 11499 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8999 SdHoareTripleChecker+Valid, 22272 SdHoareTripleChecker+Invalid, 11662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 11499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:24:53,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8999 Valid, 22272 Invalid, 11662 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [163 Valid, 11499 Invalid, 0 Unknown, 0 Unchecked, 17.9s Time] [2023-12-25 10:24:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115089 states. [2023-12-25 10:24:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115089 to 43623. [2023-12-25 10:24:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43623 states, 43622 states have (on average 1.1254183668790978) internal successors, (49093), 43622 states have internal predecessors, (49093), 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-25 10:24:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43623 states to 43623 states and 49093 transitions. [2023-12-25 10:24:54,857 INFO L78 Accepts]: Start accepts. Automaton has 43623 states and 49093 transitions. Word has length 194 [2023-12-25 10:24:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:24:54,858 INFO L495 AbstractCegarLoop]: Abstraction has 43623 states and 49093 transitions. [2023-12-25 10:24:54,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 6.049180327868853) internal successors, (369), 61 states have internal predecessors, (369), 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-25 10:24:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 43623 states and 49093 transitions. [2023-12-25 10:24:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-12-25 10:24:54,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:24:54,865 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:24:54,871 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 (57)] Forceful destruction successful, exit code 0 [2023-12-25 10:24:55,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:24:55,072 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:24:55,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:24:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1444179083, now seen corresponding path program 1 times [2023-12-25 10:24:55,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:24:55,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660117980] [2023-12-25 10:24:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:24:55,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:24:55,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:24:55,074 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:24:55,075 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 (58)] Waiting until timeout for monitored process [2023-12-25 10:24:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:24:55,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 10:24:55,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:24:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 28 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:24:55,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:24:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 28 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:24:56,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:24:56,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660117980] [2023-12-25 10:24:56,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660117980] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:24:56,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:24:56,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2023-12-25 10:24:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255342052] [2023-12-25 10:24:56,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:24:56,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 10:24:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:24:56,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 10:24:56,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2023-12-25 10:24:56,705 INFO L87 Difference]: Start difference. First operand 43623 states and 49093 transitions. Second operand has 32 states, 32 states have (on average 9.4375) internal successors, (302), 32 states have internal predecessors, (302), 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-25 10:25:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:02,435 INFO L93 Difference]: Finished difference Result 70123 states and 79028 transitions. [2023-12-25 10:25:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-12-25 10:25:02,435 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 9.4375) internal successors, (302), 32 states have internal predecessors, (302), 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 195 [2023-12-25 10:25:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:02,579 INFO L225 Difference]: With dead ends: 70123 [2023-12-25 10:25:02,579 INFO L226 Difference]: Without dead ends: 66165 [2023-12-25 10:25:02,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 358 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 10 DeprecatedPredicates, 2077 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1169, Invalid=7021, Unknown=0, NotChecked=0, Total=8190 [2023-12-25 10:25:02,591 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 1069 mSDsluCounter, 5508 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 5884 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:02,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 5884 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 10:25:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66165 states. [2023-12-25 10:25:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66165 to 44960. [2023-12-25 10:25:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44960 states, 44959 states have (on average 1.1245579305589537) internal successors, (50559), 44959 states have internal predecessors, (50559), 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-25 10:25:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44960 states to 44960 states and 50559 transitions. [2023-12-25 10:25:03,005 INFO L78 Accepts]: Start accepts. Automaton has 44960 states and 50559 transitions. Word has length 195 [2023-12-25 10:25:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:03,006 INFO L495 AbstractCegarLoop]: Abstraction has 44960 states and 50559 transitions. [2023-12-25 10:25:03,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.4375) internal successors, (302), 32 states have internal predecessors, (302), 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-25 10:25:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 44960 states and 50559 transitions. [2023-12-25 10:25:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-12-25 10:25:03,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:03,012 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:25:03,016 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 (58)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:03,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:25:03,216 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-25 10:25:03,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash -340516936, now seen corresponding path program 1 times [2023-12-25 10:25:03,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:03,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466749108] [2023-12-25 10:25:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:03,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:25:03,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:03,218 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:25:03,219 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 (59)] Waiting until timeout for monitored process [2023-12-25 10:25:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:03,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-25 10:25:03,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 80 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-25 10:25:06,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:25:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 37 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:25:09,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:09,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466749108] [2023-12-25 10:25:09,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466749108] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:25:09,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:25:09,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 35] total 61 [2023-12-25 10:25:09,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696342566] [2023-12-25 10:25:09,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:25:09,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-12-25 10:25:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:09,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-12-25 10:25:09,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=3270, Unknown=0, NotChecked=0, Total=3660 [2023-12-25 10:25:09,889 INFO L87 Difference]: Start difference. First operand 44960 states and 50559 transitions. Second operand has 61 states, 61 states have (on average 5.655737704918033) internal successors, (345), 61 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-25 10:25:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2023-12-25 10:25:53,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10165 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=5810, Invalid=32802, Unknown=0, NotChecked=0, Total=38612 [2023-12-25 10:25:53,555 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 2259 mSDsluCounter, 4186 mSDsCounter, 0 mSdLazyCounter, 4213 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2259 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 4291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 4213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:53,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2259 Valid, 4312 Invalid, 4291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4213 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-12-25 10:25:53,556 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2023-12-25 10:25:53,563 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 (59)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 10:25:53,563 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-25 10:25:53,563 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 (59)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:53,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:25:53,760 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. [2023-12-25 10:25:53,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2023-12-25 10:25:53,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2023-12-25 10:25:53,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2023-12-25 10:25:53,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2023-12-25 10:25:53,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2023-12-25 10:25:53,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2023-12-25 10:25:53,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2023-12-25 10:25:53,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2023-12-25 10:25:53,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2023-12-25 10:25:53,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2023-12-25 10:25:53,764 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:25:53,766 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 10:25:53,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 10:25:53 BoogieIcfgContainer [2023-12-25 10:25:53,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 10:25:53,767 INFO L158 Benchmark]: Toolchain (without parser) took 873804.98ms. Allocated memory was 170.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 123.5MB in the beginning and 862.2MB in the end (delta: -738.8MB). Peak memory consumption was 305.4MB. Max. memory is 8.0GB. [2023-12-25 10:25:53,767 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 170.9MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 10:25:53,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 727.71ms. Allocated memory is still 170.9MB. Free memory was 123.5MB in the beginning and 128.7MB in the end (delta: -5.3MB). Peak memory consumption was 42.8MB. Max. memory is 8.0GB. [2023-12-25 10:25:53,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.65ms. Allocated memory is still 170.9MB. Free memory was 128.7MB in the beginning and 121.9MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-25 10:25:53,768 INFO L158 Benchmark]: Boogie Preprocessor took 63.69ms. Allocated memory is still 170.9MB. Free memory was 121.4MB in the beginning and 113.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-25 10:25:53,768 INFO L158 Benchmark]: RCFGBuilder took 1366.76ms. Allocated memory is still 170.9MB. Free memory was 113.0MB in the beginning and 84.2MB in the end (delta: 28.8MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. [2023-12-25 10:25:53,768 INFO L158 Benchmark]: TraceAbstraction took 871563.23ms. Allocated memory was 170.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 83.7MB in the beginning and 862.2MB in the end (delta: -778.6MB). Peak memory consumption was 264.8MB. Max. memory is 8.0GB. [2023-12-25 10:25:53,768 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.15ms. Allocated memory is still 170.9MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 727.71ms. Allocated memory is still 170.9MB. Free memory was 123.5MB in the beginning and 128.7MB in the end (delta: -5.3MB). Peak memory consumption was 42.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.65ms. Allocated memory is still 170.9MB. Free memory was 128.7MB in the beginning and 121.9MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.69ms. Allocated memory is still 170.9MB. Free memory was 121.4MB in the beginning and 113.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1366.76ms. Allocated memory is still 170.9MB. Free memory was 113.0MB in the beginning and 84.2MB in the end (delta: 28.8MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. * TraceAbstraction took 871563.23ms. Allocated memory was 170.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 83.7MB in the beginning and 862.2MB in the end (delta: -778.6MB). Peak memory consumption was 264.8MB. 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: 500]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 500). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - TimeoutResultAtElement [Line: 794]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 794). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - TimeoutResultAtElement [Line: 884]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 884). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - TimeoutResultAtElement [Line: 933]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 933). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1051). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - TimeoutResultAtElement [Line: 1100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1100). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - TimeoutResultAtElement [Line: 1176]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1176). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - TimeoutResultAtElement [Line: 1356]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1356). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - TimeoutResultAtElement [Line: 1405]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1405). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - TimeoutResultAtElement [Line: 1482]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1482). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - TimeoutResultAtElement [Line: 1622]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1622). Cancelled while NwaCegarLoop was constructing difference of abstraction (44960states) and FLOYD_HOARE automaton (currently 139 states, 61 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 197 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 356 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 871.5s, OverallIterations: 58, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 776.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76758 SdHoareTripleChecker+Valid, 204.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76758 mSDsluCounter, 148868 SdHoareTripleChecker+Invalid, 196.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134356 mSDsCounter, 769 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62759 IncrementalHoareTripleChecker+Invalid, 63528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 769 mSolverCounterUnsat, 14512 mSDtfsCounter, 62759 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10883 GetRequests, 7929 SyntacticMatches, 5 SemanticMatches, 2948 ConstructedPredicates, 0 IntricatePredicates, 10 DeprecatedPredicates, 402258 ImplicationChecksByTransitivity, 595.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48819occurred in iteration=50, InterpolantAutomatonStates: 2365, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 57 MinimizatonAttempts, 446790 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 68.0s InterpolantComputationTime, 6194 NumberOfCodeBlocks, 6194 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 8607 ConstructedInterpolants, 2658 QuantifiedInterpolants, 118669 SizeOfPredicates, 356 NumberOfNonLiveVariables, 16619 ConjunctsInSsa, 611 ConjunctsInUnsatCore, 75 InterpolantComputations, 41 PerfectInterpolantSequences, 747/1612 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