/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 15:19:21,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 15:19:21,375 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-01 15:19:21,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 15:19:21,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 15:19:21,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 15:19:21,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 15:19:21,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 15:19:21,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 15:19:21,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 15:19:21,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 15:19:21,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 15:19:21,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 15:19:21,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 15:19:21,416 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 15:19:21,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 15:19:21,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 15:19:21,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 15:19:21,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 15:19:21,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 15:19:21,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 15:19:21,420 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 15:19:21,420 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 15:19:21,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 15:19:21,421 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 15:19:21,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 15:19:21,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 15:19:21,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 15:19:21,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 15:19:21,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 15:19:21,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 15:19:21,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 15:19:21,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 15:19:21,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 15:19:21,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 15:19:21,423 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 15:19:21,423 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 15:19:21,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 15:19:21,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 15:19:21,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 15:19:21,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 15:19:21,427 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 15:19:21,427 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -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-01 15:19:21,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 15:19:21,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 15:19:21,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 15:19:21,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 15:19:21,691 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 15:19:21,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2024-11-01 15:19:22,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 15:19:23,154 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 15:19:23,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2024-11-01 15:19:23,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d3c927d/57117c9f02e646f7b4bb6f1a22617418/FLAGf67bb9df3 [2024-11-01 15:19:23,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d3c927d/57117c9f02e646f7b4bb6f1a22617418 [2024-11-01 15:19:23,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 15:19:23,439 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 15:19:23,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 15:19:23,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 15:19:23,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 15:19:23,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 03:19:23" (1/1) ... [2024-11-01 15:19:23,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3841205e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:23, skipping insertion in model container [2024-11-01 15:19:23,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 03:19:23" (1/1) ... [2024-11-01 15:19:23,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 15:19:24,135 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-01 15:19:24,135 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-01 15:19:24,136 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-01 15:19:24,137 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-01 15:19:24,144 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2024-11-01 15:19:24,178 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-01 15:19:24,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 15:19:24,203 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 15:19:24,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6057] [2024-11-01 15:19:24,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6060] [2024-11-01 15:19:24,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6063] [2024-11-01 15:19:24,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6066] [2024-11-01 15:19:24,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6069] [2024-11-01 15:19:24,398 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2024-11-01 15:19:24,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 15:19:24,439 INFO L204 MainTranslator]: Completed translation [2024-11-01 15:19:24,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24 WrapperNode [2024-11-01 15:19:24,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 15:19:24,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 15:19:24,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 15:19:24,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 15:19:24,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,506 INFO L138 Inliner]: procedures = 72, calls = 171, calls flagged for inlining = 23, calls inlined = 16, statements flattened = 353 [2024-11-01 15:19:24,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 15:19:24,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 15:19:24,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 15:19:24,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 15:19:24,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,555 INFO L175 MemorySlicer]: Split 100 memory accesses to 7 slices as follows [2, 9, 78, 1, 3, 3, 4]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 4, 0, 0, 0, 3, 0]. The 81 writes are split as follows [0, 0, 78, 1, 0, 0, 2]. [2024-11-01 15:19:24,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 15:19:24,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 15:19:24,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 15:19:24,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 15:19:24,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (1/1) ... [2024-11-01 15:19:24,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 15:19:24,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 15:19:24,633 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-01 15:19:24,635 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-01 15:19:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 15:19:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-01 15:19:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-01 15:19:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-01 15:19:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-01 15:19:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-01 15:19:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-01 15:19:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-01 15:19:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-01 15:19:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-01 15:19:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-01 15:19:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-01 15:19:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-01 15:19:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-01 15:19:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-01 15:19:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-01 15:19:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-01 15:19:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-01 15:19:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-01 15:19:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-01 15:19:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2024-11-01 15:19:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2024-11-01 15:19:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-01 15:19:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-01 15:19:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-01 15:19:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-01 15:19:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-01 15:19:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-01 15:19:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-01 15:19:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-01 15:19:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-01 15:19:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-01 15:19:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-01 15:19:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-01 15:19:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-01 15:19:24,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-01 15:19:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-01 15:19:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-01 15:19:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#2 [2024-11-01 15:19:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#3 [2024-11-01 15:19:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#4 [2024-11-01 15:19:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#5 [2024-11-01 15:19:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#6 [2024-11-01 15:19:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2024-11-01 15:19:24,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2024-11-01 15:19:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-01 15:19:24,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-01 15:19:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-01 15:19:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 15:19:24,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 15:19:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2024-11-01 15:19:24,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2024-11-01 15:19:24,904 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 15:19:24,906 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 15:19:24,924 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-01 15:19:33,629 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-01 15:19:33,630 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 15:19:33,638 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 15:19:33,639 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-01 15:19:33,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 03:19:33 BoogieIcfgContainer [2024-11-01 15:19:33,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 15:19:33,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 15:19:33,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 15:19:33,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 15:19:33,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 03:19:23" (1/3) ... [2024-11-01 15:19:33,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17eb21a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 03:19:33, skipping insertion in model container [2024-11-01 15:19:33,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 03:19:24" (2/3) ... [2024-11-01 15:19:33,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17eb21a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 03:19:33, skipping insertion in model container [2024-11-01 15:19:33,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 03:19:33" (3/3) ... [2024-11-01 15:19:33,644 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2024-11-01 15:19:33,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 15:19:33,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 15:19:33,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 15:19:33,699 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;@6abab69a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 15:19:33,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 15:19:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 78 states have internal predecessors, (100), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-01 15:19:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-01 15:19:33,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 15:19:33,710 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 15:19:33,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 15:19:33,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 15:19:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1136517471, now seen corresponding path program 1 times [2024-11-01 15:19:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 15:19:33,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1149613847] [2024-11-01 15:19:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 15:19:33,724 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-01 15:19:33,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 15:19:33,727 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-01 15:19:33,728 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-01 15:19:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 15:19:34,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-01 15:19:34,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 15:19:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-01 15:19:34,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 15:19:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-01 15:19:36,481 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 15:19:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1149613847] [2024-11-01 15:19:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1149613847] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 15:19:36,482 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 15:19:36,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-01 15:19:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957789821] [2024-11-01 15:19:36,485 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 15:19:36,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-01 15:19:36,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 15:19:36,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-01 15:19:36,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-01 15:19:36,505 INFO L87 Difference]: Start difference. First operand has 92 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 78 states have internal predecessors, (100), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-01 15:19:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 15:19:36,526 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2024-11-01 15:19:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-01 15:19:36,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2024-11-01 15:19:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 15:19:36,533 INFO L225 Difference]: With dead ends: 179 [2024-11-01 15:19:36,533 INFO L226 Difference]: Without dead ends: 82 [2024-11-01 15:19:36,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-01 15:19:36,538 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-01 15:19:36,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 15:19:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-01 15:19:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-01 15:19:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.328358208955224) internal successors, (89), 68 states have internal predecessors, (89), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-01 15:19:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2024-11-01 15:19:36,566 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 61 [2024-11-01 15:19:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 15:19:36,567 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2024-11-01 15:19:36,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-01 15:19:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2024-11-01 15:19:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-01 15:19:36,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 15:19:36,570 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 15:19:36,593 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-01 15:19:36,770 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-01 15:19:36,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 15:19:36,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 15:19:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash 433386269, now seen corresponding path program 1 times [2024-11-01 15:19:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 15:19:36,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [686658324] [2024-11-01 15:19:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 15:19:36,773 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-01 15:19:36,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 15:19:36,774 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-01 15:19:36,775 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-01 15:19:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 15:19:37,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-01 15:19:37,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 15:19:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-01 15:19:38,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 15:19:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-01 15:19:42,606 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 15:19:42,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [686658324] [2024-11-01 15:19:42,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [686658324] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-01 15:19:42,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-01 15:19:42,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-01 15:19:42,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433879019] [2024-11-01 15:19:42,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-01 15:19:42,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-01 15:19:42,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 15:19:42,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-01 15:19:42,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-01 15:19:42,610 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-01 15:19:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 15:19:43,175 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2024-11-01 15:19:43,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 15:19:43,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2024-11-01 15:19:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 15:19:43,177 INFO L225 Difference]: With dead ends: 146 [2024-11-01 15:19:43,177 INFO L226 Difference]: Without dead ends: 83 [2024-11-01 15:19:43,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-01 15:19:43,179 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-01 15:19:43,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-01 15:19:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-01 15:19:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-01 15:19:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 69 states have internal predecessors, (90), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-01 15:19:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2024-11-01 15:19:43,191 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 61 [2024-11-01 15:19:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 15:19:43,194 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2024-11-01 15:19:43,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-01 15:19:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2024-11-01 15:19:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-01 15:19:43,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 15:19:43,196 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 15:19:43,218 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-01 15:19:43,397 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-01 15:19:43,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 15:19:43,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 15:19:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1496047985, now seen corresponding path program 1 times [2024-11-01 15:19:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 15:19:43,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1644219451] [2024-11-01 15:19:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 15:19:43,398 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-01 15:19:43,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 15:19:43,400 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-01 15:19:43,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-01 15:19:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 15:19:44,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-01 15:19:44,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 15:19:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-01 15:19:46,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 15:19:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-01 15:19:50,977 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 15:19:50,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1644219451] [2024-11-01 15:19:50,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1644219451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 15:19:50,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 15:19:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-01 15:19:50,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170052908] [2024-11-01 15:19:50,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 15:19:50,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-01 15:19:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 15:19:50,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-01 15:19:50,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-01 15:19:50,979 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-01 15:19:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 15:19:53,546 INFO L93 Difference]: Finished difference Result 153 states and 202 transitions. [2024-11-01 15:19:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-01 15:19:53,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2024-11-01 15:19:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 15:19:53,547 INFO L225 Difference]: With dead ends: 153 [2024-11-01 15:19:53,548 INFO L226 Difference]: Without dead ends: 86 [2024-11-01 15:19:53,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-01 15:19:53,549 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-01 15:19:53,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 700 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-01 15:19:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-01 15:19:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-01 15:19:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 72 states have internal predecessors, (93), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-01 15:19:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2024-11-01 15:19:53,555 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 63 [2024-11-01 15:19:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 15:19:53,555 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2024-11-01 15:19:53,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-01 15:19:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2024-11-01 15:19:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-01 15:19:53,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 15:19:53,556 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 15:19:53,577 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-01 15:19:53,756 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-01 15:19:53,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 15:19:53,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 15:19:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1082623459, now seen corresponding path program 2 times [2024-11-01 15:19:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 15:19:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [767587152] [2024-11-01 15:19:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 15:19:53,758 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-01 15:19:53,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 15:19:53,760 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-01 15:19:53,761 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-01 15:19:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 15:19:54,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-01 15:19:54,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 15:19:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-01 15:19:55,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 15:19:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-01 15:19:58,466 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 15:19:58,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [767587152] [2024-11-01 15:19:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [767587152] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 15:19:58,467 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 15:19:58,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-01 15:19:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369491993] [2024-11-01 15:19:58,467 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 15:19:58,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-01 15:19:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 15:19:58,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-01 15:19:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-01 15:19:58,468 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-01 15:20:02,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-01 15:20:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 15:20:06,464 INFO L93 Difference]: Finished difference Result 225 states and 305 transitions. [2024-11-01 15:20:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 15:20:06,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2024-11-01 15:20:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 15:20:06,466 INFO L225 Difference]: With dead ends: 225 [2024-11-01 15:20:06,466 INFO L226 Difference]: Without dead ends: 173 [2024-11-01 15:20:06,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-01 15:20:06,468 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 144 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-01 15:20:06,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 291 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2024-11-01 15:20:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-01 15:20:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2024-11-01 15:20:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 148 states have (on average 1.385135135135135) internal successors, (205), 149 states have internal predecessors, (205), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-01 15:20:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2024-11-01 15:20:06,482 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 69 [2024-11-01 15:20:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 15:20:06,482 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2024-11-01 15:20:06,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-01 15:20:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2024-11-01 15:20:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-01 15:20:06,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 15:20:06,483 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 15:20:06,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-01 15:20:06,687 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-01 15:20:06,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 15:20:06,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 15:20:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1727087195, now seen corresponding path program 1 times [2024-11-01 15:20:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 15:20:06,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801821093] [2024-11-01 15:20:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 15:20:06,688 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-01 15:20:06,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 15:20:06,690 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-01 15:20:06,691 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-01 15:20:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 15:20:07,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-01 15:20:07,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 15:20:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-01 15:20:08,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 15:20:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-01 15:20:12,571 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 15:20:12,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801821093] [2024-11-01 15:20:12,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [801821093] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 15:20:12,571 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 15:20:12,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-01 15:20:12,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068143663] [2024-11-01 15:20:12,571 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 15:20:12,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-01 15:20:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 15:20:12,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-01 15:20:12,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-01 15:20:12,572 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-01 15:20:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 15:20:12,994 INFO L93 Difference]: Finished difference Result 177 states and 233 transitions. [2024-11-01 15:20:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-01 15:20:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 72 [2024-11-01 15:20:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 15:20:12,996 INFO L225 Difference]: With dead ends: 177 [2024-11-01 15:20:12,996 INFO L226 Difference]: Without dead ends: 172 [2024-11-01 15:20:12,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-01 15:20:12,997 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 112 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.4s IncrementalHoareTripleChecker+Time [2024-11-01 15:20:12,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-01 15:20:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-01 15:20:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2024-11-01 15:20:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 148 states have (on average 1.3783783783783783) internal successors, (204), 149 states have internal predecessors, (204), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-01 15:20:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 224 transitions. [2024-11-01 15:20:13,008 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 224 transitions. Word has length 72 [2024-11-01 15:20:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 15:20:13,009 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 224 transitions. [2024-11-01 15:20:13,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-01 15:20:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 224 transitions. [2024-11-01 15:20:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-01 15:20:13,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 15:20:13,010 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 15:20:13,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-01 15:20:13,210 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-01 15:20:13,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 15:20:13,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 15:20:13,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1669828893, now seen corresponding path program 1 times [2024-11-01 15:20:13,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 15:20:13,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1867614419] [2024-11-01 15:20:13,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 15:20:13,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 15:20:13,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 15:20:13,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 15:20:13,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-01 15:20:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 15:20:14,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-01 15:20:14,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 15:20:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-01 15:20:27,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 15:20:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-01 15:20:36,027 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 15:20:36,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1867614419] [2024-11-01 15:20:36,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1867614419] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 15:20:36,027 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 15:20:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2024-11-01 15:20:36,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600317416] [2024-11-01 15:20:36,028 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 15:20:36,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-01 15:20:36,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 15:20:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-01 15:20:36,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-01 15:20:36,029 INFO L87 Difference]: Start difference. First operand 167 states and 224 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-01 15:20:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 15:20:36,679 INFO L93 Difference]: Finished difference Result 429 states and 597 transitions. [2024-11-01 15:20:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-01 15:20:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 72 [2024-11-01 15:20:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 15:20:36,682 INFO L225 Difference]: With dead ends: 429 [2024-11-01 15:20:36,682 INFO L226 Difference]: Without dead ends: 292 [2024-11-01 15:20:36,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-01 15:20:36,683 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-01 15:20:36,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 170 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-01 15:20:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-01 15:20:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 287. [2024-11-01 15:20:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 262 states have (on average 1.4045801526717556) internal successors, (368), 263 states have internal predecessors, (368), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-01 15:20:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 394 transitions. [2024-11-01 15:20:36,701 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 394 transitions. Word has length 72 [2024-11-01 15:20:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 15:20:36,701 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 394 transitions. [2024-11-01 15:20:36,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-01 15:20:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 394 transitions. [2024-11-01 15:20:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-01 15:20:36,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 15:20:36,702 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 15:20:36,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-01 15:20:36,902 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-01 15:20:36,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 15:20:36,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 15:20:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1009941433, now seen corresponding path program 1 times [2024-11-01 15:20:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 15:20:36,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [378299193] [2024-11-01 15:20:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 15:20:36,904 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-01 15:20:36,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 15:20:36,905 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-01 15:20:36,906 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-01 15:20:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 15:20:37,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-01 15:20:37,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 15:20:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-01 15:20:38,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 15:20:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-01 15:20:43,845 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 15:20:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [378299193] [2024-11-01 15:20:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [378299193] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 15:20:43,845 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 15:20:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-01 15:20:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467948315] [2024-11-01 15:20:43,846 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 15:20:43,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-01 15:20:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 15:20:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-01 15:20:43,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-01 15:20:43,847 INFO L87 Difference]: Start difference. First operand 287 states and 394 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-01 15:20:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 15:20:44,443 INFO L93 Difference]: Finished difference Result 633 states and 885 transitions. [2024-11-01 15:20:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-01 15:20:44,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 78 [2024-11-01 15:20:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 15:20:44,445 INFO L225 Difference]: With dead ends: 633 [2024-11-01 15:20:44,445 INFO L226 Difference]: Without dead ends: 380 [2024-11-01 15:20:44,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-01 15:20:44,446 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 60 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-01 15:20:44,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 181 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-01 15:20:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-01 15:20:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 360. [2024-11-01 15:20:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 335 states have (on average 1.4059701492537313) internal successors, (471), 336 states have internal predecessors, (471), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-01 15:20:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 497 transitions. [2024-11-01 15:20:44,464 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 497 transitions. Word has length 78 [2024-11-01 15:20:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 15:20:44,464 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 497 transitions. [2024-11-01 15:20:44,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-01 15:20:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 497 transitions. [2024-11-01 15:20:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-01 15:20:44,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 15:20:44,468 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 15:20:44,492 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-01 15:20:44,668 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-01 15:20:44,669 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 15:20:44,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 15:20:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash -691684449, now seen corresponding path program 1 times [2024-11-01 15:20:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 15:20:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1089707635] [2024-11-01 15:20:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 15:20:44,669 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-01 15:20:44,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 15:20:44,670 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-01 15:20:44,671 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-01 15:20:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 15:20:45,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-01 15:20:45,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 15:20:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-01 15:20:48,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 15:20:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-01 15:20:53,095 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 15:20:53,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1089707635] [2024-11-01 15:20:53,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1089707635] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 15:20:53,095 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 15:20:53,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2024-11-01 15:20:53,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212407349] [2024-11-01 15:20:53,096 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 15:20:53,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-01 15:20:53,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 15:20:53,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-01 15:20:53,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-01 15:20:53,097 INFO L87 Difference]: Start difference. First operand 360 states and 497 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-01 15:20:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 15:20:54,760 INFO L93 Difference]: Finished difference Result 695 states and 969 transitions. [2024-11-01 15:20:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-01 15:20:54,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 89 [2024-11-01 15:20:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 15:20:54,764 INFO L225 Difference]: With dead ends: 695 [2024-11-01 15:20:54,764 INFO L226 Difference]: Without dead ends: 369 [2024-11-01 15:20:54,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-01 15:20:54,765 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-01 15:20:54,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-01 15:20:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-01 15:20:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-01 15:20:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 344 states have (on average 1.3866279069767442) internal successors, (477), 345 states have internal predecessors, (477), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-01 15:20:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 503 transitions. [2024-11-01 15:20:54,779 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 503 transitions. Word has length 89 [2024-11-01 15:20:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 15:20:54,779 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 503 transitions. [2024-11-01 15:20:54,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-01 15:20:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 503 transitions. [2024-11-01 15:20:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-01 15:20:54,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 15:20:54,780 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 15:20:54,803 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-01 15:20:54,981 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-01 15:20:54,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 15:20:54,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 15:20:54,981 INFO L85 PathProgramCache]: Analyzing trace with hash -11626079, now seen corresponding path program 1 times [2024-11-01 15:20:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 15:20:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2116069999] [2024-11-01 15:20:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 15:20:54,982 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-01 15:20:54,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 15:20:54,983 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 15:20:54,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-01 15:20:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 15:20:56,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-01 15:20:56,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 15:20:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-01 15:20:56,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 15:21:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-01 15:21:01,480 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 15:21:01,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2116069999] [2024-11-01 15:21:01,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2116069999] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 15:21:01,480 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 15:21:01,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-01 15:21:01,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643696991] [2024-11-01 15:21:01,481 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 15:21:01,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-01 15:21:01,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 15:21:01,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-01 15:21:01,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-01 15:21:01,482 INFO L87 Difference]: Start difference. First operand 369 states and 503 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-01 15:21:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 15:21:02,478 INFO L93 Difference]: Finished difference Result 685 states and 950 transitions. [2024-11-01 15:21:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-01 15:21:02,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 89 [2024-11-01 15:21:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 15:21:02,484 INFO L225 Difference]: With dead ends: 685 [2024-11-01 15:21:02,484 INFO L226 Difference]: Without dead ends: 350 [2024-11-01 15:21:02,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-01 15:21:02,485 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-01 15:21:02,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-01 15:21:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-01 15:21:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-11-01 15:21:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 331 states have (on average 1.3836858006042296) internal successors, (458), 332 states have internal predecessors, (458), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-01 15:21:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 478 transitions. [2024-11-01 15:21:02,498 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 478 transitions. Word has length 89 [2024-11-01 15:21:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 15:21:02,499 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 478 transitions. [2024-11-01 15:21:02,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-01 15:21:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 478 transitions. [2024-11-01 15:21:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-01 15:21:02,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 15:21:02,501 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 15:21:02,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-01 15:21:02,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 15:21:02,702 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 15:21:02,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 15:21:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -83424347, now seen corresponding path program 1 times [2024-11-01 15:21:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 15:21:02,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195885118] [2024-11-01 15:21:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 15:21:02,703 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-01 15:21:02,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 15:21:02,705 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 15:21:02,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 (11)] Waiting until timeout for monitored process [2024-11-01 15:21:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 15:21:03,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-01 15:21:03,828 INFO L278 TraceCheckSpWp]: Computing forward predicates...