/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/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:29:03,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:29:03,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:29:03,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:29:03,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:29:03,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:29:03,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:29:03,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:29:03,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:29:03,235 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:29:03,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:29:03,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:29:03,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:29:03,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:29:03,237 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:29:03,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:29:03,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:29:03,238 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:29:03,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:29:03,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:29:03,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:29:03,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:29:03,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:29:03,239 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:29:03,239 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:29:03,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:29:03,240 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:29:03,240 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:29:03,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:29:03,240 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:29:03,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:29:03,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:29:03,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:29:03,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:29:03,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:29:03,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:29:03,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:29:03,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:29:03,242 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:29:03,242 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:29:03,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:29:03,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:29:03,242 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:29:03,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:29:03,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:29:03,243 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:29:03,243 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:29:03,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:29:03,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:29:03,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:29:03,453 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:29:03,453 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:29:03,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2023-12-16 16:29:04,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:29:04,620 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:29:04,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2023-12-16 16:29:04,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661b83d02/58fd3b2d73c34fc6999f28f075640de2/FLAGd9cdd29f2 [2023-12-16 16:29:04,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661b83d02/58fd3b2d73c34fc6999f28f075640de2 [2023-12-16 16:29:04,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:29:04,654 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:29:04,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:29:04,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:29:04,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:29:04,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:29:04" (1/1) ... [2023-12-16 16:29:04,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191b9ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:04, skipping insertion in model container [2023-12-16 16:29:04,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:29:04" (1/1) ... [2023-12-16 16:29:04,727 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:29:04,854 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2023-12-16 16:29:04,863 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2023-12-16 16:29:05,124 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2023-12-16 16:29:05,127 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2023-12-16 16:29:05,131 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2023-12-16 16:29:05,133 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2023-12-16 16:29:05,137 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2023-12-16 16:29:05,139 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2023-12-16 16:29:05,145 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2023-12-16 16:29:05,150 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2023-12-16 16:29:05,155 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2023-12-16 16:29:05,158 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2023-12-16 16:29:05,161 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2023-12-16 16:29:05,164 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2023-12-16 16:29:05,167 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2023-12-16 16:29:05,171 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2023-12-16 16:29:05,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:29:05,206 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:29:05,216 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2023-12-16 16:29:05,221 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2023-12-16 16:29:05,400 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2023-12-16 16:29:05,403 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2023-12-16 16:29:05,406 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2023-12-16 16:29:05,409 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2023-12-16 16:29:05,437 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2023-12-16 16:29:05,439 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2023-12-16 16:29:05,442 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2023-12-16 16:29:05,468 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2023-12-16 16:29:05,473 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2023-12-16 16:29:05,475 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2023-12-16 16:29:05,478 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2023-12-16 16:29:05,480 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2023-12-16 16:29:05,514 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2023-12-16 16:29:05,517 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2023-12-16 16:29:05,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:29:05,536 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:29:05,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05 WrapperNode [2023-12-16 16:29:05,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:29:05,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:29:05,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:29:05,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:29:05,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,658 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3513 [2023-12-16 16:29:05,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:29:05,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:29:05,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:29:05,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:29:05,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,709 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 16:29:05,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:29:05,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:29:05,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:29:05,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:29:05,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (1/1) ... [2023-12-16 16:29:05,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:29:05,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:29:05,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:29:05,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:29:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:29:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:29:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:29:05,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:29:06,043 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:29:06,045 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:29:07,365 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:29:07,414 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:29:07,414 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 16:29:07,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:29:07 BoogieIcfgContainer [2023-12-16 16:29:07,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:29:07,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:29:07,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:29:07,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:29:07,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:29:04" (1/3) ... [2023-12-16 16:29:07,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bcb7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:29:07, skipping insertion in model container [2023-12-16 16:29:07,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:05" (2/3) ... [2023-12-16 16:29:07,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bcb7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:29:07, skipping insertion in model container [2023-12-16 16:29:07,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:29:07" (3/3) ... [2023-12-16 16:29:07,420 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2023-12-16 16:29:07,432 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:29:07,432 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-12-16 16:29:07,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:29:07,492 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;@34dbe7e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:29:07,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-12-16 16:29:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 473 states, 456 states have (on average 1.9714912280701755) internal successors, (899), 472 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:29:07,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:07,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:29:07,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:07,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:07,505 INFO L85 PathProgramCache]: Analyzing trace with hash -662524203, now seen corresponding path program 1 times [2023-12-16 16:29:07,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:07,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709257941] [2023-12-16 16:29:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:07,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:07,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:07,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:07,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:29:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:07,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:29:07,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:07,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:07,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709257941] [2023-12-16 16:29:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709257941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:07,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:07,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:29:07,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633991805] [2023-12-16 16:29:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:07,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:29:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:07,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:29:07,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:29:07,816 INFO L87 Difference]: Start difference. First operand has 473 states, 456 states have (on average 1.9714912280701755) internal successors, (899), 472 states have internal predecessors, (899), 0 states have call successors, (0), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:08,478 INFO L93 Difference]: Finished difference Result 485 states and 912 transitions. [2023-12-16 16:29:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:29:08,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-12-16 16:29:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:08,489 INFO L225 Difference]: With dead ends: 485 [2023-12-16 16:29:08,489 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:08,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:29:08,493 INFO L413 NwaCegarLoop]: 872 mSDtfsCounter, 20 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2075 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.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:08,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2075 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 16:29:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.278169014084507) internal successors, (363), 299 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 363 transitions. [2023-12-16 16:29:08,524 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 363 transitions. Word has length 6 [2023-12-16 16:29:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:08,524 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 363 transitions. [2023-12-16 16:29:08,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 363 transitions. [2023-12-16 16:29:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 16:29:08,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:08,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:08,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 16:29:08,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:08,726 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:08,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:08,726 INFO L85 PathProgramCache]: Analyzing trace with hash 936590238, now seen corresponding path program 1 times [2023-12-16 16:29:08,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:08,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662762644] [2023-12-16 16:29:08,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:08,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:08,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:08,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:08,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:29:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:08,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:29:08,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:08,932 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:08,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662762644] [2023-12-16 16:29:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662762644] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:08,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:08,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:29:08,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597401530] [2023-12-16 16:29:08,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:08,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:29:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:08,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:29:08,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:29:08,936 INFO L87 Difference]: Start difference. First operand 300 states and 363 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:09,363 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2023-12-16 16:29:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:29:09,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-12-16 16:29:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:09,365 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:09,365 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:09,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:29:09,366 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 4 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:09,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 781 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 16:29:09,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2765957446808511) internal successors, (360), 297 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 360 transitions. [2023-12-16 16:29:09,374 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 360 transitions. Word has length 7 [2023-12-16 16:29:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:09,375 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 360 transitions. [2023-12-16 16:29:09,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 360 transitions. [2023-12-16 16:29:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:29:09,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:09,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:09,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:09,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:09,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:09,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:09,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1606007419, now seen corresponding path program 1 times [2023-12-16 16:29:09,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:09,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86921118] [2023-12-16 16:29:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:09,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:09,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:09,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:09,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:29:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:09,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:29:09,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:09,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:09,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86921118] [2023-12-16 16:29:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86921118] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:09,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:09,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:29:09,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700722458] [2023-12-16 16:29:09,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:09,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:29:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:09,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:29:09,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:29:09,737 INFO L87 Difference]: Start difference. First operand 298 states and 360 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:10,150 INFO L93 Difference]: Finished difference Result 305 states and 366 transitions. [2023-12-16 16:29:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:29:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-16 16:29:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:10,152 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:10,152 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:10,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:29:10,153 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 10 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:10,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 771 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 16:29:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2746478873239437) internal successors, (362), 299 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 362 transitions. [2023-12-16 16:29:10,160 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 362 transitions. Word has length 10 [2023-12-16 16:29:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:10,160 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 362 transitions. [2023-12-16 16:29:10,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 362 transitions. [2023-12-16 16:29:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 16:29:10,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:10,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:10,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:10,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:10,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:10,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1753373512, now seen corresponding path program 1 times [2023-12-16 16:29:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:10,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661246591] [2023-12-16 16:29:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:10,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:10,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:10,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:10,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:29:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:10,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:29:10,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:10,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:10,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:10,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661246591] [2023-12-16 16:29:10,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661246591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:10,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:10,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:29:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734890760] [2023-12-16 16:29:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:10,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:29:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:10,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:29:10,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:29:10,539 INFO L87 Difference]: Start difference. First operand 300 states and 362 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:11,095 INFO L93 Difference]: Finished difference Result 303 states and 364 transitions. [2023-12-16 16:29:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:29:11,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-12-16 16:29:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:11,096 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:11,096 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:11,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:29:11,097 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 4 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:11,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 809 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 16:29:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2730496453900708) internal successors, (359), 297 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 359 transitions. [2023-12-16 16:29:11,102 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 359 transitions. Word has length 11 [2023-12-16 16:29:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:11,102 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 359 transitions. [2023-12-16 16:29:11,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 359 transitions. [2023-12-16 16:29:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 16:29:11,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:11,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:11,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:11,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:11,304 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:11,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:11,304 INFO L85 PathProgramCache]: Analyzing trace with hash 23358897, now seen corresponding path program 1 times [2023-12-16 16:29:11,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:11,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107554008] [2023-12-16 16:29:11,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:11,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:11,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:11,305 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:11,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:29:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:11,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:29:11,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:11,498 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:11,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:11,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107554008] [2023-12-16 16:29:11,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107554008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:11,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:11,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:29:11,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342743038] [2023-12-16 16:29:11,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:11,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:29:11,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:11,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:29:11,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:29:11,506 INFO L87 Difference]: Start difference. First operand 298 states and 359 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:12,049 INFO L93 Difference]: Finished difference Result 305 states and 365 transitions. [2023-12-16 16:29:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:29:12,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-12-16 16:29:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:12,051 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:12,051 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:12,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:29:12,052 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 10 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:12,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 799 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 16:29:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2711267605633803) internal successors, (361), 299 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 361 transitions. [2023-12-16 16:29:12,056 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 361 transitions. Word has length 14 [2023-12-16 16:29:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:12,056 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 361 transitions. [2023-12-16 16:29:12,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 361 transitions. [2023-12-16 16:29:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:29:12,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:12,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:12,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:12,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:12,259 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:12,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:12,260 INFO L85 PathProgramCache]: Analyzing trace with hash 724129858, now seen corresponding path program 1 times [2023-12-16 16:29:12,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:12,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604197504] [2023-12-16 16:29:12,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:12,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:12,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:12,261 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:12,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:29:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:12,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:29:12,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:12,453 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:12,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604197504] [2023-12-16 16:29:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604197504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 16:29:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551278053] [2023-12-16 16:29:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:12,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:29:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:12,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:29:12,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:29:12,454 INFO L87 Difference]: Start difference. First operand 300 states and 361 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:13,088 INFO L93 Difference]: Finished difference Result 303 states and 363 transitions. [2023-12-16 16:29:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:29:13,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-12-16 16:29:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:13,089 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:13,089 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:13,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:29:13,090 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 4 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:13,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 837 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 16:29:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2695035460992907) internal successors, (358), 297 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 358 transitions. [2023-12-16 16:29:13,097 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 358 transitions. Word has length 15 [2023-12-16 16:29:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:13,097 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 358 transitions. [2023-12-16 16:29:13,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 358 transitions. [2023-12-16 16:29:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 16:29:13,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:13,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:13,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:13,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:13,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:13,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash 56053351, now seen corresponding path program 1 times [2023-12-16 16:29:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:13,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263410239] [2023-12-16 16:29:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:13,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:13,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:13,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:13,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 16:29:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:13,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:29:13,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:13,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:13,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:13,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263410239] [2023-12-16 16:29:13,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263410239] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:13,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:13,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 16:29:13,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352500405] [2023-12-16 16:29:13,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:13,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:29:13,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:13,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:29:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:29:13,494 INFO L87 Difference]: Start difference. First operand 298 states and 358 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:14,131 INFO L93 Difference]: Finished difference Result 305 states and 364 transitions. [2023-12-16 16:29:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:29:14,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-12-16 16:29:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:14,133 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:14,133 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:14,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:29:14,134 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 10 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:14,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 827 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 16:29:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.267605633802817) internal successors, (360), 299 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 360 transitions. [2023-12-16 16:29:14,138 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 360 transitions. Word has length 18 [2023-12-16 16:29:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:14,138 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 360 transitions. [2023-12-16 16:29:14,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 360 transitions. [2023-12-16 16:29:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 16:29:14,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:14,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:14,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:14,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:14,345 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:14,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1737657932, now seen corresponding path program 1 times [2023-12-16 16:29:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:14,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204045084] [2023-12-16 16:29:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:14,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:14,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:14,347 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:14,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:29:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:14,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:29:14,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:14,534 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:14,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:14,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204045084] [2023-12-16 16:29:14,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204045084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:14,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:14,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 16:29:14,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19005749] [2023-12-16 16:29:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:14,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:29:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:29:14,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:29:14,535 INFO L87 Difference]: Start difference. First operand 300 states and 360 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:15,168 INFO L93 Difference]: Finished difference Result 303 states and 362 transitions. [2023-12-16 16:29:15,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:29:15,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2023-12-16 16:29:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:15,169 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:15,169 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:15,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:29:15,170 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 5 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:15,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 827 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 16:29:15,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2659574468085106) internal successors, (357), 297 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 357 transitions. [2023-12-16 16:29:15,174 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 357 transitions. Word has length 19 [2023-12-16 16:29:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:15,174 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 357 transitions. [2023-12-16 16:29:15,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 357 transitions. [2023-12-16 16:29:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 16:29:15,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:15,174 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] [2023-12-16 16:29:15,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:15,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:15,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:15,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:15,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2101371747, now seen corresponding path program 1 times [2023-12-16 16:29:15,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:15,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773287706] [2023-12-16 16:29:15,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:15,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:15,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:15,379 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:15,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:29:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:15,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:29:15,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:15,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:15,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:15,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773287706] [2023-12-16 16:29:15,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773287706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:15,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:15,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 16:29:15,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032476523] [2023-12-16 16:29:15,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:15,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:29:15,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:15,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:29:15,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:29:15,574 INFO L87 Difference]: Start difference. First operand 298 states and 357 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:16,397 INFO L93 Difference]: Finished difference Result 305 states and 363 transitions. [2023-12-16 16:29:16,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:29:16,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-12-16 16:29:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:16,398 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:16,399 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:16,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:29:16,399 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 10 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:16,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 855 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 16:29:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:16,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2640845070422535) internal successors, (359), 299 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 359 transitions. [2023-12-16 16:29:16,403 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 359 transitions. Word has length 22 [2023-12-16 16:29:16,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:16,403 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 359 transitions. [2023-12-16 16:29:16,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 359 transitions. [2023-12-16 16:29:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:29:16,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:16,404 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] [2023-12-16 16:29:16,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:16,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:16,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:16,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash -718010666, now seen corresponding path program 1 times [2023-12-16 16:29:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:16,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626149431] [2023-12-16 16:29:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:16,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:16,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:16,608 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:16,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 16:29:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:16,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:29:16,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:16,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:16,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:16,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626149431] [2023-12-16 16:29:16,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626149431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:16,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 16:29:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316822993] [2023-12-16 16:29:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:16,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 16:29:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:16,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 16:29:16,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:29:16,816 INFO L87 Difference]: Start difference. First operand 300 states and 359 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:17,525 INFO L93 Difference]: Finished difference Result 303 states and 361 transitions. [2023-12-16 16:29:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:29:17,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-12-16 16:29:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:17,526 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:17,526 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:17,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:29:17,527 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 5 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:17,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 855 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 16:29:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2624113475177305) internal successors, (356), 297 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-16 16:29:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 356 transitions. [2023-12-16 16:29:17,531 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 356 transitions. Word has length 23 [2023-12-16 16:29:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:17,531 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 356 transitions. [2023-12-16 16:29:17,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 356 transitions. [2023-12-16 16:29:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:29:17,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:17,531 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] [2023-12-16 16:29:17,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-16 16:29:17,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:17,734 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:17,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1003841453, now seen corresponding path program 1 times [2023-12-16 16:29:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576062909] [2023-12-16 16:29:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:17,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:17,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:17,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:17,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 16:29:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:17,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:29:17,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:17,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:17,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:17,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576062909] [2023-12-16 16:29:17,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576062909] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:17,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:17,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 16:29:17,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097109081] [2023-12-16 16:29:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:17,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 16:29:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:17,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 16:29:17,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:29:17,945 INFO L87 Difference]: Start difference. First operand 298 states and 356 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:18,774 INFO L93 Difference]: Finished difference Result 305 states and 362 transitions. [2023-12-16 16:29:18,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:29:18,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-12-16 16:29:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:18,776 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:18,776 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:18,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:29:18,777 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 10 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:18,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 883 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 16:29:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2605633802816902) internal successors, (358), 299 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 358 transitions. [2023-12-16 16:29:18,780 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 358 transitions. Word has length 26 [2023-12-16 16:29:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:18,780 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 358 transitions. [2023-12-16 16:29:18,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 358 transitions. [2023-12-16 16:29:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 16:29:18,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:18,781 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] [2023-12-16 16:29:18,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:18,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:18,984 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:18,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:18,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1054309920, now seen corresponding path program 1 times [2023-12-16 16:29:18,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:18,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995995142] [2023-12-16 16:29:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:18,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:18,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:18,985 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:18,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 16:29:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:19,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:29:19,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:19,194 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:19,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:19,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995995142] [2023-12-16 16:29:19,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995995142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:19,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:19,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 16:29:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372852756] [2023-12-16 16:29:19,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:19,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:29:19,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:29:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:29:19,195 INFO L87 Difference]: Start difference. First operand 300 states and 358 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:20,015 INFO L93 Difference]: Finished difference Result 303 states and 360 transitions. [2023-12-16 16:29:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 16:29:20,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-12-16 16:29:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:20,017 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:20,017 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:20,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:29:20,017 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 5 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:20,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 883 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 16:29:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2588652482269505) internal successors, (355), 297 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 355 transitions. [2023-12-16 16:29:20,021 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 355 transitions. Word has length 27 [2023-12-16 16:29:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:20,021 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 355 transitions. [2023-12-16 16:29:20,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 355 transitions. [2023-12-16 16:29:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 16:29:20,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:20,022 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] [2023-12-16 16:29:20,038 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 (13)] Ended with exit code 0 [2023-12-16 16:29:20,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:20,225 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:20,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:20,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2088402551, now seen corresponding path program 1 times [2023-12-16 16:29:20,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:20,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369467420] [2023-12-16 16:29:20,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:20,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:20,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:20,226 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:20,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-16 16:29:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:20,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:29:20,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:20,433 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:20,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:20,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369467420] [2023-12-16 16:29:20,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369467420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:20,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:20,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 16:29:20,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877325968] [2023-12-16 16:29:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:20,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:29:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:20,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:29:20,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:29:20,435 INFO L87 Difference]: Start difference. First operand 298 states and 355 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:21,386 INFO L93 Difference]: Finished difference Result 305 states and 361 transitions. [2023-12-16 16:29:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 16:29:21,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2023-12-16 16:29:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:21,387 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:21,387 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:21,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:29:21,387 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 10 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:21,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 911 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 16:29:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2570422535211268) internal successors, (357), 299 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 357 transitions. [2023-12-16 16:29:21,391 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 357 transitions. Word has length 30 [2023-12-16 16:29:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:21,391 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 357 transitions. [2023-12-16 16:29:21,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 357 transitions. [2023-12-16 16:29:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 16:29:21,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:21,392 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] [2023-12-16 16:29:21,402 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 (14)] Ended with exit code 0 [2023-12-16 16:29:21,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:21,603 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:21,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash -315965590, now seen corresponding path program 1 times [2023-12-16 16:29:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923755220] [2023-12-16 16:29:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:21,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:21,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:21,605 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:21,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-16 16:29:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:21,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:29:21,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:21,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:21,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923755220] [2023-12-16 16:29:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923755220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:21,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:21,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 16:29:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602305719] [2023-12-16 16:29:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:21,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 16:29:21,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:21,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 16:29:21,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:29:21,840 INFO L87 Difference]: Start difference. First operand 300 states and 357 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:22,820 INFO L93 Difference]: Finished difference Result 303 states and 359 transitions. [2023-12-16 16:29:22,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 16:29:22,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2023-12-16 16:29:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:22,822 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:22,822 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:22,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:29:22,822 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 5 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:22,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 911 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 16:29:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:22,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2553191489361701) internal successors, (354), 297 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 354 transitions. [2023-12-16 16:29:22,825 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 354 transitions. Word has length 31 [2023-12-16 16:29:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:22,826 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 354 transitions. [2023-12-16 16:29:22,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 354 transitions. [2023-12-16 16:29:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 16:29:22,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:22,826 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] [2023-12-16 16:29:22,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:23,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:23,033 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:23,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:23,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1142790207, now seen corresponding path program 1 times [2023-12-16 16:29:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:23,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155059174] [2023-12-16 16:29:23,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:23,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:23,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:23,035 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:23,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-16 16:29:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:23,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:29:23,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:23,242 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:23,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155059174] [2023-12-16 16:29:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155059174] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:23,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:23,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 16:29:23,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820735540] [2023-12-16 16:29:23,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:23,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 16:29:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:23,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 16:29:23,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:29:23,244 INFO L87 Difference]: Start difference. First operand 298 states and 354 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:24,292 INFO L93 Difference]: Finished difference Result 305 states and 360 transitions. [2023-12-16 16:29:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 16:29:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2023-12-16 16:29:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:24,294 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:24,294 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:24,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:29:24,296 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 10 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:24,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 939 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 16:29:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2535211267605635) internal successors, (356), 299 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-16 16:29:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 356 transitions. [2023-12-16 16:29:24,300 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 356 transitions. Word has length 34 [2023-12-16 16:29:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:24,301 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 356 transitions. [2023-12-16 16:29:24,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 356 transitions. [2023-12-16 16:29:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 16:29:24,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:24,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:24,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:24,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:24,506 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:24,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:24,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1066762100, now seen corresponding path program 1 times [2023-12-16 16:29:24,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:24,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141608684] [2023-12-16 16:29:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:24,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:24,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:24,508 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:24,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-16 16:29:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:24,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 16:29:24,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:24,742 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:24,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141608684] [2023-12-16 16:29:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141608684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:24,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 16:29:24,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163683836] [2023-12-16 16:29:24,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:24,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:29:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:24,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:29:24,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:29:24,744 INFO L87 Difference]: Start difference. First operand 300 states and 356 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:25,761 INFO L93 Difference]: Finished difference Result 303 states and 358 transitions. [2023-12-16 16:29:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:29:25,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2023-12-16 16:29:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:25,762 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:25,762 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:25,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:29:25,763 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 5 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:25,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 939 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 16:29:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:25,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.25177304964539) internal successors, (353), 297 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 353 transitions. [2023-12-16 16:29:25,766 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 353 transitions. Word has length 35 [2023-12-16 16:29:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:25,766 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 353 transitions. [2023-12-16 16:29:25,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 353 transitions. [2023-12-16 16:29:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 16:29:25,767 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:25,767 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] [2023-12-16 16:29:25,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:25,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:25,970 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:25,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1600119691, now seen corresponding path program 1 times [2023-12-16 16:29:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:25,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655744000] [2023-12-16 16:29:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:25,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:25,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:25,971 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:25,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-16 16:29:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:26,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 16:29:26,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:26,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:26,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655744000] [2023-12-16 16:29:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655744000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 16:29:26,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343255716] [2023-12-16 16:29:26,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:26,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:29:26,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:26,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:29:26,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:29:26,196 INFO L87 Difference]: Start difference. First operand 298 states and 353 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:27,298 INFO L93 Difference]: Finished difference Result 305 states and 359 transitions. [2023-12-16 16:29:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:29:27,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-16 16:29:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:27,300 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:27,300 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:27,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:29:27,300 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 10 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 2879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:27,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 967 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2879 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 16:29:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.25) internal successors, (355), 299 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 355 transitions. [2023-12-16 16:29:27,335 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 355 transitions. Word has length 38 [2023-12-16 16:29:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:27,335 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 355 transitions. [2023-12-16 16:29:27,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 355 transitions. [2023-12-16 16:29:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 16:29:27,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:27,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] [2023-12-16 16:29:27,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:27,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:27,541 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:27,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1935901182, now seen corresponding path program 1 times [2023-12-16 16:29:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115209918] [2023-12-16 16:29:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:27,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:27,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:27,543 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:27,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-16 16:29:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:27,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 16:29:27,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:27,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:27,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:27,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115209918] [2023-12-16 16:29:27,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115209918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:27,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:27,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-16 16:29:27,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751693957] [2023-12-16 16:29:27,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:27,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 16:29:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:27,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 16:29:27,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:29:27,794 INFO L87 Difference]: Start difference. First operand 300 states and 355 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:29,009 INFO L93 Difference]: Finished difference Result 303 states and 357 transitions. [2023-12-16 16:29:29,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 16:29:29,009 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2023-12-16 16:29:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:29,010 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:29,010 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:29,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:29:29,010 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 4 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 3193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:29,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1005 Invalid, 3193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3193 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 16:29:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.24822695035461) internal successors, (352), 297 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 352 transitions. [2023-12-16 16:29:29,014 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 352 transitions. Word has length 39 [2023-12-16 16:29:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:29,014 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 352 transitions. [2023-12-16 16:29:29,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 352 transitions. [2023-12-16 16:29:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 16:29:29,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:29,014 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] [2023-12-16 16:29:29,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:29,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:29,217 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:29,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1692774869, now seen corresponding path program 1 times [2023-12-16 16:29:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995400532] [2023-12-16 16:29:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:29,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:29,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:29,219 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:29,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-16 16:29:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:29,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 16:29:29,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:29,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:29,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:29,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995400532] [2023-12-16 16:29:29,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995400532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:29,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:29,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-16 16:29:29,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86008178] [2023-12-16 16:29:29,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:29,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 16:29:29,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:29,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 16:29:29,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:29:29,482 INFO L87 Difference]: Start difference. First operand 298 states and 352 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:30,696 INFO L93 Difference]: Finished difference Result 305 states and 358 transitions. [2023-12-16 16:29:30,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 16:29:30,697 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2023-12-16 16:29:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:30,698 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:30,698 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:30,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:29:30,698 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 10 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 3188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:30,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 995 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3188 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 16:29:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2464788732394365) internal successors, (354), 299 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 354 transitions. [2023-12-16 16:29:30,701 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 354 transitions. Word has length 42 [2023-12-16 16:29:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:30,702 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 354 transitions. [2023-12-16 16:29:30,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 354 transitions. [2023-12-16 16:29:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 16:29:30,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:30,702 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] [2023-12-16 16:29:30,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-16 16:29:30,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:30,905 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:30,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash -936409336, now seen corresponding path program 1 times [2023-12-16 16:29:30,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:30,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102245748] [2023-12-16 16:29:30,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:30,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:30,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:30,907 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:29:30,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-16 16:29:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:31,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 16:29:31,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:31,174 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:31,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102245748] [2023-12-16 16:29:31,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102245748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:31,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:31,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-16 16:29:31,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281782893] [2023-12-16 16:29:31,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:31,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:29:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:31,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:29:31,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:29:31,176 INFO L87 Difference]: Start difference. First operand 300 states and 354 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:32,440 INFO L93 Difference]: Finished difference Result 303 states and 356 transitions. [2023-12-16 16:29:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 16:29:32,440 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2023-12-16 16:29:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:32,441 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:32,441 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:32,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-12-16 16:29:32,442 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 5 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 3192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:32,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 995 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3192 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 16:29:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2446808510638299) internal successors, (351), 297 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 351 transitions. [2023-12-16 16:29:32,445 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 351 transitions. Word has length 43 [2023-12-16 16:29:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:32,445 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 351 transitions. [2023-12-16 16:29:32,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 351 transitions. [2023-12-16 16:29:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 16:29:32,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:32,445 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] [2023-12-16 16:29:32,455 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-16 16:29:32,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:32,652 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:32,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash -319197855, now seen corresponding path program 1 times [2023-12-16 16:29:32,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:32,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334540102] [2023-12-16 16:29:32,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:32,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:32,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:32,654 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-16 16:29:32,655 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-16 16:29:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:32,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 16:29:32,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:32,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:32,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:32,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334540102] [2023-12-16 16:29:32,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334540102] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:32,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:32,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-16 16:29:32,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973621108] [2023-12-16 16:29:32,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:32,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:29:32,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:32,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:29:32,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:29:32,919 INFO L87 Difference]: Start difference. First operand 298 states and 351 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:34,210 INFO L93 Difference]: Finished difference Result 305 states and 357 transitions. [2023-12-16 16:29:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 16:29:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2023-12-16 16:29:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:34,212 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:34,212 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:34,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-12-16 16:29:34,212 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 10 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 3495 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 3495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:34,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1023 Invalid, 3495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3495 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 16:29:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2429577464788732) internal successors, (353), 299 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 353 transitions. [2023-12-16 16:29:34,232 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 353 transitions. Word has length 46 [2023-12-16 16:29:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:34,233 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 353 transitions. [2023-12-16 16:29:34,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 353 transitions. [2023-12-16 16:29:34,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 16:29:34,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:34,233 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] [2023-12-16 16:29:34,236 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-16 16:29:34,433 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-16 16:29:34,434 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:34,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:34,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1305194862, now seen corresponding path program 1 times [2023-12-16 16:29:34,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:34,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186556802] [2023-12-16 16:29:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:34,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:34,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:34,435 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-16 16:29:34,457 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-16 16:29:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:34,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 16:29:34,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:34,720 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:34,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:34,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186556802] [2023-12-16 16:29:34,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186556802] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:34,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:34,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-16 16:29:34,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753743067] [2023-12-16 16:29:34,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:34,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 16:29:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:34,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 16:29:34,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2023-12-16 16:29:34,722 INFO L87 Difference]: Start difference. First operand 300 states and 353 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:36,020 INFO L93 Difference]: Finished difference Result 303 states and 355 transitions. [2023-12-16 16:29:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 16:29:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2023-12-16 16:29:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:36,022 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:36,022 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:36,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:29:36,023 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 5 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 3499 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 3499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:36,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1023 Invalid, 3499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3499 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 16:29:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2411347517730495) internal successors, (350), 297 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 350 transitions. [2023-12-16 16:29:36,026 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 350 transitions. Word has length 47 [2023-12-16 16:29:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:36,026 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 350 transitions. [2023-12-16 16:29:36,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 350 transitions. [2023-12-16 16:29:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-16 16:29:36,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:36,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:36,031 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-16 16:29:36,229 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-16 16:29:36,229 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:36,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:36,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1460320791, now seen corresponding path program 1 times [2023-12-16 16:29:36,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:36,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006733551] [2023-12-16 16:29:36,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:36,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:36,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:36,231 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-16 16:29:36,232 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-16 16:29:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:36,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 16:29:36,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:36,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:36,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:36,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006733551] [2023-12-16 16:29:36,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006733551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:36,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:36,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-16 16:29:36,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280795081] [2023-12-16 16:29:36,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:36,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 16:29:36,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:36,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 16:29:36,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2023-12-16 16:29:36,502 INFO L87 Difference]: Start difference. First operand 298 states and 350 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:37,914 INFO L93 Difference]: Finished difference Result 305 states and 356 transitions. [2023-12-16 16:29:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 16:29:37,915 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2023-12-16 16:29:37,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:37,916 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:37,916 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:37,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:29:37,916 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 10 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 3800 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 3800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:37,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1051 Invalid, 3800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3800 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 16:29:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2394366197183098) internal successors, (352), 299 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 352 transitions. [2023-12-16 16:29:37,919 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 352 transitions. Word has length 50 [2023-12-16 16:29:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:37,919 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 352 transitions. [2023-12-16 16:29:37,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 352 transitions. [2023-12-16 16:29:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-16 16:29:37,920 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:37,920 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] [2023-12-16 16:29:37,925 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-16 16:29:38,123 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-16 16:29:38,123 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:38,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:38,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1974691684, now seen corresponding path program 1 times [2023-12-16 16:29:38,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:38,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624596441] [2023-12-16 16:29:38,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:38,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:38,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:38,125 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-16 16:29:38,133 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-16 16:29:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:38,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 16:29:38,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:38,400 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:38,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:38,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624596441] [2023-12-16 16:29:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624596441] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:38,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-16 16:29:38,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778336169] [2023-12-16 16:29:38,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:38,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 16:29:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:38,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 16:29:38,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:29:38,401 INFO L87 Difference]: Start difference. First operand 300 states and 352 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:39,797 INFO L93 Difference]: Finished difference Result 303 states and 354 transitions. [2023-12-16 16:29:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:29:39,797 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2023-12-16 16:29:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:39,798 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:39,798 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:39,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:29:39,799 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 5 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:39,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1051 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 16:29:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2375886524822695) internal successors, (349), 297 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 349 transitions. [2023-12-16 16:29:39,803 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 349 transitions. Word has length 51 [2023-12-16 16:29:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:39,803 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 349 transitions. [2023-12-16 16:29:39,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 349 transitions. [2023-12-16 16:29:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 16:29:39,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:39,804 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] [2023-12-16 16:29:39,807 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 (25)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:40,007 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-16 16:29:40,008 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:40,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash -243567539, now seen corresponding path program 1 times [2023-12-16 16:29:40,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:40,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949160157] [2023-12-16 16:29:40,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:40,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:40,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:40,009 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-16 16:29:40,010 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-16 16:29:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:40,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 16:29:40,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:40,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:40,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:40,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949160157] [2023-12-16 16:29:40,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949160157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:40,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:40,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-16 16:29:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164958029] [2023-12-16 16:29:40,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:40,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 16:29:40,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:40,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 16:29:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:29:40,285 INFO L87 Difference]: Start difference. First operand 298 states and 349 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:41,794 INFO L93 Difference]: Finished difference Result 305 states and 355 transitions. [2023-12-16 16:29:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:29:41,794 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2023-12-16 16:29:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:41,795 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:41,795 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:41,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:29:41,796 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 10 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 4103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 4103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:41,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1079 Invalid, 4103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4103 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 16:29:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2359154929577465) internal successors, (351), 299 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 351 transitions. [2023-12-16 16:29:41,804 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 351 transitions. Word has length 54 [2023-12-16 16:29:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:41,804 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 351 transitions. [2023-12-16 16:29:41,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 351 transitions. [2023-12-16 16:29:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 16:29:41,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:41,805 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] [2023-12-16 16:29:41,814 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-16 16:29:42,008 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-16 16:29:42,009 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:42,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1039344934, now seen corresponding path program 1 times [2023-12-16 16:29:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:42,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745525970] [2023-12-16 16:29:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:42,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:42,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:42,010 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-16 16:29:42,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 (27)] Waiting until timeout for monitored process [2023-12-16 16:29:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:42,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 16:29:42,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:42,336 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:42,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:42,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745525970] [2023-12-16 16:29:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745525970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-16 16:29:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288116561] [2023-12-16 16:29:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:42,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 16:29:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:42,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 16:29:42,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:29:42,338 INFO L87 Difference]: Start difference. First operand 300 states and 351 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:43,940 INFO L93 Difference]: Finished difference Result 303 states and 353 transitions. [2023-12-16 16:29:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 16:29:43,941 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2023-12-16 16:29:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:43,942 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:43,942 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:43,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:29:43,942 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 4 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 4413 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 4413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:43,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1117 Invalid, 4413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4413 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 16:29:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2340425531914894) internal successors, (348), 297 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 348 transitions. [2023-12-16 16:29:43,945 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 348 transitions. Word has length 55 [2023-12-16 16:29:43,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:43,945 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 348 transitions. [2023-12-16 16:29:43,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 348 transitions. [2023-12-16 16:29:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 16:29:43,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:43,946 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-16 16:29:43,951 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-16 16:29:44,149 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-16 16:29:44,149 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:44,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2077809667, now seen corresponding path program 1 times [2023-12-16 16:29:44,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:44,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474203628] [2023-12-16 16:29:44,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:44,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:44,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:44,151 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-16 16:29:44,152 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-16 16:29:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:44,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 16:29:44,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:44,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:44,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:44,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474203628] [2023-12-16 16:29:44,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474203628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:44,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:44,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-16 16:29:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733877303] [2023-12-16 16:29:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:44,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 16:29:44,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:44,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 16:29:44,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:29:44,459 INFO L87 Difference]: Start difference. First operand 298 states and 348 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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-16 16:29:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:46,065 INFO L93 Difference]: Finished difference Result 305 states and 354 transitions. [2023-12-16 16:29:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 16:29:46,066 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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-16 16:29:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:46,067 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:46,067 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:46,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:29:46,067 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 10 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 4404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 4404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:46,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1107 Invalid, 4404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4404 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 16:29:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.232394366197183) internal successors, (350), 299 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 350 transitions. [2023-12-16 16:29:46,070 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 350 transitions. Word has length 58 [2023-12-16 16:29:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:46,070 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 350 transitions. [2023-12-16 16:29:46,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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-16 16:29:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 350 transitions. [2023-12-16 16:29:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 16:29:46,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:46,071 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-16 16:29:46,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 (28)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:46,274 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-16 16:29:46,274 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:46,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash -12405712, now seen corresponding path program 1 times [2023-12-16 16:29:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264811182] [2023-12-16 16:29:46,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:46,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:46,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:46,276 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-16 16:29:46,277 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-16 16:29:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:46,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 16:29:46,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:46,618 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:46,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:46,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264811182] [2023-12-16 16:29:46,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264811182] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:46,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:46,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-16 16:29:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865522848] [2023-12-16 16:29:46,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:46,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 16:29:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:46,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 16:29:46,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:29:46,620 INFO L87 Difference]: Start difference. First operand 300 states and 350 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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-16 16:29:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:48,363 INFO L93 Difference]: Finished difference Result 303 states and 352 transitions. [2023-12-16 16:29:48,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 16:29:48,363 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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-16 16:29:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:48,364 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:48,364 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:48,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2023-12-16 16:29:48,364 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 4 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 4713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 4713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:48,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1145 Invalid, 4713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4713 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 16:29:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2304964539007093) internal successors, (347), 297 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 347 transitions. [2023-12-16 16:29:48,367 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 347 transitions. Word has length 59 [2023-12-16 16:29:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:48,367 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 347 transitions. [2023-12-16 16:29:48,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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-16 16:29:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 347 transitions. [2023-12-16 16:29:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 16:29:48,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:48,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] [2023-12-16 16:29:48,374 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 (29)] Forceful destruction successful, exit code 0 [2023-12-16 16:29:48,571 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-16 16:29:48,572 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:48,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1391447751, now seen corresponding path program 1 times [2023-12-16 16:29:48,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:48,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050311113] [2023-12-16 16:29:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:48,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-16 16:29:48,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:48,573 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-16 16:29:48,574 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-16 16:29:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:48,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 16:29:48,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:48,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:48,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:48,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050311113] [2023-12-16 16:29:48,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050311113] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:48,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:48,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-16 16:29:48,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403075562] [2023-12-16 16:29:48,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:48,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 16:29:48,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:48,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 16:29:48,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:29:48,898 INFO L87 Difference]: Start difference. First operand 298 states and 347 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 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-16 16:29:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:50,587 INFO L93 Difference]: Finished difference Result 305 states and 353 transitions. [2023-12-16 16:29:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 16:29:50,587 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 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-16 16:29:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:50,588 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:50,588 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:50,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2023-12-16 16:29:50,589 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 10 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 4703 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 4703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:50,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1135 Invalid, 4703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4703 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 16:29:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2288732394366197) internal successors, (349), 299 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 349 transitions. [2023-12-16 16:29:50,591 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 349 transitions. Word has length 62 [2023-12-16 16:29:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:50,592 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 349 transitions. [2023-12-16 16:29:50,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 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-16 16:29:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 349 transitions. [2023-12-16 16:29:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 16:29:50,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:50,592 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] [2023-12-16 16:29:50,601 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-16 16:29:50,795 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-16 16:29:50,795 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:50,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash -185203270, now seen corresponding path program 1 times [2023-12-16 16:29:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638888642] [2023-12-16 16:29:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:50,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:50,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:50,797 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-16 16:29:50,798 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-16 16:29:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:50,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 16:29:50,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:51,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:51,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:51,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638888642] [2023-12-16 16:29:51,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638888642] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:51,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:51,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-16 16:29:51,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121811295] [2023-12-16 16:29:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:51,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-16 16:29:51,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:51,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-16 16:29:51,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2023-12-16 16:29:51,182 INFO L87 Difference]: Start difference. First operand 300 states and 349 transitions. Second operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:52,902 INFO L93 Difference]: Finished difference Result 303 states and 351 transitions. [2023-12-16 16:29:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 16:29:52,903 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2023-12-16 16:29:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:52,903 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:52,904 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:52,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:29:52,904 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 5 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 4707 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 4707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:52,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1135 Invalid, 4707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4707 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 16:29:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2269503546099292) internal successors, (346), 297 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 346 transitions. [2023-12-16 16:29:52,907 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 346 transitions. Word has length 63 [2023-12-16 16:29:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:52,907 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 346 transitions. [2023-12-16 16:29:52,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 346 transitions. [2023-12-16 16:29:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 16:29:52,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:52,908 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-16 16:29:52,935 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-16 16:29:53,109 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-16 16:29:53,110 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:53,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2089896977, now seen corresponding path program 1 times [2023-12-16 16:29:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:53,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772507088] [2023-12-16 16:29:53,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:53,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:53,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:53,112 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-16 16:29:53,112 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-16 16:29:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:53,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 16:29:53,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:53,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:53,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:53,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772507088] [2023-12-16 16:29:53,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772507088] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:53,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:53,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-16 16:29:53,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383706786] [2023-12-16 16:29:53,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:53,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-16 16:29:53,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:53,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-16 16:29:53,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2023-12-16 16:29:53,461 INFO L87 Difference]: Start difference. First operand 298 states and 346 transitions. Second operand has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 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-16 16:29:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:55,290 INFO L93 Difference]: Finished difference Result 305 states and 352 transitions. [2023-12-16 16:29:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 16:29:55,291 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 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-16 16:29:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:55,292 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:29:55,292 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:29:55,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:29:55,292 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 10 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 5000 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 5000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:55,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1163 Invalid, 5000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5000 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 16:29:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:29:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:29:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2253521126760563) internal successors, (348), 299 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 348 transitions. [2023-12-16 16:29:55,295 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 348 transitions. Word has length 66 [2023-12-16 16:29:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:55,295 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 348 transitions. [2023-12-16 16:29:55,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 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-16 16:29:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 348 transitions. [2023-12-16 16:29:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 16:29:55,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:55,296 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-16 16:29:55,299 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 (32)] Ended with exit code 0 [2023-12-16 16:29:55,499 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-16 16:29:55,499 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:55,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash -362292796, now seen corresponding path program 1 times [2023-12-16 16:29:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:55,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245828923] [2023-12-16 16:29:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:55,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:55,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:55,501 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-16 16:29:55,502 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-16 16:29:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:55,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 16:29:55,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:55,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:55,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245828923] [2023-12-16 16:29:55,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245828923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:55,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:55,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-16 16:29:55,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072480455] [2023-12-16 16:29:55,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:55,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 16:29:55,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:55,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 16:29:55,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:29:55,866 INFO L87 Difference]: Start difference. First operand 300 states and 348 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 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-16 16:29:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:57,692 INFO L93 Difference]: Finished difference Result 303 states and 350 transitions. [2023-12-16 16:29:57,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:29:57,692 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 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-16 16:29:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:57,693 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:29:57,693 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:29:57,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2023-12-16 16:29:57,694 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 5 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 5004 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 5004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:57,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1163 Invalid, 5004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5004 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 16:29:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:29:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:29:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2234042553191489) internal successors, (345), 297 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) [2023-12-16 16:29:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 345 transitions. [2023-12-16 16:29:57,697 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 345 transitions. Word has length 67 [2023-12-16 16:29:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:57,697 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 345 transitions. [2023-12-16 16:29:57,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 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-16 16:29:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 345 transitions. [2023-12-16 16:29:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-16 16:29:57,697 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:57,697 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-16 16:29:57,706 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-16 16:29:57,901 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-16 16:29:57,901 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:29:57,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1801346011, now seen corresponding path program 1 times [2023-12-16 16:29:57,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:57,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758796940] [2023-12-16 16:29:57,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:57,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:29:57,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:57,903 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-16 16:29:57,903 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-16 16:29:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:58,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 16:29:58,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:58,256 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:58,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:58,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758796940] [2023-12-16 16:29:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758796940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:58,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-16 16:29:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386392517] [2023-12-16 16:29:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:58,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 16:29:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 16:29:58,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:29:58,257 INFO L87 Difference]: Start difference. First operand 298 states and 345 transitions. Second operand has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 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-16 16:30:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:00,138 INFO L93 Difference]: Finished difference Result 305 states and 351 transitions. [2023-12-16 16:30:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:30:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 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-16 16:30:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:00,139 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:30:00,139 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:30:00,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2023-12-16 16:30:00,140 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 10 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 5295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 5295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:30:00,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1191 Invalid, 5295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5295 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 16:30:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:30:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:30:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.221830985915493) internal successors, (347), 299 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 347 transitions. [2023-12-16 16:30:00,143 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 347 transitions. Word has length 70 [2023-12-16 16:30:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:00,143 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 347 transitions. [2023-12-16 16:30:00,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 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-16 16:30:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 347 transitions. [2023-12-16 16:30:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-16 16:30:00,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:00,144 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] [2023-12-16 16:30:00,149 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-16 16:30:00,347 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-16 16:30:00,347 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:30:00,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash -7147442, now seen corresponding path program 1 times [2023-12-16 16:30:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:00,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034956938] [2023-12-16 16:30:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:00,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:00,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:00,349 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-16 16:30:00,349 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-16 16:30:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:00,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 16:30:00,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:30:00,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:00,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:00,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034956938] [2023-12-16 16:30:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034956938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:00,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:00,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-16 16:30:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743265524] [2023-12-16 16:30:00,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:00,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-16 16:30:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:00,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-16 16:30:00,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2023-12-16 16:30:00,716 INFO L87 Difference]: Start difference. First operand 300 states and 347 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:02,634 INFO L93 Difference]: Finished difference Result 303 states and 349 transitions. [2023-12-16 16:30:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 16:30:02,634 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2023-12-16 16:30:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:02,635 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:30:02,635 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:30:02,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:30:02,636 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 5 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 5299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 5299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:30:02,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1191 Invalid, 5299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5299 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-16 16:30:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:30:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:30:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2198581560283688) internal successors, (344), 297 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 344 transitions. [2023-12-16 16:30:02,638 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 344 transitions. Word has length 71 [2023-12-16 16:30:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:02,638 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 344 transitions. [2023-12-16 16:30:02,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 344 transitions. [2023-12-16 16:30:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 16:30:02,639 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:02,639 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] [2023-12-16 16:30:02,642 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 (35)] Ended with exit code 0 [2023-12-16 16:30:02,839 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-16 16:30:02,839 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:30:02,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1572225499, now seen corresponding path program 1 times [2023-12-16 16:30:02,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:02,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93873801] [2023-12-16 16:30:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:02,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:02,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:02,841 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-16 16:30:02,842 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-16 16:30:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:03,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 16:30:03,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:30:03,221 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:03,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93873801] [2023-12-16 16:30:03,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93873801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:03,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:03,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-16 16:30:03,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172709141] [2023-12-16 16:30:03,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:03,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-16 16:30:03,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:03,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-16 16:30:03,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2023-12-16 16:30:03,222 INFO L87 Difference]: Start difference. First operand 298 states and 344 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:05,213 INFO L93 Difference]: Finished difference Result 305 states and 350 transitions. [2023-12-16 16:30:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 16:30:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2023-12-16 16:30:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:05,214 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:30:05,215 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:30:05,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:30:05,215 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 10 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 5588 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 5588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:30:05,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1219 Invalid, 5588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5588 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-16 16:30:05,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:30:05,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:30:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2183098591549295) internal successors, (346), 299 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 346 transitions. [2023-12-16 16:30:05,218 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 346 transitions. Word has length 74 [2023-12-16 16:30:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:05,218 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 346 transitions. [2023-12-16 16:30:05,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 346 transitions. [2023-12-16 16:30:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 16:30:05,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:05,219 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] [2023-12-16 16:30:05,223 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 (36)] Ended with exit code 0 [2023-12-16 16:30:05,423 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-16 16:30:05,423 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:30:05,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1494354264, now seen corresponding path program 1 times [2023-12-16 16:30:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:05,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687913383] [2023-12-16 16:30:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:05,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:05,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:05,425 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-16 16:30:05,426 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-16 16:30:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:05,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 16:30:05,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:30:05,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:05,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:05,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687913383] [2023-12-16 16:30:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687913383] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:05,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:05,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-16 16:30:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921857328] [2023-12-16 16:30:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:05,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 16:30:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:05,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 16:30:05,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:30:05,846 INFO L87 Difference]: Start difference. First operand 300 states and 346 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:07,892 INFO L93 Difference]: Finished difference Result 303 states and 348 transitions. [2023-12-16 16:30:07,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 16:30:07,893 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2023-12-16 16:30:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:07,893 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:30:07,894 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:30:07,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2023-12-16 16:30:07,894 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 5 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 5592 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 5592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:30:07,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1219 Invalid, 5592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5592 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-16 16:30:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:30:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:30:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2163120567375887) internal successors, (343), 297 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 343 transitions. [2023-12-16 16:30:07,898 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 343 transitions. Word has length 75 [2023-12-16 16:30:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:07,898 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 343 transitions. [2023-12-16 16:30:07,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 343 transitions. [2023-12-16 16:30:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-16 16:30:07,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:07,899 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] [2023-12-16 16:30:07,903 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-16 16:30:08,099 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-16 16:30:08,099 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:30:08,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1827025647, now seen corresponding path program 1 times [2023-12-16 16:30:08,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:08,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766687965] [2023-12-16 16:30:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:08,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:08,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:08,101 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-16 16:30:08,102 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-16 16:30:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:08,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 16:30:08,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:08,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-16 16:30:08,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:08,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:08,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766687965] [2023-12-16 16:30:08,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766687965] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:08,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:08,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-16 16:30:08,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797049140] [2023-12-16 16:30:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:08,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 16:30:08,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:08,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 16:30:08,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:30:08,504 INFO L87 Difference]: Start difference. First operand 298 states and 343 transitions. Second operand has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:10,568 INFO L93 Difference]: Finished difference Result 305 states and 349 transitions. [2023-12-16 16:30:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 16:30:10,569 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2023-12-16 16:30:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:10,570 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:30:10,570 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:30:10,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2023-12-16 16:30:10,570 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 10 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 5879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 5879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:30:10,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1247 Invalid, 5879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5879 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-16 16:30:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:30:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:30:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2147887323943662) internal successors, (345), 299 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) [2023-12-16 16:30:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 345 transitions. [2023-12-16 16:30:10,573 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 345 transitions. Word has length 78 [2023-12-16 16:30:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:10,573 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 345 transitions. [2023-12-16 16:30:10,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 345 transitions. [2023-12-16 16:30:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-16 16:30:10,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:10,574 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] [2023-12-16 16:30:10,596 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 (38)] Forceful destruction successful, exit code 0 [2023-12-16 16:30:10,777 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-16 16:30:10,778 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:30:10,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:10,778 INFO L85 PathProgramCache]: Analyzing trace with hash -803216158, now seen corresponding path program 1 times [2023-12-16 16:30:10,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:10,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443638404] [2023-12-16 16:30:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:10,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:10,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:10,779 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-16 16:30:10,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-16 16:30:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:10,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 16:30:10,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:30:11,187 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:11,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:11,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443638404] [2023-12-16 16:30:11,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443638404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:11,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:11,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-12-16 16:30:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557307879] [2023-12-16 16:30:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:11,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 16:30:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 16:30:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2023-12-16 16:30:11,189 INFO L87 Difference]: Start difference. First operand 300 states and 345 transitions. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:13,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:13,372 INFO L93 Difference]: Finished difference Result 303 states and 347 transitions. [2023-12-16 16:30:13,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 16:30:13,373 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-16 16:30:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:13,374 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:30:13,374 INFO L226 Difference]: Without dead ends: 298 [2023-12-16 16:30:13,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2023-12-16 16:30:13,374 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 4 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 6183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 6183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:30:13,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1285 Invalid, 6183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6183 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 16:30:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-16 16:30:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-16 16:30:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2127659574468086) internal successors, (342), 297 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 342 transitions. [2023-12-16 16:30:13,380 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 342 transitions. Word has length 79 [2023-12-16 16:30:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:13,380 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 342 transitions. [2023-12-16 16:30:13,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 342 transitions. [2023-12-16 16:30:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 16:30:13,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:13,381 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] [2023-12-16 16:30:13,384 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-16 16:30:13,581 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-16 16:30:13,581 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:30:13,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1889109447, now seen corresponding path program 1 times [2023-12-16 16:30:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:13,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625473116] [2023-12-16 16:30:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:13,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:13,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:13,583 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-16 16:30:13,584 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-16 16:30:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:13,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 16:30:13,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:30:14,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:14,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:14,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625473116] [2023-12-16 16:30:14,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625473116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:14,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:14,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-12-16 16:30:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343297976] [2023-12-16 16:30:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:14,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 16:30:14,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:14,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 16:30:14,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2023-12-16 16:30:14,002 INFO L87 Difference]: Start difference. First operand 298 states and 342 transitions. Second operand has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:16,231 INFO L93 Difference]: Finished difference Result 305 states and 348 transitions. [2023-12-16 16:30:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 16:30:16,231 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2023-12-16 16:30:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:16,232 INFO L225 Difference]: With dead ends: 305 [2023-12-16 16:30:16,232 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 16:30:16,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2023-12-16 16:30:16,233 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 10 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 6168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 6168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:30:16,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1275 Invalid, 6168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6168 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-16 16:30:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 16:30:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2023-12-16 16:30:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 284 states have (on average 1.2112676056338028) internal successors, (344), 299 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 344 transitions. [2023-12-16 16:30:16,241 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 344 transitions. Word has length 82 [2023-12-16 16:30:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:16,241 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 344 transitions. [2023-12-16 16:30:16,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 344 transitions. [2023-12-16 16:30:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-16 16:30:16,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:16,241 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] [2023-12-16 16:30:16,245 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-16 16:30:16,445 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-16 16:30:16,445 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-16 16:30:16,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1567145236, now seen corresponding path program 1 times [2023-12-16 16:30:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:16,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203711367] [2023-12-16 16:30:16,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:16,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:16,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:16,447 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-16 16:30:16,449 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-16 16:30:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:16,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 16:30:16,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:30:16,895 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:16,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:16,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203711367] [2023-12-16 16:30:16,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203711367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:16,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2023-12-16 16:30:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143744563] [2023-12-16 16:30:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:16,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 16:30:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:16,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 16:30:16,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2023-12-16 16:30:16,896 INFO L87 Difference]: Start difference. First operand 300 states and 344 transitions. Second operand has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 16:30:18,339 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:30:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 16:30:18,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2023-12-16 16:30:18,344 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 5 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 4152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 4152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:30:18,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 325 Invalid, 4152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4152 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 16:30:18,345 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2023-12-16 16:30:18,351 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-16 16:30:18,352 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 (41)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:30:18,546 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-16 16:30:18,547 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). [2023-12-16 16:30:18,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2023-12-16 16:30:18,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2023-12-16 16:30:18,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2023-12-16 16:30:18,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2023-12-16 16:30:18,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2023-12-16 16:30:18,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2023-12-16 16:30:18,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2023-12-16 16:30:18,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2023-12-16 16:30:18,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2023-12-16 16:30:18,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2023-12-16 16:30:18,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2023-12-16 16:30:18,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2023-12-16 16:30:18,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2023-12-16 16:30:18,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2023-12-16 16:30:18,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2023-12-16 16:30:18,551 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] [2023-12-16 16:30:18,553 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:30:18,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:30:18 BoogieIcfgContainer [2023-12-16 16:30:18,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:30:18,555 INFO L158 Benchmark]: Toolchain (without parser) took 73900.59ms. Allocated memory was 245.4MB in the beginning and 424.7MB in the end (delta: 179.3MB). Free memory was 196.5MB in the beginning and 373.4MB in the end (delta: -176.9MB). Peak memory consumption was 252.9MB. Max. memory is 8.0GB. [2023-12-16 16:30:18,555 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 179.3MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:30:18,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 880.76ms. Allocated memory is still 245.4MB. Free memory was 196.5MB in the beginning and 193.4MB in the end (delta: 3.2MB). Peak memory consumption was 90.2MB. Max. memory is 8.0GB. [2023-12-16 16:30:18,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.74ms. Allocated memory is still 245.4MB. Free memory was 193.4MB in the beginning and 181.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 16:30:18,555 INFO L158 Benchmark]: Boogie Preprocessor took 119.45ms. Allocated memory is still 245.4MB. Free memory was 181.3MB in the beginning and 167.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 16:30:18,555 INFO L158 Benchmark]: RCFGBuilder took 1635.99ms. Allocated memory is still 245.4MB. Free memory was 167.7MB in the beginning and 161.8MB in the end (delta: 5.9MB). Peak memory consumption was 92.4MB. Max. memory is 8.0GB. [2023-12-16 16:30:18,555 INFO L158 Benchmark]: TraceAbstraction took 71137.91ms. Allocated memory was 245.4MB in the beginning and 424.7MB in the end (delta: 179.3MB). Free memory was 161.3MB in the beginning and 373.4MB in the end (delta: -212.2MB). Peak memory consumption was 216.2MB. Max. memory is 8.0GB. [2023-12-16 16:30:18,556 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.43ms. Allocated memory is still 179.3MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 880.76ms. Allocated memory is still 245.4MB. Free memory was 196.5MB in the beginning and 193.4MB in the end (delta: 3.2MB). Peak memory consumption was 90.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 120.74ms. Allocated memory is still 245.4MB. Free memory was 193.4MB in the beginning and 181.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 119.45ms. Allocated memory is still 245.4MB. Free memory was 181.3MB in the beginning and 167.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * RCFGBuilder took 1635.99ms. Allocated memory is still 245.4MB. Free memory was 167.7MB in the beginning and 161.8MB in the end (delta: 5.9MB). Peak memory consumption was 92.4MB. Max. memory is 8.0GB. * TraceAbstraction took 71137.91ms. Allocated memory was 245.4MB in the beginning and 424.7MB in the end (delta: 179.3MB). Free memory was 161.3MB in the beginning and 373.4MB in the end (delta: -212.2MB). Peak memory consumption was 216.2MB. 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: 53]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 53). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 41). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4678]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4678). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4690]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4690). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4714]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4714). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4726]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4726). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4743]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4743). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4755]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4755). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4783]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4783). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4795]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4795). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4811]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4811). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4823]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4823). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4854]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4854). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4866]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4866). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4893]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4893). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4905]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4905). Cancelled while NwaCegarLoop was constructing difference of abstraction (300states) and FLOYD_HOARE automaton (currently 24 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 473 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 71.1s, OverallIterations: 40, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 51.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 303 SdHoareTripleChecker+Valid, 49.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 41008 SdHoareTripleChecker+Invalid, 41.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28404 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132807 IncrementalHoareTripleChecker+Invalid, 132807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 12604 mSDtfsCounter, 132807 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1780 GetRequests, 1260 SyntacticMatches, 0 SemanticMatches, 520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=0, InterpolantAutomatonStates: 536, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 60 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1780 NumberOfCodeBlocks, 1780 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1740 ConstructedInterpolants, 0 QuantifiedInterpolants, 5220 SizeOfPredicates, 100 NumberOfNonLiveVariables, 5100 ConjunctsInSsa, 560 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown