/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 02:50:56,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 02:50:56,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-06 02:50:56,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 02:50:56,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 02:50:56,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 02:50:56,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 02:50:56,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 02:50:56,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 02:50:56,910 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 02:50:56,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 02:50:56,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 02:50:56,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 02:50:56,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 02:50:56,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 02:50:56,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 02:50:56,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 02:50:56,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 02:50:56,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 02:50:56,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 02:50:56,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 02:50:56,914 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 02:50:56,914 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 02:50:56,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 02:50:56,914 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 02:50:56,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 02:50:56,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 02:50:56,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 02:50:56,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 02:50:56,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 02:50:56,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 02:50:56,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 02:50:56,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 02:50:56,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 02:50:56,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 02:50:56,917 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 02:50:56,921 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 02:50:56,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 02:50:56,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 02:50:56,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 02:50:56,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 02:50:56,923 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 02:50:57,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 02:50:57,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 02:50:57,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 02:50:57,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 02:50:57,154 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 02:50:57,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-11-06 02:50:58,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 02:50:58,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 02:50:58,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-11-06 02:50:58,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42e9925bc/405771c935f244f899684593dce3caa9/FLAG215b8a38b [2024-11-06 02:50:58,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42e9925bc/405771c935f244f899684593dce3caa9 [2024-11-06 02:50:58,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 02:50:58,809 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 02:50:58,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 02:50:58,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 02:50:58,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 02:50:58,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:50:58" (1/1) ... [2024-11-06 02:50:58,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b97486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:58, skipping insertion in model container [2024-11-06 02:50:58,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:50:58" (1/1) ... [2024-11-06 02:50:58,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 02:50:59,433 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,442 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,465 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,467 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,468 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,469 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,475 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,477 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,479 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,486 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2024-11-06 02:50:59,671 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 02:50:59,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 02:50:59,710 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 02:50:59,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2024-11-06 02:50:59,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 02:50:59,910 INFO L204 MainTranslator]: Completed translation [2024-11-06 02:50:59,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59 WrapperNode [2024-11-06 02:50:59,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 02:50:59,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 02:50:59,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 02:50:59,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 02:50:59,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:50:59,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,024 INFO L138 Inliner]: procedures = 106, calls = 348, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 771 [2024-11-06 02:51:00,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 02:51:00,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 02:51:00,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 02:51:00,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 02:51:00,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,114 INFO L175 MemorySlicer]: Split 228 memory accesses to 6 slices as follows [2, 103, 14, 12, 65, 32]. 45 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0, 0, 0]. The 204 writes are split as follows [0, 93, 2, 12, 65, 32]. [2024-11-06 02:51:00,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 02:51:00,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 02:51:00,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 02:51:00,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 02:51:00,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (1/1) ... [2024-11-06 02:51:00,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 02:51:00,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 02:51:00,212 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) [2024-11-06 02:51:00,214 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 [2024-11-06 02:51:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2024-11-06 02:51:00,237 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2024-11-06 02:51:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-06 02:51:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-06 02:51:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-06 02:51:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-06 02:51:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-06 02:51:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-06 02:51:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-06 02:51:00,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-06 02:51:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-11-06 02:51:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-11-06 02:51:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-06 02:51:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-06 02:51:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2024-11-06 02:51:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2024-11-06 02:51:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-06 02:51:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-06 02:51:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#2 [2024-11-06 02:51:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#3 [2024-11-06 02:51:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#4 [2024-11-06 02:51:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#5 [2024-11-06 02:51:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-06 02:51:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-06 02:51:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#2 [2024-11-06 02:51:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#3 [2024-11-06 02:51:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#4 [2024-11-06 02:51:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#5 [2024-11-06 02:51:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8#0 [2024-11-06 02:51:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8#1 [2024-11-06 02:51:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8#2 [2024-11-06 02:51:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8#3 [2024-11-06 02:51:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8#4 [2024-11-06 02:51:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8#5 [2024-11-06 02:51:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 02:51:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-06 02:51:00,240 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-06 02:51:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 02:51:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 02:51:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 02:51:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 02:51:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-06 02:51:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-06 02:51:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-06 02:51:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 02:51:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 02:51:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 02:51:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 02:51:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-06 02:51:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-06 02:51:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-06 02:51:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-06 02:51:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-06 02:51:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-06 02:51:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-06 02:51:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-06 02:51:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-06 02:51:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2024-11-06 02:51:00,243 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2024-11-06 02:51:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 02:51:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-06 02:51:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-06 02:51:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-06 02:51:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-06 02:51:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-06 02:51:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-06 02:51:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-11-06 02:51:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-11-06 02:51:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 02:51:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 02:51:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 02:51:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-06 02:51:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-06 02:51:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-06 02:51:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-11-06 02:51:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-11-06 02:51:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-11-06 02:51:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-11-06 02:51:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 02:51:00,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 02:51:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-11-06 02:51:00,245 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-11-06 02:51:00,500 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 02:51:00,502 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 02:51:11,150 INFO L? ?]: Removed 264 outVars from TransFormulas that were not future-live. [2024-11-06 02:51:11,151 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 02:51:11,166 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 02:51:11,167 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-06 02:51:11,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:51:11 BoogieIcfgContainer [2024-11-06 02:51:11,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 02:51:11,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 02:51:11,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 02:51:11,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 02:51:11,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 02:50:58" (1/3) ... [2024-11-06 02:51:11,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd43ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:51:11, skipping insertion in model container [2024-11-06 02:51:11,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:50:59" (2/3) ... [2024-11-06 02:51:11,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd43ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:51:11, skipping insertion in model container [2024-11-06 02:51:11,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:51:11" (3/3) ... [2024-11-06 02:51:11,178 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-11-06 02:51:11,193 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 02:51:11,194 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 02:51:11,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 02:51:11,269 INFO L333 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, 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;@e4252aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 02:51:11,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 02:51:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 148 states have internal predecessors, (192), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-06 02:51:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 02:51:11,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 02:51:11,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 02:51:11,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 02:51:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 02:51:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1457130019, now seen corresponding path program 1 times [2024-11-06 02:51:11,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 02:51:11,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686824576] [2024-11-06 02:51:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 02:51:11,306 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 [2024-11-06 02:51:11,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 02:51:11,308 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) [2024-11-06 02:51:11,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 02:51:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 02:51:14,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 02:51:14,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 02:51:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 02:51:14,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 02:51:14,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 02:51:14,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686824576] [2024-11-06 02:51:14,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686824576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 02:51:14,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 02:51:14,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 02:51:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146197660] [2024-11-06 02:51:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 02:51:14,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 02:51:14,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 02:51:14,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 02:51:14,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:51:14,911 INFO L87 Difference]: Start difference. First operand has 182 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 148 states have internal predecessors, (192), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:51:19,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-06 02:51:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 02:51:20,641 INFO L93 Difference]: Finished difference Result 518 states and 736 transitions. [2024-11-06 02:51:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 02:51:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-06 02:51:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 02:51:20,654 INFO L225 Difference]: With dead ends: 518 [2024-11-06 02:51:20,654 INFO L226 Difference]: Without dead ends: 335 [2024-11-06 02:51:20,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:51:20,659 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 210 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-06 02:51:20,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 468 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-06 02:51:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-06 02:51:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2024-11-06 02:51:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 258 states have (on average 1.3527131782945736) internal successors, (349), 265 states have internal predecessors, (349), 52 states have call successors, (52), 21 states have call predecessors, (52), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-06 02:51:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 447 transitions. [2024-11-06 02:51:20,714 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 447 transitions. Word has length 15 [2024-11-06 02:51:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 02:51:20,715 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 447 transitions. [2024-11-06 02:51:20,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:51:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 447 transitions. [2024-11-06 02:51:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 02:51:20,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 02:51:20,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 02:51:20,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-06 02:51:20,917 WARN L453 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 [2024-11-06 02:51:20,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 02:51:20,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 02:51:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1586811989, now seen corresponding path program 1 times [2024-11-06 02:51:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 02:51:20,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018382717] [2024-11-06 02:51:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 02:51:20,919 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 [2024-11-06 02:51:20,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 02:51:20,922 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) [2024-11-06 02:51:20,923 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 [2024-11-06 02:51:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 02:51:23,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 02:51:23,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 02:51:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 02:51:23,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 02:51:23,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 02:51:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018382717] [2024-11-06 02:51:23,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018382717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 02:51:23,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 02:51:23,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 02:51:23,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804516744] [2024-11-06 02:51:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 02:51:23,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 02:51:23,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 02:51:23,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 02:51:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:51:23,908 INFO L87 Difference]: Start difference. First operand 331 states and 447 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:51:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 02:51:24,255 INFO L93 Difference]: Finished difference Result 353 states and 473 transitions. [2024-11-06 02:51:24,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 02:51:24,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-06 02:51:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 02:51:24,259 INFO L225 Difference]: With dead ends: 353 [2024-11-06 02:51:24,259 INFO L226 Difference]: Without dead ends: 342 [2024-11-06 02:51:24,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:51:24,263 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 232 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 02:51:24,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 262 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 02:51:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-06 02:51:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 331. [2024-11-06 02:51:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 258 states have (on average 1.3488372093023255) internal successors, (348), 265 states have internal predecessors, (348), 52 states have call successors, (52), 21 states have call predecessors, (52), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-06 02:51:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 446 transitions. [2024-11-06 02:51:24,303 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 446 transitions. Word has length 18 [2024-11-06 02:51:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 02:51:24,303 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 446 transitions. [2024-11-06 02:51:24,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:51:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 446 transitions. [2024-11-06 02:51:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 02:51:24,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 02:51:24,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 02:51:24,333 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 [2024-11-06 02:51:24,505 WARN L453 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 [2024-11-06 02:51:24,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 02:51:24,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 02:51:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1644070291, now seen corresponding path program 1 times [2024-11-06 02:51:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 02:51:24,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058580066] [2024-11-06 02:51:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 02:51:24,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 02:51:24,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 02:51:24,510 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) [2024-11-06 02:51:24,511 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 [2024-11-06 02:51:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 02:51:27,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 02:51:27,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 02:51:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 02:51:29,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 02:51:29,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 02:51:29,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058580066] [2024-11-06 02:51:29,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058580066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 02:51:29,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 02:51:29,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 02:51:29,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253785471] [2024-11-06 02:51:29,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 02:51:29,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 02:51:29,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 02:51:29,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 02:51:29,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:51:29,303 INFO L87 Difference]: Start difference. First operand 331 states and 446 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:51:33,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-06 02:51:34,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 02:51:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 02:51:34,755 INFO L93 Difference]: Finished difference Result 333 states and 447 transitions. [2024-11-06 02:51:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 02:51:34,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-06 02:51:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 02:51:34,759 INFO L225 Difference]: With dead ends: 333 [2024-11-06 02:51:34,759 INFO L226 Difference]: Without dead ends: 330 [2024-11-06 02:51:34,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:51:34,760 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 220 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-06 02:51:34,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-11-06 02:51:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-06 02:51:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2024-11-06 02:51:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 258 states have (on average 1.3449612403100775) internal successors, (347), 264 states have internal predecessors, (347), 51 states have call successors, (51), 21 states have call predecessors, (51), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-06 02:51:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 444 transitions. [2024-11-06 02:51:34,787 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 444 transitions. Word has length 18 [2024-11-06 02:51:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 02:51:34,788 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 444 transitions. [2024-11-06 02:51:34,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:51:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 444 transitions. [2024-11-06 02:51:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 02:51:34,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 02:51:34,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 02:51:34,821 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 [2024-11-06 02:51:34,991 WARN L453 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 [2024-11-06 02:51:34,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 02:51:34,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 02:51:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash -573546637, now seen corresponding path program 1 times [2024-11-06 02:51:34,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 02:51:34,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326551572] [2024-11-06 02:51:34,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 02:51:34,993 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 [2024-11-06 02:51:34,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 02:51:34,996 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) [2024-11-06 02:51:34,997 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 [2024-11-06 02:51:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 02:51:37,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 02:51:37,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 02:51:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 02:51:40,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 02:51:40,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 02:51:40,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326551572] [2024-11-06 02:51:40,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326551572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 02:51:40,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 02:51:40,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 02:51:40,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395821934] [2024-11-06 02:51:40,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 02:51:40,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 02:51:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 02:51:40,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 02:51:40,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:51:40,671 INFO L87 Difference]: Start difference. First operand 330 states and 444 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:51:44,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-06 02:51:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 02:51:44,919 INFO L93 Difference]: Finished difference Result 332 states and 445 transitions. [2024-11-06 02:51:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 02:51:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-06 02:51:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 02:51:44,921 INFO L225 Difference]: With dead ends: 332 [2024-11-06 02:51:44,921 INFO L226 Difference]: Without dead ends: 329 [2024-11-06 02:51:44,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:51:44,922 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-06 02:51:44,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 232 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-06 02:51:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-06 02:51:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2024-11-06 02:51:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 258 states have (on average 1.3410852713178294) internal successors, (346), 263 states have internal predecessors, (346), 50 states have call successors, (50), 21 states have call predecessors, (50), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-06 02:51:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 442 transitions. [2024-11-06 02:51:44,958 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 442 transitions. Word has length 19 [2024-11-06 02:51:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 02:51:44,958 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 442 transitions. [2024-11-06 02:51:44,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:51:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 442 transitions. [2024-11-06 02:51:44,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-06 02:51:44,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 02:51:44,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 02:51:44,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 02:51:45,160 WARN L453 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 [2024-11-06 02:51:45,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 02:51:45,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 02:51:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash -600189802, now seen corresponding path program 1 times [2024-11-06 02:51:45,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 02:51:45,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039693608] [2024-11-06 02:51:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 02:51:45,162 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 [2024-11-06 02:51:45,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 02:51:45,163 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) [2024-11-06 02:51:45,164 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 [2024-11-06 02:51:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 02:51:47,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 02:51:47,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 02:51:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 02:51:51,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 02:51:51,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 02:51:51,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039693608] [2024-11-06 02:51:51,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039693608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 02:51:51,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 02:51:51,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 02:51:51,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990959066] [2024-11-06 02:51:51,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 02:51:51,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 02:51:51,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 02:51:51,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 02:51:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:51:51,973 INFO L87 Difference]: Start difference. First operand 329 states and 442 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:51:56,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-06 02:51:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 02:51:57,468 INFO L93 Difference]: Finished difference Result 339 states and 448 transitions. [2024-11-06 02:51:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 02:51:57,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-06 02:51:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 02:51:57,471 INFO L225 Difference]: With dead ends: 339 [2024-11-06 02:51:57,472 INFO L226 Difference]: Without dead ends: 335 [2024-11-06 02:51:57,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:51:57,474 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 179 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-06 02:51:57,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 261 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2024-11-06 02:51:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-06 02:51:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2024-11-06 02:51:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 265 states have internal predecessors, (347), 48 states have call successors, (48), 23 states have call predecessors, (48), 22 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-06 02:51:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 441 transitions. [2024-11-06 02:51:57,498 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 441 transitions. Word has length 20 [2024-11-06 02:51:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 02:51:57,498 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 441 transitions. [2024-11-06 02:51:57,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:51:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 441 transitions. [2024-11-06 02:51:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-06 02:51:57,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 02:51:57,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 02:51:57,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-06 02:51:57,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 02:51:57,702 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 02:51:57,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 02:51:57,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1426123050, now seen corresponding path program 1 times [2024-11-06 02:51:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 02:51:57,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19743322] [2024-11-06 02:51:57,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 02:51:57,704 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 [2024-11-06 02:51:57,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 02:51:57,705 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 02:51:57,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 02:52:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 02:52:00,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 02:52:00,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 02:52:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 02:52:05,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 02:52:05,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 02:52:05,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19743322] [2024-11-06 02:52:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19743322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 02:52:05,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 02:52:05,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 02:52:05,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020416614] [2024-11-06 02:52:05,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 02:52:05,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 02:52:05,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 02:52:05,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 02:52:05,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:52:05,507 INFO L87 Difference]: Start difference. First operand 333 states and 441 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:52:09,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-06 02:52:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 02:52:09,604 INFO L93 Difference]: Finished difference Result 335 states and 442 transitions. [2024-11-06 02:52:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 02:52:09,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-06 02:52:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 02:52:09,831 INFO L225 Difference]: With dead ends: 335 [2024-11-06 02:52:09,831 INFO L226 Difference]: Without dead ends: 325 [2024-11-06 02:52:09,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:52:09,832 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-06 02:52:09,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 227 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-06 02:52:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-06 02:52:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2024-11-06 02:52:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 255 states have (on average 1.3254901960784313) internal successors, (338), 257 states have internal predecessors, (338), 47 states have call successors, (47), 23 states have call predecessors, (47), 22 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-06 02:52:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 431 transitions. [2024-11-06 02:52:09,856 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 431 transitions. Word has length 21 [2024-11-06 02:52:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 02:52:09,857 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 431 transitions. [2024-11-06 02:52:09,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 02:52:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 431 transitions. [2024-11-06 02:52:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 02:52:09,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 02:52:09,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 02:52:09,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-06 02:52:10,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 02:52:10,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 02:52:10,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 02:52:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash -361933504, now seen corresponding path program 1 times [2024-11-06 02:52:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 02:52:10,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891374398] [2024-11-06 02:52:10,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 02:52:10,061 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 [2024-11-06 02:52:10,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 02:52:10,063 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) [2024-11-06 02:52:10,064 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 [2024-11-06 02:52:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 02:52:12,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 1326 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 02:52:12,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 02:52:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 02:52:14,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 02:52:14,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 02:52:14,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891374398] [2024-11-06 02:52:14,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891374398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 02:52:14,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 02:52:14,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 02:52:14,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421433825] [2024-11-06 02:52:14,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 02:52:14,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 02:52:14,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 02:52:14,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 02:52:14,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:52:14,845 INFO L87 Difference]: Start difference. First operand 325 states and 431 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 02:52:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 02:52:17,082 INFO L93 Difference]: Finished difference Result 835 states and 1114 transitions. [2024-11-06 02:52:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 02:52:17,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-06 02:52:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 02:52:17,085 INFO L225 Difference]: With dead ends: 835 [2024-11-06 02:52:17,085 INFO L226 Difference]: Without dead ends: 513 [2024-11-06 02:52:17,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:52:17,088 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 126 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 02:52:17,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 424 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 02:52:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-06 02:52:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2024-11-06 02:52:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 415 states have (on average 1.3373493975903614) internal successors, (555), 419 states have internal predecessors, (555), 65 states have call successors, (65), 33 states have call predecessors, (65), 32 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-06 02:52:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 684 transitions. [2024-11-06 02:52:17,111 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 684 transitions. Word has length 42 [2024-11-06 02:52:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 02:52:17,111 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 684 transitions. [2024-11-06 02:52:17,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 02:52:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 684 transitions. [2024-11-06 02:52:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-06 02:52:17,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 02:52:17,113 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 02:52:17,143 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 [2024-11-06 02:52:17,313 WARN L453 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 [2024-11-06 02:52:17,314 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 02:52:17,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 02:52:17,314 INFO L85 PathProgramCache]: Analyzing trace with hash 999253211, now seen corresponding path program 1 times [2024-11-06 02:52:17,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 02:52:17,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325546933] [2024-11-06 02:52:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 02:52:17,315 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 [2024-11-06 02:52:17,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 02:52:17,316 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) [2024-11-06 02:52:17,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-06 02:52:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 02:52:20,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 02:52:20,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 02:52:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 02:52:24,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 02:52:24,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 02:52:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325546933] [2024-11-06 02:52:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325546933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 02:52:24,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 02:52:24,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 02:52:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276785692] [2024-11-06 02:52:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 02:52:24,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 02:52:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 02:52:24,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 02:52:24,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:52:24,265 INFO L87 Difference]: Start difference. First operand 513 states and 684 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 02:52:28,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-06 02:52:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 02:52:29,814 INFO L93 Difference]: Finished difference Result 513 states and 684 transitions. [2024-11-06 02:52:29,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 02:52:29,814 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), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-06 02:52:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 02:52:29,817 INFO L225 Difference]: With dead ends: 513 [2024-11-06 02:52:29,817 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 02:52:29,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 02:52:29,818 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 19 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-06 02:52:29,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 397 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2024-11-06 02:52:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 02:52:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 02:52:29,819 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) [2024-11-06 02:52:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 02:52:29,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2024-11-06 02:52:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 02:52:29,819 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 02:52:29,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 02:52:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 02:52:29,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 02:52:29,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 02:52:29,863 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 [2024-11-06 02:52:30,026 WARN L453 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 [2024-11-06 02:52:30,029 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 02:52:30,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.