/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-pthread/cs_dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 11:34:16,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 11:34:16,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 11:34:16,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 11:34:16,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 11:34:16,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 11:34:16,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 11:34:16,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 11:34:16,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 11:34:16,532 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 11:34:16,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 11:34:16,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 11:34:16,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 11:34:16,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 11:34:16,537 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 11:34:16,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 11:34:16,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 11:34:16,538 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 11:34:16,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 11:34:16,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 11:34:16,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 11:34:16,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 11:34:16,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 11:34:16,540 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 11:34:16,540 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 11:34:16,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 11:34:16,540 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 11:34:16,541 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 11:34:16,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 11:34:16,541 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 11:34:16,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 11:34:16,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 11:34:16,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 11:34:16,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 11:34:16,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:34:16,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 11:34:16,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 11:34:16,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 11:34:16,543 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 11:34:16,544 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 11:34:16,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 11:34:16,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 11:34:16,544 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 11:34:16,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 11:34:16,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 11:34:16,545 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 11:34:16,545 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 11:34:16,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 11:34:16,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 11:34:16,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 11:34:16,807 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 11:34:16,810 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 11:34:16,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_dekker.i [2023-12-25 11:34:18,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 11:34:18,306 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 11:34:18,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_dekker.i [2023-12-25 11:34:18,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfe347ab/6f9c97065eb64067ab6aaf690f8df267/FLAGcd42e7063 [2023-12-25 11:34:18,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfe347ab/6f9c97065eb64067ab6aaf690f8df267 [2023-12-25 11:34:18,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 11:34:18,350 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 11:34:18,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 11:34:18,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 11:34:18,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 11:34:18,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:34:18" (1/1) ... [2023-12-25 11:34:18,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d02d2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:18, skipping insertion in model container [2023-12-25 11:34:18,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:34:18" (1/1) ... [2023-12-25 11:34:18,419 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 11:34:18,726 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_dekker.i[23603,23616] [2023-12-25 11:34:18,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:34:18,855 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 11:34:18,896 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_dekker.i[23603,23616] [2023-12-25 11:34:18,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:34:19,018 INFO L206 MainTranslator]: Completed translation [2023-12-25 11:34:19,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19 WrapperNode [2023-12-25 11:34:19,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 11:34:19,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 11:34:19,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 11:34:19,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 11:34:19,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,097 INFO L138 Inliner]: procedures = 149, calls = 300, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 448 [2023-12-25 11:34:19,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 11:34:19,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 11:34:19,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 11:34:19,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 11:34:19,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,165 INFO L175 MemorySlicer]: Split 150 memory accesses to 17 slices as follows [2, 5, 8, 8, 29, 21, 7, 7, 9, 7, 6, 5, 0, 5, 5, 13, 13]. 19 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [2, 0, 3, 3, 9, 9, 3, 3, 3, 3, 2, 0, 0, 0, 0, 0, 0]. The 37 writes are split as follows [0, 1, 2, 2, 11, 6, 2, 2, 2, 2, 2, 1, 0, 1, 1, 1, 1]. [2023-12-25 11:34:19,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 11:34:19,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 11:34:19,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 11:34:19,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 11:34:19,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (1/1) ... [2023-12-25 11:34:19,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:34:19,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 11:34:19,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 11:34:19,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 11:34:19,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-25 11:34:19,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-25 11:34:19,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-25 11:34:19,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-25 11:34:19,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-25 11:34:19,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 11:34:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 11:34:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 11:34:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 11:34:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 11:34:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-25 11:34:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-25 11:34:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-25 11:34:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-25 11:34:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-25 11:34:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-25 11:34:19,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-12-25 11:34:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-12-25 11:34:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2023-12-25 11:34:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2023-12-25 11:34:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2023-12-25 11:34:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2023-12-25 11:34:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 11:34:19,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 11:34:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 11:34:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 11:34:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-25 11:34:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-25 11:34:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-25 11:34:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-25 11:34:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-25 11:34:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-25 11:34:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-25 11:34:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-25 11:34:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-25 11:34:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-25 11:34:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-25 11:34:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-25 11:34:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-25 11:34:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-25 11:34:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-12-25 11:34:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-12-25 11:34:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2023-12-25 11:34:19,392 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-25 11:34:19,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-25 11:34:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-25 11:34:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-25 11:34:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-25 11:34:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-12-25 11:34:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-12-25 11:34:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2023-12-25 11:34:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-12-25 11:34:19,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-12-25 11:34:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:34:19,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:34:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-25 11:34:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-25 11:34:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-25 11:34:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-25 11:34:19,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-25 11:34:19,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-25 11:34:19,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-25 11:34:19,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-25 11:34:19,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-25 11:34:19,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-25 11:34:19,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-25 11:34:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-25 11:34:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-25 11:34:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-12-25 11:34:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-25 11:34:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-25 11:34:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-25 11:34:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-25 11:34:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-25 11:34:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-12-25 11:34:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-12-25 11:34:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2023-12-25 11:34:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2023-12-25 11:34:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2023-12-25 11:34:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2023-12-25 11:34:19,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-25 11:34:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-25 11:34:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-25 11:34:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-25 11:34:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-25 11:34:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-12-25 11:34:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-12-25 11:34:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-12-25 11:34:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-12-25 11:34:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-12-25 11:34:19,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 11:34:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2023-12-25 11:34:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2023-12-25 11:34:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2023-12-25 11:34:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-25 11:34:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-25 11:34:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-25 11:34:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-25 11:34:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-25 11:34:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-25 11:34:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-25 11:34:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-25 11:34:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-25 11:34:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-25 11:34:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-25 11:34:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-12-25 11:34:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-12-25 11:34:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2023-12-25 11:34:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2023-12-25 11:34:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2023-12-25 11:34:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2023-12-25 11:34:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-25 11:34:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-25 11:34:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 11:34:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 11:34:19,664 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 11:34:19,666 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 11:34:25,717 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 11:34:25,761 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 11:34:25,762 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 11:34:25,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:34:25 BoogieIcfgContainer [2023-12-25 11:34:25,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 11:34:25,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 11:34:25,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 11:34:25,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 11:34:25,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 11:34:18" (1/3) ... [2023-12-25 11:34:25,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355fd34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:34:25, skipping insertion in model container [2023-12-25 11:34:25,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:19" (2/3) ... [2023-12-25 11:34:25,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355fd34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:34:25, skipping insertion in model container [2023-12-25 11:34:25,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:34:25" (3/3) ... [2023-12-25 11:34:25,772 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_dekker.i [2023-12-25 11:34:25,787 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 11:34:25,788 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 11:34:25,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 11:34:25,848 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;@4ea454b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 11:34:25,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 11:34:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 72 states have internal predecessors, (97), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-25 11:34:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 11:34:25,883 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:34:25,884 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:34:25,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:34:25,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:34:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash 405785806, now seen corresponding path program 1 times [2023-12-25 11:34:25,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:34:25,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923962991] [2023-12-25 11:34:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:34:25,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:25,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:34:25,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:34:25,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 11:34:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:34:26,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 11:34:26,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:34:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2023-12-25 11:34:26,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:34:26,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:34:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923962991] [2023-12-25 11:34:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923962991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:34:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:34:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:34:26,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877059711] [2023-12-25 11:34:26,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:34:26,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 11:34:26,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:34:26,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 11:34:26,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 11:34:26,624 INFO L87 Difference]: Start difference. First operand has 113 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 72 states have internal predecessors, (97), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 11:34:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:34:26,921 INFO L93 Difference]: Finished difference Result 225 states and 366 transitions. [2023-12-25 11:34:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 11:34:26,924 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131 [2023-12-25 11:34:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:34:26,935 INFO L225 Difference]: With dead ends: 225 [2023-12-25 11:34:26,935 INFO L226 Difference]: Without dead ends: 111 [2023-12-25 11:34:26,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 11:34:26,948 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:34:26,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 11:34:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-25 11:34:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-25 11:34:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-25 11:34:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2023-12-25 11:34:26,995 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 131 [2023-12-25 11:34:26,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:34:26,995 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2023-12-25 11:34:26,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 11:34:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2023-12-25 11:34:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 11:34:26,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:34:26,999 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:34:27,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 11:34:27,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:27,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:34:27,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:34:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash 194506872, now seen corresponding path program 1 times [2023-12-25 11:34:27,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:34:27,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854842238] [2023-12-25 11:34:27,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:34:27,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:27,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:34:27,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:34:27,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 11:34:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:34:27,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:34:27,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:34:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-25 11:34:27,758 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:34:27,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:34:27,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854842238] [2023-12-25 11:34:27,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854842238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:34:27,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:34:27,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:34:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269673588] [2023-12-25 11:34:27,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:34:27,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:34:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:34:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:34:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:34:27,761 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:34:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:34:29,192 INFO L93 Difference]: Finished difference Result 221 states and 321 transitions. [2023-12-25 11:34:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:34:29,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2023-12-25 11:34:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:34:29,198 INFO L225 Difference]: With dead ends: 221 [2023-12-25 11:34:29,198 INFO L226 Difference]: Without dead ends: 114 [2023-12-25 11:34:29,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:34:29,200 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 3 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:34:29,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 309 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 11:34:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-25 11:34:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2023-12-25 11:34:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-25 11:34:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2023-12-25 11:34:29,222 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 131 [2023-12-25 11:34:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:34:29,222 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2023-12-25 11:34:29,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:34:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2023-12-25 11:34:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-25 11:34:29,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:34:29,225 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:34:29,235 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-25 11:34:29,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:29,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:34:29,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:34:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash -835741424, now seen corresponding path program 1 times [2023-12-25 11:34:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:34:29,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556350062] [2023-12-25 11:34:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:34:29,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:29,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:34:29,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:34:29,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 11:34:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:34:29,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:34:29,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:34:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-25 11:34:29,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:34:29,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:34:29,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556350062] [2023-12-25 11:34:29,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556350062] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:34:29,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:34:29,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:34:29,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465598218] [2023-12-25 11:34:29,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:34:29,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:34:29,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:34:29,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:34:29,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:34:29,983 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:34:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:34:30,455 INFO L93 Difference]: Finished difference Result 223 states and 324 transitions. [2023-12-25 11:34:30,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:34:30,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2023-12-25 11:34:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:34:30,457 INFO L225 Difference]: With dead ends: 223 [2023-12-25 11:34:30,457 INFO L226 Difference]: Without dead ends: 113 [2023-12-25 11:34:30,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:34:30,459 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:34:30,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 11:34:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-25 11:34:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-25 11:34:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-25 11:34:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2023-12-25 11:34:30,470 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 134 [2023-12-25 11:34:30,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:34:30,470 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2023-12-25 11:34:30,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:34:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2023-12-25 11:34:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 11:34:30,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:34:30,472 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:34:30,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 11:34:30,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:30,682 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:34:30,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:34:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash -918721409, now seen corresponding path program 1 times [2023-12-25 11:34:30,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:34:30,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174812319] [2023-12-25 11:34:30,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:34:30,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:34:30,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:34:30,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 11:34:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:34:31,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:34:31,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:34:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-25 11:34:31,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:34:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-25 11:34:31,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:34:31,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174812319] [2023-12-25 11:34:31,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174812319] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:34:31,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:34:31,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 11:34:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472011683] [2023-12-25 11:34:31,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:34:31,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:34:31,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:34:31,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:34:31,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:34:31,571 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-12-25 11:34:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:34:32,871 INFO L93 Difference]: Finished difference Result 226 states and 328 transitions. [2023-12-25 11:34:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:34:32,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 135 [2023-12-25 11:34:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:34:32,873 INFO L225 Difference]: With dead ends: 226 [2023-12-25 11:34:32,873 INFO L226 Difference]: Without dead ends: 115 [2023-12-25 11:34:32,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:34:32,875 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:34:32,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 11:34:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-25 11:34:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-25 11:34:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-25 11:34:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2023-12-25 11:34:32,893 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 135 [2023-12-25 11:34:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:34:32,894 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2023-12-25 11:34:32,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-12-25 11:34:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2023-12-25 11:34:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-25 11:34:32,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:34:32,896 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:34:32,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 11:34:33,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:33,104 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:34:33,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:34:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1630487905, now seen corresponding path program 2 times [2023-12-25 11:34:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:34:33,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146139786] [2023-12-25 11:34:33,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 11:34:33,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:33,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:34:33,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:34:33,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 11:34:33,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 11:34:33,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 11:34:33,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 11:34:33,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:34:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2023-12-25 11:34:35,812 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:34:35,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:34:35,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146139786] [2023-12-25 11:34:35,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146139786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:34:35,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:34:35,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:34:35,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18290308] [2023-12-25 11:34:35,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:34:35,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 11:34:35,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:34:35,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 11:34:35,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 11:34:35,814 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:34:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:34:36,378 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2023-12-25 11:34:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 11:34:36,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2023-12-25 11:34:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:34:36,383 INFO L225 Difference]: With dead ends: 219 [2023-12-25 11:34:36,383 INFO L226 Difference]: Without dead ends: 173 [2023-12-25 11:34:36,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:34:36,384 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 82 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:34:36,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 488 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 11:34:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-25 11:34:36,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2023-12-25 11:34:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2023-12-25 11:34:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 252 transitions. [2023-12-25 11:34:36,402 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 252 transitions. Word has length 137 [2023-12-25 11:34:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:34:36,402 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 252 transitions. [2023-12-25 11:34:36,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:34:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 252 transitions. [2023-12-25 11:34:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-25 11:34:36,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:34:36,410 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:34:36,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 11:34:36,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:36,617 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:34:36,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:34:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash 423740329, now seen corresponding path program 1 times [2023-12-25 11:34:36,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:34:36,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831312506] [2023-12-25 11:34:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:34:36,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:36,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:34:36,620 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:34:36,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 11:34:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:34:37,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:34:37,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:34:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2023-12-25 11:34:37,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:34:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2023-12-25 11:34:37,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:34:37,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831312506] [2023-12-25 11:34:37,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831312506] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:34:37,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:34:37,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-25 11:34:37,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490254354] [2023-12-25 11:34:37,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:34:37,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:34:37,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:34:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:34:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:34:37,795 INFO L87 Difference]: Start difference. First operand 173 states and 252 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2023-12-25 11:34:39,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:34:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:34:41,996 INFO L93 Difference]: Finished difference Result 350 states and 510 transitions. [2023-12-25 11:34:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:34:42,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 215 [2023-12-25 11:34:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:34:42,005 INFO L225 Difference]: With dead ends: 350 [2023-12-25 11:34:42,005 INFO L226 Difference]: Without dead ends: 185 [2023-12-25 11:34:42,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:34:42,010 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 9 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:34:42,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 465 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-25 11:34:42,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-25 11:34:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2023-12-25 11:34:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 125 states have (on average 1.312) internal successors, (164), 125 states have internal predecessors, (164), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2023-12-25 11:34:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 266 transitions. [2023-12-25 11:34:42,043 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 266 transitions. Word has length 215 [2023-12-25 11:34:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:34:42,043 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 266 transitions. [2023-12-25 11:34:42,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2023-12-25 11:34:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 266 transitions. [2023-12-25 11:34:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-25 11:34:42,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:34:42,047 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:34:42,063 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 (7)] Ended with exit code 0 [2023-12-25 11:34:42,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:42,261 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:34:42,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:34:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash 830561207, now seen corresponding path program 2 times [2023-12-25 11:34:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:34:42,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863579809] [2023-12-25 11:34:42,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 11:34:42,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:42,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:34:42,264 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:34:42,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 11:34:42,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 11:34:42,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 11:34:42,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 11:34:42,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:34:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2023-12-25 11:34:42,861 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:34:42,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:34:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863579809] [2023-12-25 11:34:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863579809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:34:42,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:34:42,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:34:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719661111] [2023-12-25 11:34:42,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:34:42,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:34:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:34:42,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:34:42,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:34:42,863 INFO L87 Difference]: Start difference. First operand 185 states and 266 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2023-12-25 11:34:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:34:43,277 INFO L93 Difference]: Finished difference Result 340 states and 491 transitions. [2023-12-25 11:34:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:34:43,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 227 [2023-12-25 11:34:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:34:43,283 INFO L225 Difference]: With dead ends: 340 [2023-12-25 11:34:43,283 INFO L226 Difference]: Without dead ends: 185 [2023-12-25 11:34:43,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:34:43,285 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:34:43,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 11:34:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-25 11:34:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2023-12-25 11:34:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 125 states have (on average 1.304) internal successors, (163), 125 states have internal predecessors, (163), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2023-12-25 11:34:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 265 transitions. [2023-12-25 11:34:43,299 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 265 transitions. Word has length 227 [2023-12-25 11:34:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:34:43,301 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 265 transitions. [2023-12-25 11:34:43,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2023-12-25 11:34:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 265 transitions. [2023-12-25 11:34:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-25 11:34:43,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:34:43,305 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:34:43,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 11:34:43,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:43,515 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:34:43,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:34:43,515 INFO L85 PathProgramCache]: Analyzing trace with hash -727994058, now seen corresponding path program 1 times [2023-12-25 11:34:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:34:43,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140101931] [2023-12-25 11:34:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:34:43,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:43,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:34:43,517 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:34:43,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 11:34:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:34:44,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:34:44,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:34:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2023-12-25 11:34:45,890 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:34:45,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:34:45,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140101931] [2023-12-25 11:34:45,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140101931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:34:45,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:34:45,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:34:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964147602] [2023-12-25 11:34:45,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:34:45,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:34:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:34:45,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:34:45,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:34:45,895 INFO L87 Difference]: Start difference. First operand 185 states and 265 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2023-12-25 11:34:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:34:50,835 INFO L93 Difference]: Finished difference Result 466 states and 682 transitions. [2023-12-25 11:34:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 11:34:50,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 243 [2023-12-25 11:34:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:34:50,838 INFO L225 Difference]: With dead ends: 466 [2023-12-25 11:34:50,838 INFO L226 Difference]: Without dead ends: 304 [2023-12-25 11:34:50,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:34:50,840 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 144 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-25 11:34:50,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 278 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-25 11:34:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-12-25 11:34:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2023-12-25 11:34:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 191 states have (on average 1.219895287958115) internal successors, (233), 188 states have internal predecessors, (233), 80 states have call successors, (80), 14 states have call predecessors, (80), 20 states have return successors, (101), 89 states have call predecessors, (101), 80 states have call successors, (101) [2023-12-25 11:34:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 414 transitions. [2023-12-25 11:34:50,870 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 414 transitions. Word has length 243 [2023-12-25 11:34:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:34:50,871 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 414 transitions. [2023-12-25 11:34:50,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2023-12-25 11:34:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 414 transitions. [2023-12-25 11:34:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-25 11:34:50,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:34:50,876 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:34:50,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-25 11:34:51,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:51,091 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:34:51,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:34:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash 174926520, now seen corresponding path program 1 times [2023-12-25 11:34:51,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:34:51,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107678143] [2023-12-25 11:34:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:34:51,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:34:51,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:34:51,094 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:34:51,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 11:34:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:34:52,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 11:34:52,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:34:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 480 proven. 6 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2023-12-25 11:34:53,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:34:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1438 trivial. 0 not checked. [2023-12-25 11:34:54,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:34:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107678143] [2023-12-25 11:34:54,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107678143] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:34:54,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:34:54,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2023-12-25 11:34:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164554564] [2023-12-25 11:34:54,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:34:54,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:34:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:34:54,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:34:54,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:34:54,758 INFO L87 Difference]: Start difference. First operand 292 states and 414 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 7 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 7 states have call predecessors, (56), 7 states have call successors, (56) [2023-12-25 11:34:59,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:05,063 INFO L93 Difference]: Finished difference Result 796 states and 1157 transitions. [2023-12-25 11:35:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:35:05,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 7 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 7 states have call predecessors, (56), 7 states have call successors, (56) Word has length 243 [2023-12-25 11:35:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:05,068 INFO L225 Difference]: With dead ends: 796 [2023-12-25 11:35:05,068 INFO L226 Difference]: Without dead ends: 527 [2023-12-25 11:35:05,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:35:05,070 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 238 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 153 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:05,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 384 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 279 Invalid, 1 Unknown, 0 Unchecked, 10.1s Time] [2023-12-25 11:35:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-12-25 11:35:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 518. [2023-12-25 11:35:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 338 states have (on average 1.2189349112426036) internal successors, (412), 338 states have internal predecessors, (412), 125 states have call successors, (125), 38 states have call predecessors, (125), 54 states have return successors, (188), 141 states have call predecessors, (188), 125 states have call successors, (188) [2023-12-25 11:35:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 725 transitions. [2023-12-25 11:35:05,111 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 725 transitions. Word has length 243 [2023-12-25 11:35:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:05,111 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 725 transitions. [2023-12-25 11:35:05,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 7 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 7 states have call predecessors, (56), 7 states have call successors, (56) [2023-12-25 11:35:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 725 transitions. [2023-12-25 11:35:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-25 11:35:05,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:05,116 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:35:05,140 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-25 11:35:05,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:05,330 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:05,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash 611037626, now seen corresponding path program 1 times [2023-12-25 11:35:05,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:05,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983284321] [2023-12-25 11:35:05,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:05,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:05,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:05,333 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:35:05,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 11:35:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:06,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 11:35:06,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2023-12-25 11:35:07,958 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:07,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983284321] [2023-12-25 11:35:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983284321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:07,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:07,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 11:35:07,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67921607] [2023-12-25 11:35:07,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:07,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:35:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:07,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:35:07,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:35:07,960 INFO L87 Difference]: Start difference. First operand 518 states and 725 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2023-12-25 11:35:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:16,349 INFO L93 Difference]: Finished difference Result 1095 states and 1538 transitions. [2023-12-25 11:35:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 11:35:16,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) Word has length 243 [2023-12-25 11:35:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:16,354 INFO L225 Difference]: With dead ends: 1095 [2023-12-25 11:35:16,354 INFO L226 Difference]: Without dead ends: 616 [2023-12-25 11:35:16,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:35:16,356 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 328 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:16,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 485 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-12-25 11:35:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2023-12-25 11:35:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 578. [2023-12-25 11:35:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 372 states have (on average 1.1881720430107527) internal successors, (442), 373 states have internal predecessors, (442), 149 states have call successors, (149), 42 states have call predecessors, (149), 56 states have return successors, (222), 162 states have call predecessors, (222), 149 states have call successors, (222) [2023-12-25 11:35:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 813 transitions. [2023-12-25 11:35:16,398 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 813 transitions. Word has length 243 [2023-12-25 11:35:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:16,399 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 813 transitions. [2023-12-25 11:35:16,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2023-12-25 11:35:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 813 transitions. [2023-12-25 11:35:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-25 11:35:16,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:16,403 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:35: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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 11:35:16,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:16,621 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:16,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:16,621 INFO L85 PathProgramCache]: Analyzing trace with hash -243501832, now seen corresponding path program 1 times [2023-12-25 11:35:16,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:16,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934115859] [2023-12-25 11:35:16,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:16,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:16,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:16,624 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:35:16,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 11:35:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:18,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:35:18,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:19,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-25 11:35:19,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:35:19,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2023-12-25 11:35:19,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:35:19,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-12-25 11:35:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2023-12-25 11:35:19,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:19,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:19,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934115859] [2023-12-25 11:35:19,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934115859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:19,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:19,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 11:35:19,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742205561] [2023-12-25 11:35:19,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:19,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:35:19,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:19,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:35:19,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:35:19,999 INFO L87 Difference]: Start difference. First operand 578 states and 813 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2023-12-25 11:35:24,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:28,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:32,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:34,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:39,689 INFO L93 Difference]: Finished difference Result 867 states and 1188 transitions. [2023-12-25 11:35:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 11:35:39,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 243 [2023-12-25 11:35:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:39,695 INFO L225 Difference]: With dead ends: 867 [2023-12-25 11:35:39,696 INFO L226 Difference]: Without dead ends: 578 [2023-12-25 11:35:39,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:35:39,698 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 81 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 49 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:39,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 539 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 295 Invalid, 3 Unknown, 0 Unchecked, 19.4s Time] [2023-12-25 11:35:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2023-12-25 11:35:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 573. [2023-12-25 11:35:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 368 states have (on average 1.1875) internal successors, (437), 369 states have internal predecessors, (437), 148 states have call successors, (148), 42 states have call predecessors, (148), 56 states have return successors, (218), 161 states have call predecessors, (218), 148 states have call successors, (218) [2023-12-25 11:35:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 803 transitions. [2023-12-25 11:35:39,742 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 803 transitions. Word has length 243 [2023-12-25 11:35:39,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:39,742 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 803 transitions. [2023-12-25 11:35:39,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2023-12-25 11:35:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 803 transitions. [2023-12-25 11:35:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-25 11:35:39,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:39,746 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:35:39,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 11:35:39,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:39,968 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:39,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash 990353240, now seen corresponding path program 1 times [2023-12-25 11:35:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:39,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001381159] [2023-12-25 11:35:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:39,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:39,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:39,971 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:35:39,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 11:35:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:41,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 11:35:41,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:43,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-25 11:35:45,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-25 11:35:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 546 proven. 2 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2023-12-25 11:35:45,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:35:46,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-12-25 11:35:46,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-12-25 11:35:47,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-12-25 11:35:47,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-12-25 11:35:47,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-12-25 11:35:47,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-12-25 11:35:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1438 trivial. 0 not checked. [2023-12-25 11:35:49,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:49,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001381159] [2023-12-25 11:35:49,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001381159] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:35:49,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:35:49,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-25 11:35:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070512388] [2023-12-25 11:35:49,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:35:49,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 11:35:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:49,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 11:35:49,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-12-25 11:35:49,283 INFO L87 Difference]: Start difference. First operand 573 states and 803 transitions. Second operand has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 12 states have call successors, (63), 7 states have call predecessors, (63), 12 states have return successors, (63), 14 states have call predecessors, (63), 12 states have call successors, (63) [2023-12-25 11:35:55,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:59,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:03,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:07,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:11,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:15,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:19,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:23,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:27,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:31,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:35,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:39,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:05,554 INFO L93 Difference]: Finished difference Result 1138 states and 1653 transitions. [2023-12-25 11:37:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 11:37:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 12 states have call successors, (63), 7 states have call predecessors, (63), 12 states have return successors, (63), 14 states have call predecessors, (63), 12 states have call successors, (63) Word has length 243 [2023-12-25 11:37:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:05,561 INFO L225 Difference]: With dead ends: 1138 [2023-12-25 11:37:05,561 INFO L226 Difference]: Without dead ends: 997 [2023-12-25 11:37:05,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 471 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2023-12-25 11:37:05,563 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 702 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 564 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:05,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1070 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 1299 Invalid, 12 Unknown, 0 Unchecked, 73.5s Time] [2023-12-25 11:37:05,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2023-12-25 11:37:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 958. [2023-12-25 11:37:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 592 states have (on average 1.179054054054054) internal successors, (698), 594 states have internal predecessors, (698), 276 states have call successors, (276), 58 states have call predecessors, (276), 89 states have return successors, (420), 305 states have call predecessors, (420), 276 states have call successors, (420) [2023-12-25 11:37:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1394 transitions. [2023-12-25 11:37:05,672 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1394 transitions. Word has length 243 [2023-12-25 11:37:05,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:05,673 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1394 transitions. [2023-12-25 11:37:05,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 12 states have call successors, (63), 7 states have call predecessors, (63), 12 states have return successors, (63), 14 states have call predecessors, (63), 12 states have call successors, (63) [2023-12-25 11:37:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1394 transitions. [2023-12-25 11:37:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-12-25 11:37:05,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:05,681 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:37:05,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 (13)] Forceful destruction successful, exit code 0 [2023-12-25 11:37:05,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:37:05,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:05,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:05,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1849243371, now seen corresponding path program 1 times [2023-12-25 11:37:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:05,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292839239] [2023-12-25 11:37:05,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:05,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:37:05,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:05,899 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:37:05,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 11:37:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:08,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:37:08,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:37:09,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-25 11:37:09,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:37:09,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2023-12-25 11:37:09,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:37:09,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-12-25 11:37:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2023-12-25 11:37:09,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:37:09,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:37:09,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292839239] [2023-12-25 11:37:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292839239] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:37:09,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:37:09,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 11:37:09,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106647496] [2023-12-25 11:37:09,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:37:09,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:37:09,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:37:09,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:37:09,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:37:09,834 INFO L87 Difference]: Start difference. First operand 958 states and 1394 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2023-12-25 11:37:14,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:18,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:22,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:24,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:30,319 INFO L93 Difference]: Finished difference Result 1814 states and 2580 transitions. [2023-12-25 11:37:30,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 11:37:30,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 259 [2023-12-25 11:37:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:30,326 INFO L225 Difference]: With dead ends: 1814 [2023-12-25 11:37:30,327 INFO L226 Difference]: Without dead ends: 956 [2023-12-25 11:37:30,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:37:30,332 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 77 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 47 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:30,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 543 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 289 Invalid, 3 Unknown, 0 Unchecked, 20.1s Time] [2023-12-25 11:37:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2023-12-25 11:37:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 940. [2023-12-25 11:37:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 580 states have (on average 1.1775862068965517) internal successors, (683), 581 states have internal predecessors, (683), 273 states have call successors, (273), 56 states have call predecessors, (273), 86 states have return successors, (411), 302 states have call predecessors, (411), 273 states have call successors, (411) [2023-12-25 11:37:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1367 transitions. [2023-12-25 11:37:30,454 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1367 transitions. Word has length 259 [2023-12-25 11:37:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:30,454 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1367 transitions. [2023-12-25 11:37:30,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2023-12-25 11:37:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1367 transitions. [2023-12-25 11:37:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-25 11:37:30,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:30,462 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:37:30,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 11:37:30,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:37:30,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:30,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash -623299400, now seen corresponding path program 1 times [2023-12-25 11:37:30,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:30,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061141713] [2023-12-25 11:37:30,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:30,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:37:30,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:30,685 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:37:30,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 11:37:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:33,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 11:37:33,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:37:35,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-25 11:37:36,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2023-12-25 11:37:36,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 11:37:36,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-12-25 11:37:40,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:37:40,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2023-12-25 11:37:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 513 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2023-12-25 11:37:40,171 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:37:40,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:37:40,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061141713] [2023-12-25 11:37:40,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061141713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:37:40,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:37:40,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-25 11:37:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050301504] [2023-12-25 11:37:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:37:40,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 11:37:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:37:40,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 11:37:40,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-25 11:37:40,173 INFO L87 Difference]: Start difference. First operand 940 states and 1367 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 8 states have call successors, (35), 6 states have call predecessors, (35), 7 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) [2023-12-25 11:37:45,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:49,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:53,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:57,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:01,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:05,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:09,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:13,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:17,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:20,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:21,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:34,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:38:43,003 INFO L93 Difference]: Finished difference Result 1441 states and 2077 transitions. [2023-12-25 11:38:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 11:38:43,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 8 states have call successors, (35), 6 states have call predecessors, (35), 7 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) Word has length 243 [2023-12-25 11:38:43,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:38:43,010 INFO L225 Difference]: With dead ends: 1441 [2023-12-25 11:38:43,011 INFO L226 Difference]: Without dead ends: 964 [2023-12-25 11:38:43,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2023-12-25 11:38:43,014 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 423 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 413 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.8s IncrementalHoareTripleChecker+Time [2023-12-25 11:38:43,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 811 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 949 Invalid, 9 Unknown, 0 Unchecked, 60.8s Time] [2023-12-25 11:38:43,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-12-25 11:38:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 940. [2023-12-25 11:38:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 580 states have (on average 1.1741379310344828) internal successors, (681), 581 states have internal predecessors, (681), 273 states have call successors, (273), 56 states have call predecessors, (273), 86 states have return successors, (411), 302 states have call predecessors, (411), 273 states have call successors, (411) [2023-12-25 11:38:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1365 transitions. [2023-12-25 11:38:43,136 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1365 transitions. Word has length 243 [2023-12-25 11:38:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:38:43,137 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1365 transitions. [2023-12-25 11:38:43,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 8 states have call successors, (35), 6 states have call predecessors, (35), 7 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) [2023-12-25 11:38:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1365 transitions. [2023-12-25 11:38:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-12-25 11:38:43,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:38:43,167 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:38:43,191 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-25 11:38:43,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:38:43,381 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:38:43,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:38:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1890427477, now seen corresponding path program 1 times [2023-12-25 11:38:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:38:43,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116789569] [2023-12-25 11:38:43,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:38:43,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:38:43,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:38:43,384 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:38:43,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 11:38:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:38:46,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 11:38:46,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:38:46,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-25 11:38:47,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-25 11:38:53,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-25 11:38:54,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-25 11:38:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 522 proven. 20 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2023-12-25 11:38:55,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:38:57,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:38:57,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-25 11:38:57,756 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 11:38:57,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-12-25 11:39:00,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:39:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116789569] [2023-12-25 11:39:00,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116789569] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 11:39:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [921576175] [2023-12-25 11:39:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:39:00,545 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 11:39:00,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 11:39:00,581 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 11:39:00,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-25 11:39:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:39:05,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 11:39:05,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:39:06,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-25 11:39:07,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-25 11:39:11,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-25 11:39:13,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-25 11:39:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 522 proven. 20 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2023-12-25 11:39:13,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:39:15,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:39:15,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-25 11:39:15,476 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 11:39:15,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-12-25 11:39:16,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [921576175] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 11:39:16,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:39:16,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2023-12-25 11:39:16,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038029143] [2023-12-25 11:39:16,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:39:16,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 11:39:16,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:39:16,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 11:39:16,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=565, Unknown=3, NotChecked=0, Total=650 [2023-12-25 11:39:16,777 INFO L87 Difference]: Start difference. First operand 940 states and 1365 transitions. Second operand has 21 states, 20 states have (on average 4.9) internal successors, (98), 19 states have internal predecessors, (98), 13 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (42), 11 states have call predecessors, (42), 13 states have call successors, (42) [2023-12-25 11:39:20,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:39:25,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:39:31,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:39:35,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:39:40,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:44,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:48,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:52,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:01,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:05,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:08,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:11,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:14,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:17,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:19,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:22,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:24,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:26,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:31,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:33,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:36,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:39,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:43,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:44,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:53,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:57,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:40:59,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:41:00,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:41:01,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:41:02,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:41:04,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:41:08,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:41:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:41:34,827 INFO L93 Difference]: Finished difference Result 1386 states and 2072 transitions. [2023-12-25 11:41:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 11:41:34,828 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.9) internal successors, (98), 19 states have internal predecessors, (98), 13 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (42), 11 states have call predecessors, (42), 13 states have call successors, (42) Word has length 259 [2023-12-25 11:41:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:41:34,836 INFO L225 Difference]: With dead ends: 1386 [2023-12-25 11:41:34,836 INFO L226 Difference]: Without dead ends: 1018 [2023-12-25 11:41:34,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 871 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=247, Invalid=1552, Unknown=7, NotChecked=0, Total=1806 [2023-12-25 11:41:34,840 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 339 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 272 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 119.9s IncrementalHoareTripleChecker+Time [2023-12-25 11:41:34,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1195 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 1841 Invalid, 21 Unknown, 0 Unchecked, 119.9s Time] [2023-12-25 11:41:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2023-12-25 11:41:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 942. [2023-12-25 11:41:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 581 states have (on average 1.1738382099827882) internal successors, (682), 583 states have internal predecessors, (682), 273 states have call successors, (273), 56 states have call predecessors, (273), 87 states have return successors, (418), 302 states have call predecessors, (418), 273 states have call successors, (418) [2023-12-25 11:41:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1373 transitions. [2023-12-25 11:41:35,016 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1373 transitions. Word has length 259 [2023-12-25 11:41:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:41:35,017 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 1373 transitions. [2023-12-25 11:41:35,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.9) internal successors, (98), 19 states have internal predecessors, (98), 13 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (42), 11 states have call predecessors, (42), 13 states have call successors, (42) [2023-12-25 11:41:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1373 transitions. [2023-12-25 11:41:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-12-25 11:41:35,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:41:35,025 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:41:35,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 11:41:35,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-12-25 11:41:35,440 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 11:41:35,441 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:41:35,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:41:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash 221270720, now seen corresponding path program 1 times [2023-12-25 11:41:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:41:35,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507981161] [2023-12-25 11:41:35,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:41:35,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:41:35,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:41:35,443 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:41:35,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 11:41:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:41:36,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 11:41:36,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:41:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1726 backedges. 640 proven. 6 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2023-12-25 11:41:38,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:41:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1726 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1699 trivial. 0 not checked. [2023-12-25 11:41:43,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:41:43,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507981161] [2023-12-25 11:41:43,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507981161] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:41:43,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:41:43,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2023-12-25 11:41:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806027918] [2023-12-25 11:41:43,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:41:43,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 11:41:43,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:41:43,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 11:41:43,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-25 11:41:43,671 INFO L87 Difference]: Start difference. First operand 942 states and 1373 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 11 states have call successors, (62), 6 states have call predecessors, (62), 7 states have return successors, (61), 10 states have call predecessors, (61), 11 states have call successors, (61) [2023-12-25 11:41:49,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:53,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:57,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:01,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:06,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:10,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:14,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:42:40,689 INFO L93 Difference]: Finished difference Result 1992 states and 2824 transitions. [2023-12-25 11:42:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 11:42:40,690 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 11 states have call successors, (62), 6 states have call predecessors, (62), 7 states have return successors, (61), 10 states have call predecessors, (61), 11 states have call successors, (61) Word has length 273 [2023-12-25 11:42:40,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:42:40,698 INFO L225 Difference]: With dead ends: 1992 [2023-12-25 11:42:40,699 INFO L226 Difference]: Without dead ends: 1251 [2023-12-25 11:42:40,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 535 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2023-12-25 11:42:40,702 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 492 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 411 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:42:40,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1472 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 1630 Invalid, 7 Unknown, 0 Unchecked, 55.1s Time] [2023-12-25 11:42:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-12-25 11:42:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 948. [2023-12-25 11:42:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 582 states have (on average 1.1580756013745706) internal successors, (674), 592 states have internal predecessors, (674), 267 states have call successors, (267), 68 states have call predecessors, (267), 98 states have return successors, (378), 287 states have call predecessors, (378), 267 states have call successors, (378) [2023-12-25 11:42:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1319 transitions. [2023-12-25 11:42:40,889 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1319 transitions. Word has length 273 [2023-12-25 11:42:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:42:40,892 INFO L495 AbstractCegarLoop]: Abstraction has 948 states and 1319 transitions. [2023-12-25 11:42:40,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 11 states have call successors, (62), 6 states have call predecessors, (62), 7 states have return successors, (61), 10 states have call predecessors, (61), 11 states have call successors, (61) [2023-12-25 11:42:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1319 transitions. [2023-12-25 11:42:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-25 11:42:40,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:42:40,899 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:42:40,926 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-25 11:42:41,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:42:41,122 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:42:41,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:42:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash -954729578, now seen corresponding path program 1 times [2023-12-25 11:42:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:42:41,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532032385] [2023-12-25 11:42:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:42:41,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-25 11:42:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:42:41,133 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:42:41,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 11:42:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:42:42,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:42:42,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:42:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2023-12-25 11:42:42,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:42:42,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:42:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532032385] [2023-12-25 11:42:42,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532032385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:42:42,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:42:42,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:42:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045300676] [2023-12-25 11:42:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:42:42,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:42:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:42:42,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:42:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:42:42,736 INFO L87 Difference]: Start difference. First operand 948 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2023-12-25 11:42:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:42:43,758 INFO L93 Difference]: Finished difference Result 1760 states and 2560 transitions. [2023-12-25 11:42:43,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:42:43,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 262 [2023-12-25 11:42:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:42:43,765 INFO L225 Difference]: With dead ends: 1760 [2023-12-25 11:42:43,765 INFO L226 Difference]: Without dead ends: 956 [2023-12-25 11:42:43,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:42:43,770 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 11:42:43,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 11:42:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2023-12-25 11:42:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2023-12-25 11:42:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 590 states have (on average 1.1559322033898305) internal successors, (682), 600 states have internal predecessors, (682), 267 states have call successors, (267), 68 states have call predecessors, (267), 98 states have return successors, (378), 287 states have call predecessors, (378), 267 states have call successors, (378) [2023-12-25 11:42:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1327 transitions. [2023-12-25 11:42:43,950 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1327 transitions. Word has length 262 [2023-12-25 11:42:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:42:43,950 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 1327 transitions. [2023-12-25 11:42:43,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2023-12-25 11:42:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1327 transitions. [2023-12-25 11:42:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-25 11:42:43,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:42:43,957 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:42:43,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 11:42:44,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:42:44,180 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:42:44,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:42:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1770776808, now seen corresponding path program 1 times [2023-12-25 11:42:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:42:44,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838205528] [2023-12-25 11:42:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:42:44,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:42:44,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:42:44,185 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:42:44,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 11:42:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:42:49,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-25 11:42:49,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:42:50,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 99 [2023-12-25 11:42:52,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:42:52,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 99 treesize of output 71 [2023-12-25 11:42:52,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-25 11:42:58,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-25 11:43:00,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-12-25 11:43:06,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2023-12-25 11:43:06,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 45 [2023-12-25 11:43:10,082 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-25 11:43:10,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2023-12-25 11:43:10,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-12-25 11:43:12,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2023-12-25 11:43:12,857 INFO L349 Elim1Store]: treesize reduction 249, result has 19.9 percent of original size [2023-12-25 11:43:12,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 131 [2023-12-25 11:43:51,176 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-25 11:43:51,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2023-12-25 11:43:55,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2023-12-25 11:43:55,771 INFO L349 Elim1Store]: treesize reduction 249, result has 19.9 percent of original size [2023-12-25 11:43:55,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 131 [2023-12-25 11:44:45,801 WARN L293 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 11:44:48,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2023-12-25 11:44:48,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 11:44:48,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 11:44:49,247 INFO L349 Elim1Store]: treesize reduction 43, result has 48.2 percent of original size [2023-12-25 11:44:49,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 131 [2023-12-25 11:45:42,241 WARN L293 SmtUtils]: Spent 7.98s on a formula simplification. DAG size of input: 255 DAG size of output: 267 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 11:47:01,973 WARN L293 SmtUtils]: Spent 7.08s on a formula simplification that was a NOOP. DAG size: 264 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 11:47:23,977 WARN L293 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 267 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 11:47:57,727 WARN L293 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 267 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-25 11:48:17,158 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 (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 11:48:17,176 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 11:48:18,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 11:48:18,377 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 11:48:18,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 11:48:18,540 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 11:48:18,540 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 263 with TraceHistMax 27,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-25 11:48:18,546 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:48:18,547 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 11:48:18,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 11:48:18 BoogieIcfgContainer [2023-12-25 11:48:18,549 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 11:48:18,549 INFO L158 Benchmark]: Toolchain (without parser) took 840198.72ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 176.7MB in the beginning and 165.0MB in the end (delta: 11.6MB). Peak memory consumption was 174.7MB. Max. memory is 8.0GB. [2023-12-25 11:48:18,549 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 167.8MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 11:48:18,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.64ms. Allocated memory is still 227.5MB. Free memory was 176.2MB in the beginning and 146.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-25 11:48:18,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.62ms. Allocated memory is still 227.5MB. Free memory was 146.8MB in the beginning and 142.1MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-25 11:48:18,549 INFO L158 Benchmark]: Boogie Preprocessor took 192.66ms. Allocated memory is still 227.5MB. Free memory was 142.1MB in the beginning and 133.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-25 11:48:18,552 INFO L158 Benchmark]: RCFGBuilder took 6471.05ms. Allocated memory is still 227.5MB. Free memory was 133.2MB in the beginning and 127.9MB in the end (delta: 5.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 11:48:18,552 INFO L158 Benchmark]: TraceAbstraction took 832783.70ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 127.4MB in the beginning and 165.0MB in the end (delta: -37.6MB). Peak memory consumption was 124.4MB. Max. memory is 8.0GB. [2023-12-25 11:48:18,553 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.68ms. Allocated memory is still 167.8MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 665.64ms. Allocated memory is still 227.5MB. Free memory was 176.2MB in the beginning and 146.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.62ms. Allocated memory is still 227.5MB. Free memory was 146.8MB in the beginning and 142.1MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 192.66ms. Allocated memory is still 227.5MB. Free memory was 142.1MB in the beginning and 133.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 6471.05ms. Allocated memory is still 227.5MB. Free memory was 133.2MB in the beginning and 127.9MB in the end (delta: 5.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 832783.70ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 127.4MB in the beginning and 165.0MB in the end (delta: -37.6MB). Peak memory consumption was 124.4MB. 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: 542]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 542). Cancelled while NwaCegarLoop was analyzing trace of length 263 with TraceHistMax 27,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 832.7s, OverallIterations: 18, TraceHistogramMax: 28, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 407.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 56 mSolverCounterUnknown, 3127 SdHoareTripleChecker+Valid, 381.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2918 mSDsluCounter, 9589 SdHoareTripleChecker+Invalid, 376.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6794 mSDsCounter, 2178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7676 IncrementalHoareTripleChecker+Invalid, 9910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2178 mSolverCounterUnsat, 2795 mSDtfsCounter, 7676 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5424 GetRequests, 5251 SyntacticMatches, 13 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 47.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=958occurred in iteration=12, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 524 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.7s SsaConstructionTime, 18.3s SatisfiabilityAnalysisTime, 58.7s InterpolantComputationTime, 3880 NumberOfCodeBlocks, 3553 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4966 ConstructedInterpolants, 32 QuantifiedInterpolants, 10654 SizeOfPredicates, 48 NumberOfNonLiveVariables, 18908 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 29630/29725 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