/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/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 15:34:26,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 15:34:26,244 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-24 15:34:26,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 15:34:26,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 15:34:26,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 15:34:26,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 15:34:26,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 15:34:26,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 15:34:26,296 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 15:34:26,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 15:34:26,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 15:34:26,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 15:34:26,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 15:34:26,298 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 15:34:26,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 15:34:26,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 15:34:26,299 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 15:34:26,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 15:34:26,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 15:34:26,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 15:34:26,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 15:34:26,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 15:34:26,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 15:34:26,302 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 15:34:26,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 15:34:26,302 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 15:34:26,302 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 15:34:26,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 15:34:26,303 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 15:34:26,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 15:34:26,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 15:34:26,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 15:34:26,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 15:34:26,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 15:34:26,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 15:34:26,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 15:34:26,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 15:34:26,305 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 15:34:26,305 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 15:34:26,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 15:34:26,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 15:34:26,305 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 15:34:26,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 15:34:26,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 15:34:26,306 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 15:34:26,306 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-24 15:34:26,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 15:34:26,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 15:34:26,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 15:34:26,563 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 15:34:26,563 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 15:34:26,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i [2023-12-24 15:34:27,694 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 15:34:27,907 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 15:34:27,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i [2023-12-24 15:34:27,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd48386d8/7d59fe6578a648ffa4e9993d3fe6efb4/FLAGf52ff5f87 [2023-12-24 15:34:27,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd48386d8/7d59fe6578a648ffa4e9993d3fe6efb4 [2023-12-24 15:34:27,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 15:34:27,933 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 15:34:27,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 15:34:27,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 15:34:27,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 15:34:27,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 03:34:27" (1/1) ... [2023-12-24 15:34:27,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693c6c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:27, skipping insertion in model container [2023-12-24 15:34:27,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 03:34:27" (1/1) ... [2023-12-24 15:34:27,979 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 15:34:28,093 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i[917,930] [2023-12-24 15:34:28,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 15:34:28,166 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 15:34:28,177 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i[917,930] [2023-12-24 15:34:28,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 15:34:28,224 INFO L206 MainTranslator]: Completed translation [2023-12-24 15:34:28,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28 WrapperNode [2023-12-24 15:34:28,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 15:34:28,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 15:34:28,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 15:34:28,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 15:34:28,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,278 INFO L138 Inliner]: procedures = 33, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2023-12-24 15:34:28,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 15:34:28,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 15:34:28,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 15:34:28,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 15:34:28,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,325 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 40, 15, 38, 6, 6]. 37 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 2, 6, 1, 1]. [2023-12-24 15:34:28,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 15:34:28,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 15:34:28,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 15:34:28,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 15:34:28,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (1/1) ... [2023-12-24 15:34:28,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 15:34:28,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 15:34:28,430 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-24 15:34:28,455 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-24 15:34:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 15:34:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 15:34:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 15:34:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-12-24 15:34:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-12-24 15:34:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-12-24 15:34:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2023-12-24 15:34:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 15:34:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 15:34:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-12-24 15:34:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-12-24 15:34:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-12-24 15:34:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2023-12-24 15:34:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 15:34:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 15:34:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 15:34:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 15:34:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 15:34:28,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 15:34:28,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 15:34:28,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 15:34:28,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 15:34:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 15:34:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 15:34:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 15:34:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 15:34:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 15:34:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 15:34:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 15:34:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 15:34:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 15:34:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 15:34:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 15:34:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-12-24 15:34:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-12-24 15:34:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-12-24 15:34:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2023-12-24 15:34:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 15:34:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 15:34:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 15:34:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 15:34:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 15:34:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 15:34:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 15:34:28,473 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 15:34:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 15:34:28,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 15:34:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 15:34:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 15:34:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 15:34:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 15:34:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 15:34:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 15:34:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 15:34:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 15:34:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 15:34:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 15:34:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 15:34:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 15:34:28,636 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 15:34:28,639 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 15:34:29,638 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 15:34:29,734 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 15:34:29,734 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 15:34:29,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 03:34:29 BoogieIcfgContainer [2023-12-24 15:34:29,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 15:34:29,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 15:34:29,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 15:34:29,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 15:34:29,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 03:34:27" (1/3) ... [2023-12-24 15:34:29,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71036e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 03:34:29, skipping insertion in model container [2023-12-24 15:34:29,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:34:28" (2/3) ... [2023-12-24 15:34:29,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71036e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 03:34:29, skipping insertion in model container [2023-12-24 15:34:29,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 03:34:29" (3/3) ... [2023-12-24 15:34:29,743 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-76.i [2023-12-24 15:34:29,757 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 15:34:29,757 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 15:34:29,805 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 15:34:29,812 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;@71dd4e80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 15:34:29,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 15:34:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 15:34:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-24 15:34:29,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:29,835 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:29,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:29,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1477510055, now seen corresponding path program 1 times [2023-12-24 15:34:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:29,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890507232] [2023-12-24 15:34:29,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:29,852 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-24 15:34:29,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:29,856 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-24 15:34:29,858 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-24 15:34:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:30,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 15:34:30,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-24 15:34:30,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:34:30,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:30,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890507232] [2023-12-24 15:34:30,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890507232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:34:30,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:34:30,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 15:34:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85944986] [2023-12-24 15:34:30,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:34:30,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 15:34:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:30,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 15:34:30,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 15:34:30,189 INFO L87 Difference]: Start difference. First operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 15:34:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:30,232 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-12-24 15:34:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 15:34:30,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-12-24 15:34:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:30,241 INFO L225 Difference]: With dead ends: 183 [2023-12-24 15:34:30,241 INFO L226 Difference]: Without dead ends: 89 [2023-12-24 15:34:30,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-24 15:34:30,246 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:30,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:34:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-24 15:34:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-24 15:34:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 15:34:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-24 15:34:30,283 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2023-12-24 15:34:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:30,283 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-24 15:34:30,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 15:34:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-24 15:34:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-24 15:34:30,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:30,288 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:30,296 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-24 15:34:30,497 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-24 15:34:30,497 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:30,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1742220379, now seen corresponding path program 1 times [2023-12-24 15:34:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:30,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83612370] [2023-12-24 15:34:30,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:30,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:34:30,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:30,501 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-24 15:34:30,534 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-24 15:34:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:30,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 15:34:30,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:30,816 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-24 15:34:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:34:30,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:34:30,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:30,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83612370] [2023-12-24 15:34:30,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83612370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:34:30,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:34:30,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 15:34:30,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683366042] [2023-12-24 15:34:30,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:34:30,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 15:34:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 15:34:30,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 15:34:30,865 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:30,936 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2023-12-24 15:34:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 15:34:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2023-12-24 15:34:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:30,941 INFO L225 Difference]: With dead ends: 177 [2023-12-24 15:34:30,941 INFO L226 Difference]: Without dead ends: 89 [2023-12-24 15:34:30,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 112 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-24 15:34:30,943 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:30,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:34:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-24 15:34:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-24 15:34:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 15:34:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2023-12-24 15:34:30,952 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2023-12-24 15:34:30,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:30,954 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2023-12-24 15:34:30,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2023-12-24 15:34:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-24 15:34:30,957 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:30,957 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:30,971 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-24 15:34:31,164 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-24 15:34:31,165 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:31,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:31,165 INFO L85 PathProgramCache]: Analyzing trace with hash -851152689, now seen corresponding path program 1 times [2023-12-24 15:34:31,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:31,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893213735] [2023-12-24 15:34:31,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:31,166 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-24 15:34:31,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:31,168 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-24 15:34:31,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 15:34:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:31,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 15:34:31,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:31,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:34:31,527 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 155 treesize of output 65 [2023-12-24 15:34:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-12-24 15:34:31,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:34:31,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:31,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893213735] [2023-12-24 15:34:31,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893213735] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:34:31,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:34:31,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:34:31,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804907436] [2023-12-24 15:34:31,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:34:31,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:34:31,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:31,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:34:31,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:34:31,573 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 15:34:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:32,268 INFO L93 Difference]: Finished difference Result 183 states and 262 transitions. [2023-12-24 15:34:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:34:32,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2023-12-24 15:34:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:32,272 INFO L225 Difference]: With dead ends: 183 [2023-12-24 15:34:32,272 INFO L226 Difference]: Without dead ends: 95 [2023-12-24 15:34:32,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 15:34:32,274 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 124 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:32,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 395 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 15:34:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-24 15:34:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2023-12-24 15:34:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 15:34:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2023-12-24 15:34:32,284 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 115 [2023-12-24 15:34:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:32,284 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2023-12-24 15:34:32,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 15:34:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2023-12-24 15:34:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-24 15:34:32,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:32,287 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:32,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 15:34:32,493 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-24 15:34:32,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:32,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1642195, now seen corresponding path program 1 times [2023-12-24 15:34:32,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:32,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570172368] [2023-12-24 15:34:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:32,495 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-24 15:34:32,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:32,496 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-24 15:34:32,520 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-24 15:34:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:32,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 15:34:32,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2023-12-24 15:34:32,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:34:32,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:32,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570172368] [2023-12-24 15:34:32,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570172368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:34:32,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:34:32,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 15:34:32,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930803586] [2023-12-24 15:34:32,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:34:32,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:34:32,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:32,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:34:32,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:34:32,760 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-24 15:34:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:32,942 INFO L93 Difference]: Finished difference Result 181 states and 256 transitions. [2023-12-24 15:34:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 15:34:32,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2023-12-24 15:34:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:32,943 INFO L225 Difference]: With dead ends: 181 [2023-12-24 15:34:32,943 INFO L226 Difference]: Without dead ends: 91 [2023-12-24 15:34:32,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 15:34:32,945 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 6 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:32,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 482 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:34:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-24 15:34:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2023-12-24 15:34:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 15:34:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2023-12-24 15:34:32,953 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 117 [2023-12-24 15:34:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:32,954 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2023-12-24 15:34:32,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-24 15:34:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2023-12-24 15:34:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-24 15:34:32,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:32,956 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:32,965 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-24 15:34:33,162 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-24 15:34:33,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:33,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash 996335893, now seen corresponding path program 1 times [2023-12-24 15:34:33,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:33,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753573395] [2023-12-24 15:34:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:33,165 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-24 15:34:33,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:33,166 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-24 15:34:33,173 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-24 15:34:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:33,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 15:34:33,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:33,908 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 8 treesize of output 1 [2023-12-24 15:34:35,777 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-12-24 15:34:36,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-12-24 15:34:36,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:34:36,079 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 63 treesize of output 35 [2023-12-24 15:34:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 11 proven. 177 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-12-24 15:34:36,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:34:36,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:36,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753573395] [2023-12-24 15:34:36,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753573395] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:34:36,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [112190548] [2023-12-24 15:34:36,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:36,438 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:34:36,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:34:36,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:34:36,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-24 15:34:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:37,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 15:34:37,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:37,503 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 15 treesize of output 1 [2023-12-24 15:34:38,849 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 17 treesize of output 17 [2023-12-24 15:34:39,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2023-12-24 15:34:39,238 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 0 case distinctions, treesize of input 50 treesize of output 30 [2023-12-24 15:34:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2023-12-24 15:34:39,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:34:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [112190548] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:34:39,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:34:39,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2023-12-24 15:34:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826243602] [2023-12-24 15:34:39,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:34:39,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 15:34:39,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:39,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 15:34:39,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2023-12-24 15:34:39,623 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 18 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 5 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 5 states have call successors, (30) [2023-12-24 15:34:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:40,918 INFO L93 Difference]: Finished difference Result 239 states and 330 transitions. [2023-12-24 15:34:40,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 15:34:40,919 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 5 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 5 states have call successors, (30) Word has length 117 [2023-12-24 15:34:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:40,921 INFO L225 Difference]: With dead ends: 239 [2023-12-24 15:34:40,921 INFO L226 Difference]: Without dead ends: 151 [2023-12-24 15:34:40,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2023-12-24 15:34:40,923 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 647 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:40,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 716 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 15:34:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-24 15:34:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2023-12-24 15:34:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 123 states have (on average 1.3333333333333333) internal successors, (164), 124 states have internal predecessors, (164), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-24 15:34:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2023-12-24 15:34:40,952 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 117 [2023-12-24 15:34:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:40,954 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2023-12-24 15:34:40,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 5 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 5 states have call successors, (30) [2023-12-24 15:34:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2023-12-24 15:34:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-24 15:34:40,961 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:40,961 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:40,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-24 15:34:41,167 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 (6)] Ended with exit code 0 [2023-12-24 15:34:41,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-24 15:34:41,362 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:41,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1813984343, now seen corresponding path program 1 times [2023-12-24 15:34:41,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:41,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143070437] [2023-12-24 15:34:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:41,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:34:41,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:41,365 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-24 15:34:41,365 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-24 15:34:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:41,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 15:34:41,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:41,577 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 9 [2023-12-24 15:34:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:34:41,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:34:41,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:41,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143070437] [2023-12-24 15:34:41,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143070437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:34:41,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:34:41,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 15:34:41,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948057562] [2023-12-24 15:34:41,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:34:41,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:34:41,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:34:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:34:41,725 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:41,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:41,971 INFO L93 Difference]: Finished difference Result 427 states and 583 transitions. [2023-12-24 15:34:41,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:34:41,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-24 15:34:41,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:41,975 INFO L225 Difference]: With dead ends: 427 [2023-12-24 15:34:41,975 INFO L226 Difference]: Without dead ends: 284 [2023-12-24 15:34:41,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:34:41,976 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 147 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:41,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 500 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:34:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-12-24 15:34:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 240. [2023-12-24 15:34:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 1.3015075376884422) internal successors, (259), 201 states have internal predecessors, (259), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 15:34:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 327 transitions. [2023-12-24 15:34:42,000 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 327 transitions. Word has length 117 [2023-12-24 15:34:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:42,001 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 327 transitions. [2023-12-24 15:34:42,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 327 transitions. [2023-12-24 15:34:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 15:34:42,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:42,002 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:42,012 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-24 15:34:42,208 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-24 15:34:42,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:42,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash 70420074, now seen corresponding path program 1 times [2023-12-24 15:34:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194879755] [2023-12-24 15:34:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:42,210 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-24 15:34:42,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:42,211 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-24 15:34:42,212 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-24 15:34:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:42,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 15:34:42,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:34:42,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:34:42,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194879755] [2023-12-24 15:34:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194879755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:34:42,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:34:42,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:34:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017775932] [2023-12-24 15:34:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:34:42,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:34:42,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:42,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:34:42,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:34:42,407 INFO L87 Difference]: Start difference. First operand 240 states and 327 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:42,472 INFO L93 Difference]: Finished difference Result 532 states and 728 transitions. [2023-12-24 15:34:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:34:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-24 15:34:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:42,474 INFO L225 Difference]: With dead ends: 532 [2023-12-24 15:34:42,474 INFO L226 Difference]: Without dead ends: 297 [2023-12-24 15:34:42,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:34:42,475 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:42,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 476 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:34:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-24 15:34:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 249. [2023-12-24 15:34:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 208 states have (on average 1.2884615384615385) internal successors, (268), 210 states have internal predecessors, (268), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 15:34:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 336 transitions. [2023-12-24 15:34:42,498 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 336 transitions. Word has length 119 [2023-12-24 15:34:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:42,499 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 336 transitions. [2023-12-24 15:34:42,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 336 transitions. [2023-12-24 15:34:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-24 15:34:42,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:42,500 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:42,515 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-24 15:34:42,707 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-24 15:34:42,707 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:42,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1715821700, now seen corresponding path program 1 times [2023-12-24 15:34:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477603796] [2023-12-24 15:34:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:42,708 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-24 15:34:42,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:42,709 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-24 15:34:42,710 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-24 15:34:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:42,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 15:34:42,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:34:42,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:34:42,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477603796] [2023-12-24 15:34:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477603796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:34:42,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:34:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 15:34:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423046974] [2023-12-24 15:34:42,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:34:42,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:34:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:42,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:34:42,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:34:42,927 INFO L87 Difference]: Start difference. First operand 249 states and 336 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:43,159 INFO L93 Difference]: Finished difference Result 601 states and 818 transitions. [2023-12-24 15:34:43,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 15:34:43,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-24 15:34:43,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:43,161 INFO L225 Difference]: With dead ends: 601 [2023-12-24 15:34:43,161 INFO L226 Difference]: Without dead ends: 357 [2023-12-24 15:34:43,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-24 15:34:43,163 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 99 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:43,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 637 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:34:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-12-24 15:34:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 252. [2023-12-24 15:34:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 213 states have internal predecessors, (271), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 15:34:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 339 transitions. [2023-12-24 15:34:43,184 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 339 transitions. Word has length 121 [2023-12-24 15:34:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:43,184 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 339 transitions. [2023-12-24 15:34:43,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 339 transitions. [2023-12-24 15:34:43,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-24 15:34:43,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:43,186 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:43,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 (10)] Forceful destruction successful, exit code 0 [2023-12-24 15:34:43,393 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-24 15:34:43,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:43,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1728292737, now seen corresponding path program 1 times [2023-12-24 15:34:43,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:43,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052964754] [2023-12-24 15:34:43,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:43,394 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-24 15:34:43,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:43,395 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-24 15:34:43,396 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-24 15:34:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:43,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 15:34:43,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:45,403 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 27 treesize of output 22 [2023-12-24 15:34:45,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:34:45,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2023-12-24 15:34:45,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:34:45,563 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 31 treesize of output 15 [2023-12-24 15:34:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 11 proven. 177 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-12-24 15:34:45,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:34:45,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052964754] [2023-12-24 15:34:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052964754] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:34:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [380600929] [2023-12-24 15:34:45,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:45,761 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:34:45,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:34:45,762 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:34:45,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-24 15:34:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:46,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 15:34:46,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:47,720 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-12-24 15:34:47,720 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 1 case distinctions, treesize of input 17 treesize of output 21 [2023-12-24 15:34:47,997 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 33 treesize of output 17 [2023-12-24 15:34:48,094 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 18 treesize of output 10 [2023-12-24 15:34:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:34:48,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:34:48,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [380600929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:34:48,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:34:48,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2023-12-24 15:34:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598562672] [2023-12-24 15:34:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:34:48,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 15:34:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:48,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 15:34:48,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2023-12-24 15:34:48,099 INFO L87 Difference]: Start difference. First operand 252 states and 339 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:48,682 INFO L93 Difference]: Finished difference Result 602 states and 813 transitions. [2023-12-24 15:34:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 15:34:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-24 15:34:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:48,685 INFO L225 Difference]: With dead ends: 602 [2023-12-24 15:34:48,685 INFO L226 Difference]: Without dead ends: 355 [2023-12-24 15:34:48,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2023-12-24 15:34:48,687 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 390 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:48,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 372 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 15:34:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-12-24 15:34:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 252. [2023-12-24 15:34:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 213 states have internal predecessors, (271), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 15:34:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 339 transitions. [2023-12-24 15:34:48,712 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 339 transitions. Word has length 123 [2023-12-24 15:34:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:48,713 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 339 transitions. [2023-12-24 15:34:48,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 339 transitions. [2023-12-24 15:34:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-24 15:34:48,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:48,714 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:48,724 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-24 15:34:48,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2023-12-24 15:34:49,124 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 15:34:49,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:49,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:49,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1688181149, now seen corresponding path program 1 times [2023-12-24 15:34:49,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:49,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274222525] [2023-12-24 15:34:49,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:49,125 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-24 15:34:49,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:49,126 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-24 15:34:49,127 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-24 15:34:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:49,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 15:34:49,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:49,320 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-24 15:34:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:34:49,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:34:49,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:49,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274222525] [2023-12-24 15:34:49,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274222525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:34:49,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:34:49,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 15:34:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514708258] [2023-12-24 15:34:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:34:49,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 15:34:49,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:49,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 15:34:49,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 15:34:49,330 INFO L87 Difference]: Start difference. First operand 252 states and 339 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:49,373 INFO L93 Difference]: Finished difference Result 517 states and 697 transitions. [2023-12-24 15:34:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 15:34:49,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-24 15:34:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:49,375 INFO L225 Difference]: With dead ends: 517 [2023-12-24 15:34:49,375 INFO L226 Difference]: Without dead ends: 270 [2023-12-24 15:34:49,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 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-24 15:34:49,377 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 33 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 230 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.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:49,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 230 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:34:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-24 15:34:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 252. [2023-12-24 15:34:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 211 states have (on average 1.2654028436018958) internal successors, (267), 213 states have internal predecessors, (267), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 15:34:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 335 transitions. [2023-12-24 15:34:49,400 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 335 transitions. Word has length 123 [2023-12-24 15:34:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:49,400 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 335 transitions. [2023-12-24 15:34:49,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 335 transitions. [2023-12-24 15:34:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-24 15:34:49,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:49,402 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:49,411 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-24 15:34:49,608 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-24 15:34:49,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:49,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash -963663243, now seen corresponding path program 1 times [2023-12-24 15:34:49,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:49,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887339766] [2023-12-24 15:34:49,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:49,609 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-24 15:34:49,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:49,610 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-24 15:34:49,611 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-24 15:34:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:49,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 15:34:49,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:50,560 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 15 treesize of output 1 [2023-12-24 15:34:50,955 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-12-24 15:34:51,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:34:51,223 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 75 treesize of output 47 [2023-12-24 15:34:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 5 proven. 231 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-24 15:34:51,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:34:51,766 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 522 treesize of output 462 [2023-12-24 15:34:51,860 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 74 treesize of output 58 [2023-12-24 15:34:51,900 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 74 treesize of output 58 [2023-12-24 15:34:51,930 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 74 treesize of output 58 [2023-12-24 15:34:51,960 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 74 treesize of output 58 [2023-12-24 15:34:51,991 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 74 treesize of output 58 [2023-12-24 15:34:52,026 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 74 treesize of output 58 [2023-12-24 15:34:52,053 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 74 treesize of output 58 [2023-12-24 15:34:52,094 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 74 treesize of output 58 [2023-12-24 15:34:52,139 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 74 treesize of output 58 [2023-12-24 15:34:52,167 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 74 treesize of output 58 [2023-12-24 15:34:52,196 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 74 treesize of output 58 [2023-12-24 15:34:52,223 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 74 treesize of output 58 [2023-12-24 15:34:52,251 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 74 treesize of output 58 [2023-12-24 15:34:52,282 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 74 treesize of output 58 [2023-12-24 15:34:52,317 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 74 treesize of output 58 [2023-12-24 15:34:52,348 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 74 treesize of output 58 [2023-12-24 15:34:52,399 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 74 treesize of output 58 [2023-12-24 15:34:52,439 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 74 treesize of output 58 [2023-12-24 15:34:52,483 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 74 treesize of output 58 [2023-12-24 15:34:52,522 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 74 treesize of output 58 [2023-12-24 15:34:52,554 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 74 treesize of output 58 [2023-12-24 15:34:52,584 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 74 treesize of output 58 [2023-12-24 15:34:52,633 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 74 treesize of output 58 [2023-12-24 15:34:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 15:34:52,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:52,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887339766] [2023-12-24 15:34:52,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887339766] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 15:34:52,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:34:52,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-12-24 15:34:52,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368419307] [2023-12-24 15:34:52,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:34:52,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 15:34:52,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:52,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 15:34:52,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-24 15:34:52,662 INFO L87 Difference]: Start difference. First operand 252 states and 335 transitions. Second operand has 20 states, 18 states have (on average 6.111111111111111) internal successors, (110), 19 states have internal predecessors, (110), 5 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 3 states have call predecessors, (30), 5 states have call successors, (30) [2023-12-24 15:34:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:54,171 INFO L93 Difference]: Finished difference Result 587 states and 775 transitions. [2023-12-24 15:34:54,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 15:34:54,171 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.111111111111111) internal successors, (110), 19 states have internal predecessors, (110), 5 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 3 states have call predecessors, (30), 5 states have call successors, (30) Word has length 125 [2023-12-24 15:34:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:54,174 INFO L225 Difference]: With dead ends: 587 [2023-12-24 15:34:54,174 INFO L226 Difference]: Without dead ends: 430 [2023-12-24 15:34:54,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 208 SyntacticMatches, 24 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=353, Invalid=1129, Unknown=0, NotChecked=0, Total=1482 [2023-12-24 15:34:54,176 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 378 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:54,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1116 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 15:34:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-12-24 15:34:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 401. [2023-12-24 15:34:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 344 states have (on average 1.2674418604651163) internal successors, (436), 348 states have internal predecessors, (436), 45 states have call successors, (45), 11 states have call predecessors, (45), 11 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-24 15:34:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 526 transitions. [2023-12-24 15:34:54,218 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 526 transitions. Word has length 125 [2023-12-24 15:34:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:54,218 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 526 transitions. [2023-12-24 15:34:54,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.111111111111111) internal successors, (110), 19 states have internal predecessors, (110), 5 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 3 states have call predecessors, (30), 5 states have call successors, (30) [2023-12-24 15:34:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 526 transitions. [2023-12-24 15:34:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-24 15:34:54,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:54,220 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:54,228 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-24 15:34:54,427 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-24 15:34:54,427 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:54,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash 582058527, now seen corresponding path program 1 times [2023-12-24 15:34:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:54,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925020800] [2023-12-24 15:34:54,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:54,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-24 15:34:54,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:54,430 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-24 15:34:54,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 (15)] Waiting until timeout for monitored process [2023-12-24 15:34:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:54,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 15:34:54,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:55,143 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-12-24 15:34:55,144 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-12-24 15:34:55,179 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 18 treesize of output 10 [2023-12-24 15:34:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 11 proven. 177 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-12-24 15:34:55,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:34:55,412 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-12-24 15:34:55,412 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 23 treesize of output 22 [2023-12-24 15:34:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 15:34:55,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:55,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925020800] [2023-12-24 15:34:55,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925020800] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 15:34:55,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:34:55,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-24 15:34:55,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936589023] [2023-12-24 15:34:55,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:34:55,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 15:34:55,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:55,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 15:34:55,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-24 15:34:55,481 INFO L87 Difference]: Start difference. First operand 401 states and 526 transitions. Second operand has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2023-12-24 15:34:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:56,588 INFO L93 Difference]: Finished difference Result 838 states and 1084 transitions. [2023-12-24 15:34:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 15:34:56,589 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) Word has length 126 [2023-12-24 15:34:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:56,595 INFO L225 Difference]: With dead ends: 838 [2023-12-24 15:34:56,595 INFO L226 Difference]: Without dead ends: 536 [2023-12-24 15:34:56,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2023-12-24 15:34:56,597 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 427 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:56,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 533 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 15:34:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-12-24 15:34:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 341. [2023-12-24 15:34:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 288 states have (on average 1.2569444444444444) internal successors, (362), 290 states have internal predecessors, (362), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-24 15:34:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 444 transitions. [2023-12-24 15:34:56,642 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 444 transitions. Word has length 126 [2023-12-24 15:34:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:56,643 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 444 transitions. [2023-12-24 15:34:56,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2023-12-24 15:34:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 444 transitions. [2023-12-24 15:34:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-24 15:34:56,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:56,645 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:56,651 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-24 15:34:56,851 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-24 15:34:56,851 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:56,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash 722607137, now seen corresponding path program 1 times [2023-12-24 15:34:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:56,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58690270] [2023-12-24 15:34:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:56,852 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-24 15:34:56,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:56,853 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-24 15:34:56,854 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-24 15:34:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:57,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 15:34:57,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:57,143 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-24 15:34:57,145 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-24 15:34:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:34:57,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:34:57,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:34:57,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58690270] [2023-12-24 15:34:57,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58690270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:34:57,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:34:57,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:34:57,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324225853] [2023-12-24 15:34:57,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:34:57,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:34:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:34:57,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:34:57,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:34:57,166 INFO L87 Difference]: Start difference. First operand 341 states and 444 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:34:57,482 INFO L93 Difference]: Finished difference Result 800 states and 1043 transitions. [2023-12-24 15:34:57,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:34:57,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-24 15:34:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:34:57,485 INFO L225 Difference]: With dead ends: 800 [2023-12-24 15:34:57,485 INFO L226 Difference]: Without dead ends: 464 [2023-12-24 15:34:57,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:34:57,487 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 102 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:34:57,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 617 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:34:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2023-12-24 15:34:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 429. [2023-12-24 15:34:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 367 states have (on average 1.2615803814713897) internal successors, (463), 370 states have internal predecessors, (463), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 15:34:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 555 transitions. [2023-12-24 15:34:57,536 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 555 transitions. Word has length 126 [2023-12-24 15:34:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:34:57,537 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 555 transitions. [2023-12-24 15:34:57,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:34:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 555 transitions. [2023-12-24 15:34:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-24 15:34:57,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:34:57,538 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:34:57,547 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-24 15:34:57,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:34:57,745 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:34:57,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:34:57,745 INFO L85 PathProgramCache]: Analyzing trace with hash 748533296, now seen corresponding path program 1 times [2023-12-24 15:34:57,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:34:57,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397796005] [2023-12-24 15:34:57,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:34:57,746 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-24 15:34:57,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:34:57,747 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:34:57,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-24 15:34:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:34:58,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-24 15:34:58,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:34:58,100 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 15 treesize of output 1 [2023-12-24 15:34:58,642 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 31 treesize of output 26 [2023-12-24 15:35:00,709 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2023-12-24 15:35:00,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2023-12-24 15:35:00,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2023-12-24 15:35:01,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:35:01,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 49 [2023-12-24 15:35:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 4 proven. 104 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 15:35:01,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:35:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:35:01,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:35:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397796005] [2023-12-24 15:35:01,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397796005] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:35:01,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:35:01,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 20 [2023-12-24 15:35:01,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407389897] [2023-12-24 15:35:01,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:35:01,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:35:01,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:35:01,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:35:01,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2023-12-24 15:35:01,562 INFO L87 Difference]: Start difference. First operand 429 states and 555 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:01,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:35:01,791 INFO L93 Difference]: Finished difference Result 609 states and 782 transitions. [2023-12-24 15:35:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:35:01,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-12-24 15:35:01,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:35:01,795 INFO L225 Difference]: With dead ends: 609 [2023-12-24 15:35:01,795 INFO L226 Difference]: Without dead ends: 607 [2023-12-24 15:35:01,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2023-12-24 15:35:01,797 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 52 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:35:01,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 521 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:35:01,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-12-24 15:35:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 565. [2023-12-24 15:35:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 503 states have (on average 1.2485089463220675) internal successors, (628), 506 states have internal predecessors, (628), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 15:35:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 720 transitions. [2023-12-24 15:35:01,850 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 720 transitions. Word has length 127 [2023-12-24 15:35:01,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:35:01,851 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 720 transitions. [2023-12-24 15:35:01,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 720 transitions. [2023-12-24 15:35:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-24 15:35:01,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:35:01,852 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:35:01,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-24 15:35:02,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:35:02,059 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:35:02,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:35:02,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1322233425, now seen corresponding path program 1 times [2023-12-24 15:35:02,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:35:02,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511009766] [2023-12-24 15:35:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:35:02,060 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-24 15:35:02,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:35:02,061 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-24 15:35:02,062 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-24 15:35:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:35:02,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 15:35:02,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:35:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:35:02,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:35:02,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:35:02,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511009766] [2023-12-24 15:35:02,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511009766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:35:02,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:35:02,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:35:02,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752893190] [2023-12-24 15:35:02,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:35:02,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:35:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:35:02,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:35:02,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:35:02,287 INFO L87 Difference]: Start difference. First operand 565 states and 720 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:35:02,548 INFO L93 Difference]: Finished difference Result 1485 states and 1917 transitions. [2023-12-24 15:35:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:35:02,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-12-24 15:35:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:35:02,553 INFO L225 Difference]: With dead ends: 1485 [2023-12-24 15:35:02,553 INFO L226 Difference]: Without dead ends: 925 [2023-12-24 15:35:02,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 15:35:02,559 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 118 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:35:02,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 468 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:35:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2023-12-24 15:35:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 583. [2023-12-24 15:35:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 521 states have (on average 1.2437619961612285) internal successors, (648), 524 states have internal predecessors, (648), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 15:35:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 740 transitions. [2023-12-24 15:35:02,630 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 740 transitions. Word has length 127 [2023-12-24 15:35:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:35:02,631 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 740 transitions. [2023-12-24 15:35:02,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 740 transitions. [2023-12-24 15:35:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-24 15:35:02,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:35:02,632 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:35:02,639 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-24 15:35:02,840 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-24 15:35:02,840 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:35:02,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:35:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash -642175055, now seen corresponding path program 1 times [2023-12-24 15:35:02,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:35:02,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907314233] [2023-12-24 15:35:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:35:02,841 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-24 15:35:02,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:35:02,842 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-24 15:35:02,843 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-24 15:35:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:35:03,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 15:35:03,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:35:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:35:03,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:35:03,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:35:03,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907314233] [2023-12-24 15:35:03,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907314233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:35:03,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:35:03,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 15:35:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822502636] [2023-12-24 15:35:03,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:35:03,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 15:35:03,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:35:03,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 15:35:03,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:35:03,070 INFO L87 Difference]: Start difference. First operand 583 states and 740 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:35:03,196 INFO L93 Difference]: Finished difference Result 1224 states and 1557 transitions. [2023-12-24 15:35:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:35:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-12-24 15:35:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:35:03,199 INFO L225 Difference]: With dead ends: 1224 [2023-12-24 15:35:03,199 INFO L226 Difference]: Without dead ends: 646 [2023-12-24 15:35:03,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-24 15:35:03,201 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 76 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:35:03,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 689 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:35:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2023-12-24 15:35:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 605. [2023-12-24 15:35:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 543 states have (on average 1.2302025782688766) internal successors, (668), 546 states have internal predecessors, (668), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 15:35:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 760 transitions. [2023-12-24 15:35:03,252 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 760 transitions. Word has length 127 [2023-12-24 15:35:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:35:03,252 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 760 transitions. [2023-12-24 15:35:03,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 760 transitions. [2023-12-24 15:35:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 15:35:03,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:35:03,253 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:35:03,260 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-24 15:35:03,459 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-24 15:35:03,460 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:35:03,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:35:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1698696970, now seen corresponding path program 1 times [2023-12-24 15:35:03,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:35:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958522093] [2023-12-24 15:35:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:35:03,461 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-24 15:35:03,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:35:03,462 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-24 15:35:03,463 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-24 15:35:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:35:03,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 15:35:03,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:35:04,125 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-12-24 15:35:04,125 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-12-24 15:35:04,174 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 18 treesize of output 10 [2023-12-24 15:35:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 11 proven. 177 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-12-24 15:35:04,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:35:04,406 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-12-24 15:35:04,406 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 23 treesize of output 22 [2023-12-24 15:35:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 15:35:04,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:35:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958522093] [2023-12-24 15:35:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958522093] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 15:35:04,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:35:04,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-24 15:35:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869393000] [2023-12-24 15:35:04,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:35:04,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 15:35:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:35:04,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 15:35:04,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-24 15:35:04,487 INFO L87 Difference]: Start difference. First operand 605 states and 760 transitions. Second operand has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2023-12-24 15:35:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:35:05,285 INFO L93 Difference]: Finished difference Result 1179 states and 1477 transitions. [2023-12-24 15:35:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 15:35:05,286 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) Word has length 129 [2023-12-24 15:35:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:35:05,289 INFO L225 Difference]: With dead ends: 1179 [2023-12-24 15:35:05,289 INFO L226 Difference]: Without dead ends: 579 [2023-12-24 15:35:05,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2023-12-24 15:35:05,291 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 222 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 15:35:05,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 399 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 15:35:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2023-12-24 15:35:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 566. [2023-12-24 15:35:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 504 states have (on average 1.2222222222222223) internal successors, (616), 507 states have internal predecessors, (616), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 15:35:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 708 transitions. [2023-12-24 15:35:05,341 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 708 transitions. Word has length 129 [2023-12-24 15:35:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:35:05,341 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 708 transitions. [2023-12-24 15:35:05,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2023-12-24 15:35:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 708 transitions. [2023-12-24 15:35:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-24 15:35:05,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:35:05,342 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:35:05,352 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-24 15:35:05,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:35:05,549 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:35:05,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:35:05,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1448321283, now seen corresponding path program 1 times [2023-12-24 15:35:05,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:35:05,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448995475] [2023-12-24 15:35:05,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:35:05,550 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-24 15:35:05,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:35:05,551 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:35:05,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-24 15:35:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:35:05,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 15:35:05,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:35:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 15:35:05,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:35:05,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:35:05,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448995475] [2023-12-24 15:35:05,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448995475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:35:05,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:35:05,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:35:05,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889106399] [2023-12-24 15:35:05,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:35:05,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:35:05,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:35:05,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:35:05,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:35:05,798 INFO L87 Difference]: Start difference. First operand 566 states and 708 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:35:05,955 INFO L93 Difference]: Finished difference Result 1325 states and 1650 transitions. [2023-12-24 15:35:05,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:35:05,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2023-12-24 15:35:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:35:05,958 INFO L225 Difference]: With dead ends: 1325 [2023-12-24 15:35:05,958 INFO L226 Difference]: Without dead ends: 764 [2023-12-24 15:35:05,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 15:35:05,960 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 64 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:35:05,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 454 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:35:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2023-12-24 15:35:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 602. [2023-12-24 15:35:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 540 states have (on average 1.201851851851852) internal successors, (649), 543 states have internal predecessors, (649), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 15:35:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 741 transitions. [2023-12-24 15:35:06,014 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 741 transitions. Word has length 130 [2023-12-24 15:35:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:35:06,014 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 741 transitions. [2023-12-24 15:35:06,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 741 transitions. [2023-12-24 15:35:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-24 15:35:06,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:35:06,016 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-24 15:35:06,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-24 15:35:06,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:35:06,220 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:35:06,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:35:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1843791696, now seen corresponding path program 1 times [2023-12-24 15:35:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:35:06,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4283124] [2023-12-24 15:35:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:35:06,221 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-24 15:35:06,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:35:06,222 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:35:06,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-24 15:35:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:35:06,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 15:35:06,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:35:07,999 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-24 15:35:08,000 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 1 case distinctions, treesize of input 61 treesize of output 45 [2023-12-24 15:35:08,028 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-24 15:35:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 23 proven. 933 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2023-12-24 15:35:08,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:35:08,276 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-12-24 15:35:08,277 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 21 treesize of output 20 [2023-12-24 15:35:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 66 proven. 69 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2023-12-24 15:35:08,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:35:08,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4283124] [2023-12-24 15:35:08,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4283124] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 15:35:08,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:35:08,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-24 15:35:08,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730611008] [2023-12-24 15:35:08,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:35:08,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 15:35:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:35:08,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 15:35:08,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-12-24 15:35:08,690 INFO L87 Difference]: Start difference. First operand 602 states and 741 transitions. Second operand has 17 states, 15 states have (on average 12.133333333333333) internal successors, (182), 16 states have internal predecessors, (182), 6 states have call successors, (54), 4 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) [2023-12-24 15:35:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:35:09,559 INFO L93 Difference]: Finished difference Result 1073 states and 1319 transitions. [2023-12-24 15:35:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 15:35:09,560 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 12.133333333333333) internal successors, (182), 16 states have internal predecessors, (182), 6 states have call successors, (54), 4 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) Word has length 243 [2023-12-24 15:35:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:35:09,562 INFO L225 Difference]: With dead ends: 1073 [2023-12-24 15:35:09,562 INFO L226 Difference]: Without dead ends: 565 [2023-12-24 15:35:09,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2023-12-24 15:35:09,564 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 178 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 15:35:09,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 523 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 15:35:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2023-12-24 15:35:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 552. [2023-12-24 15:35:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 490 states have (on average 1.1795918367346938) internal successors, (578), 493 states have internal predecessors, (578), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 15:35:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 670 transitions. [2023-12-24 15:35:09,615 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 670 transitions. Word has length 243 [2023-12-24 15:35:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:35:09,616 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 670 transitions. [2023-12-24 15:35:09,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 12.133333333333333) internal successors, (182), 16 states have internal predecessors, (182), 6 states have call successors, (54), 4 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) [2023-12-24 15:35:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 670 transitions. [2023-12-24 15:35:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-24 15:35:09,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:35:09,618 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-24 15:35:09,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-24 15:35:09,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:35:09,827 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:35:09,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:35:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1226951189, now seen corresponding path program 1 times [2023-12-24 15:35:09,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:35:09,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129960403] [2023-12-24 15:35:09,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:35:09,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:35:09,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:35:09,829 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:35:09,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-24 15:35:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:35:10,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 15:35:10,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:35:11,903 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-24 15:35:11,904 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 1 case distinctions, treesize of input 61 treesize of output 45 [2023-12-24 15:35:11,950 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-24 15:35:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 21 proven. 935 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2023-12-24 15:35:11,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:35:12,281 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-12-24 15:35:12,281 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 21 treesize of output 20 [2023-12-24 15:35:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 64 proven. 71 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2023-12-24 15:35:12,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:35:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129960403] [2023-12-24 15:35:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129960403] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 15:35:12,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:35:12,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-24 15:35:12,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837009390] [2023-12-24 15:35:12,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:35:12,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 15:35:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:35:12,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 15:35:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-12-24 15:35:12,751 INFO L87 Difference]: Start difference. First operand 552 states and 670 transitions. Second operand has 17 states, 15 states have (on average 12.533333333333333) internal successors, (188), 16 states have internal predecessors, (188), 6 states have call successors, (54), 4 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) [2023-12-24 15:35:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:35:13,795 INFO L93 Difference]: Finished difference Result 925 states and 1122 transitions. [2023-12-24 15:35:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 15:35:13,796 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 12.533333333333333) internal successors, (188), 16 states have internal predecessors, (188), 6 states have call successors, (54), 4 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) Word has length 245 [2023-12-24 15:35:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:35:13,798 INFO L225 Difference]: With dead ends: 925 [2023-12-24 15:35:13,799 INFO L226 Difference]: Without dead ends: 467 [2023-12-24 15:35:13,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2023-12-24 15:35:13,800 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 144 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 15:35:13,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 542 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 15:35:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-12-24 15:35:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 454. [2023-12-24 15:35:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 392 states have (on average 1.153061224489796) internal successors, (452), 395 states have internal predecessors, (452), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 15:35:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 544 transitions. [2023-12-24 15:35:13,850 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 544 transitions. Word has length 245 [2023-12-24 15:35:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:35:13,851 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 544 transitions. [2023-12-24 15:35:13,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 12.533333333333333) internal successors, (188), 16 states have internal predecessors, (188), 6 states have call successors, (54), 4 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) [2023-12-24 15:35:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 544 transitions. [2023-12-24 15:35:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-24 15:35:13,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:35:13,853 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-24 15:35:13,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-24 15:35:14,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:35:14,063 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:35:14,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:35:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1638753371, now seen corresponding path program 1 times [2023-12-24 15:35:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:35:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789342559] [2023-12-24 15:35:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:35:14,064 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-24 15:35:14,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:35:14,065 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:35:14,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-24 15:35:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:35:14,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 15:35:14,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:35:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2023-12-24 15:35:14,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:35:14,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:35:14,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789342559] [2023-12-24 15:35:14,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789342559] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:35:14,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:35:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 15:35:14,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090672123] [2023-12-24 15:35:14,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:35:14,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 15:35:14,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:35:14,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 15:35:14,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 15:35:14,459 INFO L87 Difference]: Start difference. First operand 454 states and 544 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:35:14,524 INFO L93 Difference]: Finished difference Result 817 states and 986 transitions. [2023-12-24 15:35:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 15:35:14,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 247 [2023-12-24 15:35:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:35:14,527 INFO L225 Difference]: With dead ends: 817 [2023-12-24 15:35:14,527 INFO L226 Difference]: Without dead ends: 457 [2023-12-24 15:35:14,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 245 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-24 15:35:14,528 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:35:14,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:35:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-12-24 15:35:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2023-12-24 15:35:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 395 states have (on average 1.1518987341772151) internal successors, (455), 398 states have internal predecessors, (455), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 15:35:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 547 transitions. [2023-12-24 15:35:14,577 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 547 transitions. Word has length 247 [2023-12-24 15:35:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:35:14,578 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 547 transitions. [2023-12-24 15:35:14,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 547 transitions. [2023-12-24 15:35:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-24 15:35:14,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:35:14,580 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-24 15:35:14,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-24 15:35:14,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:35:14,788 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:35:14,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:35:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1051947357, now seen corresponding path program 1 times [2023-12-24 15:35:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:35:14,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373805502] [2023-12-24 15:35:14,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:35:14,790 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-24 15:35:14,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:35:14,791 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:35:14,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-24 15:35:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:35:15,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 15:35:15,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:35:17,090 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 35 treesize of output 28 [2023-12-24 15:35:17,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:35:17,356 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 43 treesize of output 19 [2023-12-24 15:35:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 230 proven. 952 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2023-12-24 15:35:17,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:35:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1776 trivial. 0 not checked. [2023-12-24 15:35:18,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:35:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373805502] [2023-12-24 15:35:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373805502] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:35:18,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:35:18,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2023-12-24 15:35:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87450021] [2023-12-24 15:35:18,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:35:18,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 15:35:18,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:35:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 15:35:18,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 15:35:18,007 INFO L87 Difference]: Start difference. First operand 457 states and 547 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:35:18,064 INFO L93 Difference]: Finished difference Result 609 states and 720 transitions. [2023-12-24 15:35:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 15:35:18,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 247 [2023-12-24 15:35:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:35:18,065 INFO L225 Difference]: With dead ends: 609 [2023-12-24 15:35:18,065 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 15:35:18,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 15:35:18,067 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 160 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.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:35:18,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 160 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:35:18,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 15:35:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 15:35:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 15:35:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 15:35:18,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2023-12-24 15:35:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:35:18,068 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 15:35:18,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 15:35:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 15:35:18,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 15:35:18,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 15:35:18,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-24 15:35:18,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:35:18,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 15:35:30,777 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 15:35:30,778 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 15:35:30,778 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 15:35:30,778 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 15:35:30,778 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 85) no Hoare annotation was computed. [2023-12-24 15:35:30,778 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 15:35:30,778 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 15:35:30,778 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 15:35:30,778 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| (_ bv4 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse0 (_ bv3 32)))) (= |ULTIMATE.start_updateVariables_#t~mem53#1| ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (_ bv3 32)))) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (_ bv1 32)))) (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32)) (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 15:35:30,778 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-24 15:35:30,779 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| (_ bv4 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse0 (_ bv3 32)))) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (_ bv3 32)))) (_ bv4294967295 32)) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (_ bv1 32)))) (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32)) (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 15:35:30,779 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-24 15:35:30,779 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-12-24 15:35:30,779 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 54 58) no Hoare annotation was computed. [2023-12-24 15:35:30,779 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 75) no Hoare annotation was computed. [2023-12-24 15:35:30,779 INFO L899 garLoopResultBuilder]: For program point L71-1(lines 71 75) no Hoare annotation was computed. [2023-12-24 15:35:30,780 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| (_ bv4 32)))) (let ((.cse0 (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse14 (_ bv3 32))))) (.cse1 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse5 (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse2 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse4 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (_ bv1 32)))) (_ bv0 32))) (.cse6 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32))) (.cse7 (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse8 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse9 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse10 (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (.cse11 (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) (.cse12 (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (.cse13 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (_ bv3 32)))))) (and .cse0 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) .cse1 .cse2 (bvsge .cse3 (_ bv4294967295 32)) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) .cse4 (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= (select .cse5 (_ bv2 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd .cse3 (_ bv4294967280 32))))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse12 .cse13)) (and .cse0 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) .cse1 (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select .cse5 (_ bv3 32)))) (_ bv4294967295 32)) .cse2 (not (= (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse4 .cse6 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) .cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2023-12-24 15:35:30,780 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-24 15:35:30,781 INFO L895 garLoopResultBuilder]: At program point L121-2(lines 121 127) the Hoare annotation is: (let ((.cse17 (select |#memory_int#1| (_ bv4 32)))) (let ((.cse0 (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse17 (_ bv3 32))))) (.cse1 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base)) (.cse2 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse4 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base)) (.cse6 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse17 (_ bv1 32)))) (_ bv0 32))) (.cse7 (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse3 (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse8 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32))) (.cse9 (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse10 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse11 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse12 (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (.cse13 (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) (.cse14 (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (.cse15 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select .cse3 (_ bv3 32)))) (_ bv4294967295 32)) .cse4 (not (= (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (_ bv3 32)))))) (and .cse0 .cse1 .cse2 .cse4 (bvsge .cse16 (_ bv4294967295 32)) .cse5 .cse6 .cse7 (= (select .cse3 (_ bv2 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd .cse16 (_ bv4294967280 32))))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse14 .cse15))))) [2023-12-24 15:35:30,781 INFO L899 garLoopResultBuilder]: For program point L121-3(lines 121 127) no Hoare annotation was computed. [2023-12-24 15:35:30,781 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| (_ bv4 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse0 (_ bv3 32)))) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (_ bv3 32)))) (_ bv4294967295 32)) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (_ bv1 32)))) (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32)) (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 15:35:30,781 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-24 15:35:30,781 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 74) no Hoare annotation was computed. [2023-12-24 15:35:30,782 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| (_ bv4 32)))) (let ((.cse0 (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse14 (_ bv3 32))))) (.cse1 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse5 (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse2 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse4 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (_ bv1 32)))) (_ bv0 32))) (.cse6 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32))) (.cse7 (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse8 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse9 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse10 (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (.cse11 (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) (.cse12 (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (.cse13 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (_ bv3 32)))))) (and .cse0 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) .cse1 .cse2 (bvsge .cse3 (_ bv4294967295 32)) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) .cse4 (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= (select .cse5 (_ bv2 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd .cse3 (_ bv4294967280 32))))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse12 .cse13)) (and .cse0 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) .cse1 (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select .cse5 (_ bv3 32)))) (_ bv4294967295 32)) .cse2 (not (= (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse4 .cse6 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) .cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2023-12-24 15:35:30,782 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-24 15:35:30,782 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| (_ bv4 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse0 (_ bv3 32)))) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (_ bv3 32)))) (_ bv4294967295 32)) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (_ bv1 32)))) (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32)) (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 15:35:30,782 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-24 15:35:30,782 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-24 15:35:30,782 INFO L899 garLoopResultBuilder]: For program point L73-2(line 73) no Hoare annotation was computed. [2023-12-24 15:35:30,782 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 15:35:30,782 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse0 (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select (select |#memory_int#1| (_ bv4 32)) (_ bv3 32))))) (.cse1 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base)) (.cse2 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse4 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base)) (.cse6 (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse3 (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32))) (.cse8 (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse9 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse10 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse11 (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (.cse12 (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) (.cse13 (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (.cse14 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select .cse3 (_ bv3 32)))) (_ bv4294967295 32)) .cse4 (not (= (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (_ bv3 32)))))) (and .cse0 .cse1 .cse2 .cse4 (bvsge .cse15 (_ bv4294967295 32)) .cse5 .cse6 (= (select .cse3 (_ bv2 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd .cse15 (_ bv4294967280 32))))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse13 .cse14)))) [2023-12-24 15:35:30,782 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-24 15:35:30,783 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| (_ bv4 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse0 (_ bv3 32)))) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (_ bv3 32)))) (_ bv4294967295 32)) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (_ bv1 32)))) (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32)) (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 15:35:30,783 INFO L899 garLoopResultBuilder]: For program point L108-1(line 108) no Hoare annotation was computed. [2023-12-24 15:35:30,783 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse17 (select |#memory_int#1| (_ bv4 32)))) (let ((.cse0 (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse17 (_ bv3 32))))) (.cse1 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base)) (.cse2 (= ((_ extract 7 0) (select .cse17 (_ bv1 32))) |ULTIMATE.start_updateVariables_#t~mem37#1|)) (.cse3 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse8 (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse4 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse6 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base)) (.cse7 (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32))) (.cse10 (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse11 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse12 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse13 (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (.cse14 (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) (.cse15 (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (.cse16 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse5 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (_ bv3 32)))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (bvsge .cse5 (_ bv4294967295 32)) .cse6 .cse7 (= (select .cse8 (_ bv2 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv4294967280 32))))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse15 .cse16)) (and .cse0 .cse1 .cse2 .cse3 (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select .cse8 (_ bv3 32)))) (_ bv4294967295 32)) .cse4 (not (= (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2023-12-24 15:35:30,783 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-24 15:35:30,783 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2023-12-24 15:35:30,783 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| (_ bv4 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse0 (_ bv3 32)))) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (_ bv3 32)))) (_ bv4294967295 32)) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (_ bv1 32)))) (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32)) (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 15:35:30,783 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-12-24 15:35:30,783 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 84) no Hoare annotation was computed. [2023-12-24 15:35:30,783 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-12-24 15:35:30,783 INFO L899 garLoopResultBuilder]: For program point L60-2(line 60) no Hoare annotation was computed. [2023-12-24 15:35:30,783 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-24 15:35:30,783 INFO L899 garLoopResultBuilder]: For program point L77-2(lines 77 81) no Hoare annotation was computed. [2023-12-24 15:35:30,783 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L899 garLoopResultBuilder]: For program point L94-2(line 94) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L899 garLoopResultBuilder]: For program point L94-3(line 94) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L899 garLoopResultBuilder]: For program point L94-5(line 94) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L899 garLoopResultBuilder]: For program point L94-7(line 94) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L895 garLoopResultBuilder]: At program point L94-8(line 94) the Hoare annotation is: (let ((.cse18 (select |#memory_int#1| (_ bv4 32)))) (let ((.cse2 (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse18 (_ bv3 32))))) (.cse3 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base)) (.cse4 (= |~#signed_char_Array_0~0.offset| (_ bv0 32))) (.cse10 (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse7 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base)) (.cse8 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse18 (_ bv1 32)))) (_ bv0 32))) (.cse9 (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse0 (not |ULTIMATE.start_updateVariables_#t~short41#1|)) (.cse11 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32))) (.cse12 (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse13 (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse14 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32))) (.cse15 (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (.cse16 (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) (.cse17 (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (.cse1 (= currentRoundingMode roundNearestTiesToEven))) (or (and (not |ULTIMATE.start_updateVariables_#t~short44#1|) .cse0 .cse1 (not |ULTIMATE.start_updateVariables_#t~short45#1|)) (let ((.cse6 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (_ bv3 32)))))) (and .cse2 .cse3 .cse4 .cse5 (bvsge .cse6 (_ bv4294967295 32)) .cse7 .cse8 .cse9 .cse0 (= (select .cse10 (_ bv2 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd .cse6 (_ bv4294967280 32))))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse17 .cse1)) (and .cse2 .cse3 .cse4 (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select .cse10 (_ bv3 32)))) (_ bv4294967295 32)) .cse5 (not (= (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))))) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) .cse7 .cse8 .cse9 .cse0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse1)))) [2023-12-24 15:35:30,784 INFO L899 garLoopResultBuilder]: For program point L94-9(line 94) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L899 garLoopResultBuilder]: For program point L78-2(line 78) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| (_ bv4 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse0 (_ bv3 32)))) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (_ bv3 32)))) (_ bv4294967295 32)) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (_ bv1 32)))) (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32)) (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 15:35:30,784 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-24 15:35:30,784 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| (_ bv4 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse0 (_ bv3 32)))) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (_ bv3 32)))) (_ bv4294967295 32)) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (_ bv1 32)))) (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32)) (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 67) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 59 69) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115-2(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115-3(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115-4(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115-5(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115-6(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115-8(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115-10(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115-12(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115-14(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,785 INFO L899 garLoopResultBuilder]: For program point L115-15(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| (_ bv4 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse0 (_ bv3 32)))) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (_ bv3 32)))) (_ bv4294967295 32)) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (_ bv1 32)))) (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32)) (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-16(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-17(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-19(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-21(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-23(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-25(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-26(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-27(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-29(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-30(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-31(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-32(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-34(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,786 INFO L899 garLoopResultBuilder]: For program point L115-35(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,787 INFO L899 garLoopResultBuilder]: For program point L115-37(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,787 INFO L899 garLoopResultBuilder]: For program point L115-39(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,787 INFO L899 garLoopResultBuilder]: For program point L115-41(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,787 INFO L899 garLoopResultBuilder]: For program point L115-43(line 115) no Hoare annotation was computed. [2023-12-24 15:35:30,787 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| (_ bv4 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_20)) (select .cse0 (_ bv3 32)))) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) (= |~#signed_char_Array_0~0.offset| (_ bv0 32)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (_ bv3 32)))) (_ bv4294967295 32)) (= |~#signed_char_Array_0~0.base| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (_ bv1 32)))) (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset (_ bv1 32)) (= (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.base|) (= (_ bv4 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset (_ bv0 32)) (= (_ bv3 32) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv3 32) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (= (_ bv2 32) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 15:35:30,787 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-24 15:35:30,789 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 15:35:30,791 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 15:35:30,800 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_20 : bv32 :: ~sign_extend~32~8(v_arrayElimCell_20[7:0]) == #memory_int#1[4bv32][3bv32]) could not be translated [2023-12-24 15:35:30,804 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][3bv32] could not be translated [2023-12-24 15:35:30,804 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 15:35:30,805 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-24 15:35:30,805 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[4bv32][1bv32] could not be translated [2023-12-24 15:35:30,805 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 15:35:30,805 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_20 : bv32 :: ~sign_extend~32~8(v_arrayElimCell_20[7:0]) == #memory_int#1[4bv32][3bv32]) could not be translated [2023-12-24 15:35:30,805 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][3bv32] could not be translated [2023-12-24 15:35:30,806 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[4bv32][1bv32] could not be translated [2023-12-24 15:35:30,806 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][2bv32] could not be translated [2023-12-24 15:35:30,806 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][3bv32] could not be translated [2023-12-24 15:35:30,806 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 15:35:30,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 03:35:30 BoogieIcfgContainer [2023-12-24 15:35:30,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 15:35:30,808 INFO L158 Benchmark]: Toolchain (without parser) took 62874.36ms. Allocated memory was 210.8MB in the beginning and 755.0MB in the end (delta: 544.2MB). Free memory was 168.6MB in the beginning and 317.6MB in the end (delta: -149.1MB). Peak memory consumption was 445.4MB. Max. memory is 8.0GB. [2023-12-24 15:35:30,808 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 210.8MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 15:35:30,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.56ms. Allocated memory is still 210.8MB. Free memory was 168.2MB in the beginning and 152.4MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-24 15:35:30,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.93ms. Allocated memory is still 210.8MB. Free memory was 152.4MB in the beginning and 149.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 15:35:30,808 INFO L158 Benchmark]: Boogie Preprocessor took 113.92ms. Allocated memory is still 210.8MB. Free memory was 149.3MB in the beginning and 144.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 15:35:30,808 INFO L158 Benchmark]: RCFGBuilder took 1341.41ms. Allocated memory is still 210.8MB. Free memory was 144.0MB in the beginning and 175.5MB in the end (delta: -31.4MB). Peak memory consumption was 44.4MB. Max. memory is 8.0GB. [2023-12-24 15:35:30,809 INFO L158 Benchmark]: TraceAbstraction took 61070.05ms. Allocated memory was 210.8MB in the beginning and 755.0MB in the end (delta: 544.2MB). Free memory was 175.0MB in the beginning and 317.6MB in the end (delta: -142.7MB). Peak memory consumption was 451.3MB. Max. memory is 8.0GB. [2023-12-24 15:35:30,809 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.58ms. Allocated memory is still 210.8MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.56ms. Allocated memory is still 210.8MB. Free memory was 168.2MB in the beginning and 152.4MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.93ms. Allocated memory is still 210.8MB. Free memory was 152.4MB in the beginning and 149.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 113.92ms. Allocated memory is still 210.8MB. Free memory was 149.3MB in the beginning and 144.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1341.41ms. Allocated memory is still 210.8MB. Free memory was 144.0MB in the beginning and 175.5MB in the end (delta: -31.4MB). Peak memory consumption was 44.4MB. Max. memory is 8.0GB. * TraceAbstraction took 61070.05ms. Allocated memory was 210.8MB in the beginning and 755.0MB in the end (delta: 544.2MB). Free memory was 175.0MB in the beginning and 317.6MB in the end (delta: -142.7MB). Peak memory consumption was 451.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_20 : bv32 :: ~sign_extend~32~8(v_arrayElimCell_20[7:0]) == #memory_int#1[4bv32][3bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[4bv32][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_20 : bv32 :: ~sign_extend~32~8(v_arrayElimCell_20[7:0]) == #memory_int#1[4bv32][3bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[4bv32][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.0s, OverallIterations: 22, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3291 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3290 mSDsluCounter, 10429 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7831 mSDsCounter, 429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3991 IncrementalHoareTripleChecker+Invalid, 4420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 429 mSolverCounterUnsat, 2598 mSDtfsCounter, 3991 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4823 GetRequests, 4501 SyntacticMatches, 25 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=605occurred in iteration=16, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 1218 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 654 PreInvPairs, 700 NumberOfFragments, 1752 HoareAnnotationTreeSize, 654 FormulaSimplifications, 124203 FormulaSimplificationTreeSizeReduction, 5.6s HoareSimplificationTime, 17 FormulaSimplificationsInter, 48870 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 3419 NumberOfCodeBlocks, 3419 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4630 ConstructedInterpolants, 234 QuantifiedInterpolants, 39501 SizeOfPredicates, 209 NumberOfNonLiveVariables, 7703 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 18457/22645 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((null & 127) >= -1) && ((null & 127) <= 0)) || (((null & 127) >= -1) && ((null & 127) <= 0))) RESULT: Ultimate proved your program to be correct! [2023-12-24 15:35:30,834 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 0 Received shutdown request...