/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/aws-c-common/aws_linked_list_push_back_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:18:32,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:18:33,054 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-05 08:18:33,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:18:33,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:18:33,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:18:33,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:18:33,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:18:33,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:18:33,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:18:33,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:18:33,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:18:33,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:18:33,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:18:33,093 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:18:33,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:18:33,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:18:33,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:18:33,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:18:33,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:18:33,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:18:33,096 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:18:33,096 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:18:33,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:18:33,097 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:18:33,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:18:33,097 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:18:33,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:18:33,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:18:33,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:18:33,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:18:33,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:18:33,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:18:33,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:18:33,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:18:33,099 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:18:33,100 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:18:33,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:18:33,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:18:33,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:18:33,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:18:33,101 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-05 08:18:33,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:18:33,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:18:33,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:18:33,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:18:33,351 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:18:33,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.i [2024-11-05 08:18:34,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:18:35,171 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:18:35,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.i [2024-11-05 08:18:35,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25366d7be/207a97ba61684f3cbfd5448380cafa3c/FLAGb2dca9f45 [2024-11-05 08:18:35,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25366d7be/207a97ba61684f3cbfd5448380cafa3c [2024-11-05 08:18:35,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:18:35,358 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:18:35,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:18:35,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:18:35,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:18:35,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:18:35" (1/1) ... [2024-11-05 08:18:35,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a02ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:35, skipping insertion in model container [2024-11-05 08:18:35,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:18:35" (1/1) ... [2024-11-05 08:18:35,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:18:35,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.i[4499,4512] [2024-11-05 08:18:35,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.i[4559,4572] [2024-11-05 08:18:36,419 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,534 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,534 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,535 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,544 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,546 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,547 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,547 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,548 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,548 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,549 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,552 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,552 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,555 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,555 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,562 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,563 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,563 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,564 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,565 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,566 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,566 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,566 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,568 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,569 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,569 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,569 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,570 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,570 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:36,854 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,855 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,856 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:36,856 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,031 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:37,084 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 08:18:37,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:18:37,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.i[4499,4512] [2024-11-05 08:18:37,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.i[4559,4572] [2024-11-05 08:18:37,150 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,167 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,168 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,168 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,172 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,173 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,174 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,174 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,174 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,175 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,175 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,176 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,177 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,178 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,178 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,181 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,182 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,183 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,183 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,183 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,184 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,184 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,185 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,185 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,185 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,186 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,186 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,258 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,259 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,259 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,259 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,290 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:37,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:37,304 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:18:37,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.i[4499,4512] [2024-11-05 08:18:37,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.i[4559,4572] [2024-11-05 08:18:37,374 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,374 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,375 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,375 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,375 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,380 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,381 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,381 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,382 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,382 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,383 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,383 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,383 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:37,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:37,623 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 08:18:37,631 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:18:37,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37 WrapperNode [2024-11-05 08:18:37,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:18:37,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:18:37,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:18:37,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:18:37,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,741 INFO L138 Inliner]: procedures = 687, calls = 1046, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 152 [2024-11-05 08:18:37,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:18:37,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:18:37,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:18:37,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:18:37,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,793 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 5, 28]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 10 writes are split as follows [0, 0, 10]. [2024-11-05 08:18:37,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:18:37,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:18:37,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:18:37,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:18:37,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (1/1) ... [2024-11-05 08:18:37,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:18:37,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:18:37,886 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-05 08:18:37,892 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-05 08:18:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:18:37,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:18:37,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:18:37,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:18:37,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 08:18:37,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 08:18:37,917 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:18:37,917 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:18:37,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-05 08:18:37,917 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-05 08:18:37,917 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-05 08:18:37,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:18:37,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 08:18:37,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 08:18:37,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 08:18:37,917 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2024-11-05 08:18:37,918 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2024-11-05 08:18:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:18:37,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:18:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:18:37,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:18:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:18:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 08:18:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 08:18:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 08:18:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 08:18:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 08:18:37,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 08:18:37,919 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-05 08:18:37,919 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-05 08:18:37,919 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-05 08:18:37,919 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-05 08:18:38,252 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:18:38,254 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:18:38,786 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-05 08:18:38,786 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:18:38,803 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:18:38,803 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 08:18:38,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:18:38 BoogieIcfgContainer [2024-11-05 08:18:38,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:18:38,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:18:38,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:18:38,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:18:38,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:18:35" (1/3) ... [2024-11-05 08:18:38,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3095c717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:18:38, skipping insertion in model container [2024-11-05 08:18:38,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:37" (2/3) ... [2024-11-05 08:18:38,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3095c717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:18:38, skipping insertion in model container [2024-11-05 08:18:38,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:18:38" (3/3) ... [2024-11-05 08:18:38,812 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness.i [2024-11-05 08:18:38,824 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:18:38,825 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:18:38,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:18:38,886 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;@2392cf5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:18:38,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:18:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-05 08:18:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 08:18:38,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:38,901 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-11-05 08:18:38,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:38,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 524704703, now seen corresponding path program 1 times [2024-11-05 08:18:38,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:38,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [949844437] [2024-11-05 08:18:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:38,918 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-05 08:18:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:38,923 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-05 08:18:38,926 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-05 08:18:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:39,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:18:39,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-05 08:18:39,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-05 08:18:39,320 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:39,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [949844437] [2024-11-05 08:18:39,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [949844437] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:39,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:39,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 08:18:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438844138] [2024-11-05 08:18:39,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:39,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:18:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:39,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:18:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:18:39,362 INFO L87 Difference]: Start difference. First operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:18:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:39,392 INFO L93 Difference]: Finished difference Result 196 states and 291 transitions. [2024-11-05 08:18:39,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:18:39,394 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2024-11-05 08:18:39,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:39,401 INFO L225 Difference]: With dead ends: 196 [2024-11-05 08:18:39,401 INFO L226 Difference]: Without dead ends: 97 [2024-11-05 08:18:39,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-05 08:18:39,407 INFO L432 NwaCegarLoop]: 136 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, 136 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-05 08:18:39,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:18:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-05 08:18:39,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-05 08:18:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-05 08:18:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2024-11-05 08:18:39,448 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 73 [2024-11-05 08:18:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:39,448 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2024-11-05 08:18:39,449 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:18:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2024-11-05 08:18:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 08:18:39,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:39,452 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-11-05 08:18:39,460 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-05 08:18:39,652 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-05 08:18:39,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:39,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash -569763587, now seen corresponding path program 1 times [2024-11-05 08:18:39,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:39,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [999980729] [2024-11-05 08:18:39,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:39,654 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-05 08:18:39,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:39,656 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-05 08:18:39,656 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-05 08:18:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:39,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:18:39,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 08:18:40,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-05 08:18:40,221 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [999980729] [2024-11-05 08:18:40,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [999980729] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:18:40,221 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:18:40,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2024-11-05 08:18:40,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972757876] [2024-11-05 08:18:40,222 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:40,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:18:40,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:40,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:18:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:18:40,226 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-05 08:18:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:40,363 INFO L93 Difference]: Finished difference Result 196 states and 272 transitions. [2024-11-05 08:18:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:18:40,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 73 [2024-11-05 08:18:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:40,365 INFO L225 Difference]: With dead ends: 196 [2024-11-05 08:18:40,365 INFO L226 Difference]: Without dead ends: 97 [2024-11-05 08:18:40,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:18:40,370 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 40 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:40,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 469 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:18:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-05 08:18:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-05 08:18:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-05 08:18:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2024-11-05 08:18:40,389 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 73 [2024-11-05 08:18:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:40,393 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 130 transitions. [2024-11-05 08:18:40,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-05 08:18:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2024-11-05 08:18:40,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 08:18:40,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:40,395 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-11-05 08:18:40,407 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 (3)] Ended with exit code 0 [2024-11-05 08:18:40,601 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-05 08:18:40,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:40,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1956548997, now seen corresponding path program 1 times [2024-11-05 08:18:40,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:40,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [735238034] [2024-11-05 08:18:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:40,603 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-05 08:18:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:40,604 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-05 08:18:40,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 08:18:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:40,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:18:40,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-05 08:18:40,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-05 08:18:41,028 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:41,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [735238034] [2024-11-05 08:18:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [735238034] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:41,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-05 08:18:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804768769] [2024-11-05 08:18:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:41,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:18:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:41,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:18:41,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:18:41,035 INFO L87 Difference]: Start difference. First operand 97 states and 130 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-05 08:18:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:41,127 INFO L93 Difference]: Finished difference Result 182 states and 247 transitions. [2024-11-05 08:18:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:18:41,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2024-11-05 08:18:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:41,131 INFO L225 Difference]: With dead ends: 182 [2024-11-05 08:18:41,132 INFO L226 Difference]: Without dead ends: 99 [2024-11-05 08:18:41,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:18:41,133 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:41,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 602 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:18:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-05 08:18:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-05 08:18:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-05 08:18:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2024-11-05 08:18:41,149 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 73 [2024-11-05 08:18:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:41,150 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2024-11-05 08:18:41,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-05 08:18:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2024-11-05 08:18:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-05 08:18:41,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:41,153 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:41,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 08:18:41,353 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-05 08:18:41,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:41,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1237560575, now seen corresponding path program 1 times [2024-11-05 08:18:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:41,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [149129127] [2024-11-05 08:18:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:41,355 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-05 08:18:41,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:41,358 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-05 08:18:41,359 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-05 08:18:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:41,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:18:41,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 08:18:41,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-05 08:18:41,904 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:41,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [149129127] [2024-11-05 08:18:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [149129127] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:18:41,904 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:18:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2024-11-05 08:18:41,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846343971] [2024-11-05 08:18:41,905 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:41,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 08:18:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:41,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 08:18:41,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:18:41,909 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-05 08:18:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:42,071 INFO L93 Difference]: Finished difference Result 189 states and 256 transitions. [2024-11-05 08:18:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:18:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 75 [2024-11-05 08:18:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:42,074 INFO L225 Difference]: With dead ends: 189 [2024-11-05 08:18:42,074 INFO L226 Difference]: Without dead ends: 101 [2024-11-05 08:18:42,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:18:42,076 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 36 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:42,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 533 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:18:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-05 08:18:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-11-05 08:18:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-05 08:18:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2024-11-05 08:18:42,103 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 132 transitions. Word has length 75 [2024-11-05 08:18:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:42,104 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 132 transitions. [2024-11-05 08:18:42,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-05 08:18:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 132 transitions. [2024-11-05 08:18:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-05 08:18:42,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:42,106 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:42,116 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-05 08:18:42,309 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-05 08:18:42,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:42,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:42,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1187141198, now seen corresponding path program 1 times [2024-11-05 08:18:42,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:42,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1515373755] [2024-11-05 08:18:42,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:42,311 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-05 08:18:42,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:42,314 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-05 08:18:42,315 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-05 08:18:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:42,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:18:42,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 08:18:42,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-05 08:18:42,865 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:42,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1515373755] [2024-11-05 08:18:42,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1515373755] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:18:42,866 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:18:42,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2024-11-05 08:18:42,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315575211] [2024-11-05 08:18:42,866 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:42,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 08:18:42,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:42,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 08:18:42,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-05 08:18:42,868 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-05 08:18:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:43,130 INFO L93 Difference]: Finished difference Result 195 states and 264 transitions. [2024-11-05 08:18:43,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 08:18:43,130 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 77 [2024-11-05 08:18:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:43,132 INFO L225 Difference]: With dead ends: 195 [2024-11-05 08:18:43,132 INFO L226 Difference]: Without dead ends: 106 [2024-11-05 08:18:43,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-05 08:18:43,133 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 33 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:43,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 946 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:18:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-05 08:18:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2024-11-05 08:18:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 65 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-05 08:18:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 133 transitions. [2024-11-05 08:18:43,150 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 133 transitions. Word has length 77 [2024-11-05 08:18:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:43,150 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 133 transitions. [2024-11-05 08:18:43,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-05 08:18:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2024-11-05 08:18:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-05 08:18:43,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:43,154 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:43,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-05 08:18:43,355 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-05 08:18:43,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:43,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1548809988, now seen corresponding path program 1 times [2024-11-05 08:18:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982986874] [2024-11-05 08:18:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:43,357 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-05 08:18:43,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:43,360 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-05 08:18:43,361 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-05 08:18:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:43,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:18:43,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 08:18:43,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-05 08:18:43,758 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:43,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982986874] [2024-11-05 08:18:43,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [982986874] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:18:43,758 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:18:43,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 3] imperfect sequences [] total 8 [2024-11-05 08:18:43,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245491083] [2024-11-05 08:18:43,759 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:43,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:18:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:18:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:18:43,760 INFO L87 Difference]: Start difference. First operand 100 states and 133 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-05 08:18:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:43,957 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2024-11-05 08:18:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:18:43,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 78 [2024-11-05 08:18:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:43,960 INFO L225 Difference]: With dead ends: 192 [2024-11-05 08:18:43,960 INFO L226 Difference]: Without dead ends: 106 [2024-11-05 08:18:43,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:18:43,961 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 24 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:43,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 736 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:18:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-05 08:18:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2024-11-05 08:18:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.203125) internal successors, (77), 66 states have internal predecessors, (77), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-05 08:18:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2024-11-05 08:18:43,983 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 78 [2024-11-05 08:18:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:43,983 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2024-11-05 08:18:43,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-05 08:18:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2024-11-05 08:18:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-05 08:18:43,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:43,984 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:43,993 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-05 08:18:44,185 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-05 08:18:44,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:44,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1185344546, now seen corresponding path program 1 times [2024-11-05 08:18:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:44,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1511539957] [2024-11-05 08:18:44,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:44,186 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-05 08:18:44,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:44,187 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-05 08:18:44,188 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-05 08:18:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:44,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:18:44,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-05 08:18:44,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-05 08:18:44,552 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:44,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1511539957] [2024-11-05 08:18:44,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1511539957] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:44,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:44,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-05 08:18:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461387861] [2024-11-05 08:18:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:44,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:18:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:18:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:18:44,554 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-05 08:18:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:44,632 INFO L93 Difference]: Finished difference Result 191 states and 256 transitions. [2024-11-05 08:18:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:18:44,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2024-11-05 08:18:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:44,634 INFO L225 Difference]: With dead ends: 191 [2024-11-05 08:18:44,634 INFO L226 Difference]: Without dead ends: 104 [2024-11-05 08:18:44,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:18:44,635 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:44,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 712 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:18:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-05 08:18:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-11-05 08:18:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.2) internal successors, (78), 67 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-05 08:18:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2024-11-05 08:18:44,643 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 86 [2024-11-05 08:18:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:44,644 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2024-11-05 08:18:44,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-05 08:18:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2024-11-05 08:18:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-05 08:18:44,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:44,645 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:44,655 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-05 08:18:44,849 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-05 08:18:44,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:44,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash 172862485, now seen corresponding path program 1 times [2024-11-05 08:18:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:44,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770975864] [2024-11-05 08:18:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:44,851 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-05 08:18:44,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:44,852 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-05 08:18:44,852 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-05 08:18:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:45,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-05 08:18:45,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:49,401 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2024-11-05 08:18:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 08:18:49,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-05 08:18:49,992 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770975864] [2024-11-05 08:18:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [770975864] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:18:49,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:18:49,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-05 08:18:49,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430981480] [2024-11-05 08:18:49,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:18:49,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:18:49,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:49,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:18:49,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2024-11-05 08:18:49,994 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-05 08:18:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:52,496 INFO L93 Difference]: Finished difference Result 231 states and 319 transitions. [2024-11-05 08:18:52,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 08:18:52,497 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 88 [2024-11-05 08:18:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:52,499 INFO L225 Difference]: With dead ends: 231 [2024-11-05 08:18:52,499 INFO L226 Difference]: Without dead ends: 143 [2024-11-05 08:18:52,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=62, Invalid=247, Unknown=1, NotChecked=32, Total=342 [2024-11-05 08:18:52,501 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 48 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:52,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 975 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 303 Unchecked, 2.3s Time] [2024-11-05 08:18:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-05 08:18:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 120. [2024-11-05 08:18:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-05 08:18:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2024-11-05 08:18:52,513 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 88 [2024-11-05 08:18:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:52,513 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2024-11-05 08:18:52,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-05 08:18:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2024-11-05 08:18:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-05 08:18:52,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:52,514 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:52,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-05 08:18:52,714 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-05 08:18:52,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:52,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1126802643, now seen corresponding path program 1 times [2024-11-05 08:18:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:52,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1401236250] [2024-11-05 08:18:52,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:52,716 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-05 08:18:52,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:52,717 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-05 08:18:52,719 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-05 08:18:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:52,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 08:18:52,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:18:52,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-05 08:18:53,011 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1401236250] [2024-11-05 08:18:53,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1401236250] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:18:53,011 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:18:53,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-05 08:18:53,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28394558] [2024-11-05 08:18:53,011 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:53,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:18:53,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:53,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:18:53,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:18:53,013 INFO L87 Difference]: Start difference. First operand 120 states and 160 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 08:18:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:53,036 INFO L93 Difference]: Finished difference Result 227 states and 309 transitions. [2024-11-05 08:18:53,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:18:53,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 88 [2024-11-05 08:18:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:53,038 INFO L225 Difference]: With dead ends: 227 [2024-11-05 08:18:53,038 INFO L226 Difference]: Without dead ends: 121 [2024-11-05 08:18:53,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:18:53,040 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:53,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 375 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:18:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-05 08:18:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-05 08:18:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 83 states have internal predecessors, (99), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-05 08:18:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2024-11-05 08:18:53,050 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 88 [2024-11-05 08:18:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:53,050 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2024-11-05 08:18:53,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 08:18:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2024-11-05 08:18:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-05 08:18:53,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:53,052 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:53,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-05 08:18:53,252 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-05 08:18:53,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:53,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 394835217, now seen corresponding path program 1 times [2024-11-05 08:18:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:53,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400531416] [2024-11-05 08:18:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:53,253 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-05 08:18:53,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:53,256 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-05 08:18:53,257 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-05 08:18:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:53,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:18:53,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:18:53,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-05 08:18:53,534 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1400531416] [2024-11-05 08:18:53,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1400531416] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:18:53,534 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:18:53,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2024-11-05 08:18:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113659231] [2024-11-05 08:18:53,534 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:53,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:18:53,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:53,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:18:53,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:18:53,536 INFO L87 Difference]: Start difference. First operand 120 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 08:18:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:53,575 INFO L93 Difference]: Finished difference Result 226 states and 308 transitions. [2024-11-05 08:18:53,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:18:53,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 88 [2024-11-05 08:18:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:53,577 INFO L225 Difference]: With dead ends: 226 [2024-11-05 08:18:53,577 INFO L226 Difference]: Without dead ends: 120 [2024-11-05 08:18:53,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:18:53,579 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:53,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:18:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-05 08:18:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2024-11-05 08:18:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-05 08:18:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2024-11-05 08:18:53,589 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 88 [2024-11-05 08:18:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:53,589 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2024-11-05 08:18:53,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 08:18:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2024-11-05 08:18:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-05 08:18:53,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:53,590 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:53,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-05 08:18:53,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:53,791 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:53,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash 759251201, now seen corresponding path program 1 times [2024-11-05 08:18:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2144007431] [2024-11-05 08:18:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:53,792 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-05 08:18:53,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:53,793 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:18:53,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-05 08:18:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:54,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-05 08:18:54,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:54,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-05 08:18:54,300 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-05 08:18:54,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2024-11-05 08:18:55,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-05 08:18:56,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 142 [2024-11-05 08:18:56,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:18:56,708 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-05 08:18:56,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 95 [2024-11-05 08:18:56,768 INFO L349 Elim1Store]: treesize reduction 114, result has 7.3 percent of original size [2024-11-05 08:18:56,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 133 [2024-11-05 08:18:56,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-05 08:18:56,786 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-05 08:18:56,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2024-11-05 08:18:56,841 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-05 08:18:56,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 71 [2024-11-05 08:18:56,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-05 08:18:56,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:18:56,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-05 08:18:56,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-05 08:18:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 08:18:58,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:59,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:18:59,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 98 [2024-11-05 08:18:59,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:18:59,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 798 treesize of output 788 [2024-11-05 08:18:59,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 350 [2024-11-05 08:18:59,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-05 08:18:59,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 194 [2024-11-05 08:19:24,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-05 08:19:29,141 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-05 08:19:29,213 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-05 08:19:29,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1654 treesize of output 1333 [2024-11-05 08:19:29,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:19:29,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 349 treesize of output 353 [2024-11-05 08:19:29,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 286 [2024-11-05 08:19:29,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-05 08:19:29,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-05 08:19:29,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:19:29,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-05 08:19:29,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:19:29,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-05 08:19:29,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:19:29,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-05 08:19:29,833 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-05 08:19:29,838 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-05 08:19:29,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 1 [2024-11-05 08:19:29,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:19:29,846 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-05 08:19:29,847 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-05 08:19:29,852 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-05 08:19:29,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2024-11-05 08:19:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-05 08:19:31,171 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:31,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2144007431] [2024-11-05 08:19:31,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2144007431] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:31,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:31,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [23] total 36 [2024-11-05 08:19:31,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639705239] [2024-11-05 08:19:31,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:31,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 08:19:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:31,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 08:19:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2024-11-05 08:19:31,174 INFO L87 Difference]: Start difference. First operand 117 states and 154 transitions. Second operand has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-05 08:19:34,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-05 08:19:38,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-05 08:19:41,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-05 08:19:42,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-05 08:19:47,136 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)) (.cse3 (bvadd (_ bv24 64) |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)) (.cse1 (bvadd |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| (_ bv24 64)))) (and (not (= |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base| |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)) (forall ((v_ArrVal_558 (Array (_ BitVec 64) (_ BitVec 64))) (aws_linked_list_insert_before_~to_add.offset (_ BitVec 64))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| (store (store .cse0 aws_linked_list_insert_before_~to_add.offset |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (bvadd (_ bv8 64) aws_linked_list_insert_before_~to_add.offset) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) .cse1))) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) .cse1) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|))) (forall ((v_ArrVal_558 (Array (_ BitVec 64) (_ BitVec 64))) (aws_linked_list_insert_before_~to_add.offset (_ BitVec 64))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base| (store (store .cse2 aws_linked_list_insert_before_~to_add.offset |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (bvadd (_ bv8 64) aws_linked_list_insert_before_~to_add.offset) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base| v_ArrVal_558) |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) .cse3))) |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) .cse3) |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))) (forall ((v_ArrVal_558 (Array (_ BitVec 64) (_ BitVec 64))) (aws_linked_list_insert_before_~to_add.offset (_ BitVec 64)) (v_ArrVal_562 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| (store (store .cse0 aws_linked_list_insert_before_~to_add.offset |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (bvadd (_ bv8 64) aws_linked_list_insert_before_~to_add.offset) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) .cse1))))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) .cse1) v_ArrVal_562)) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|) aws_linked_list_insert_before_~to_add.offset))) (forall ((v_ArrVal_558 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base| (store (store .cse2 .cse3 |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (bvadd (_ bv32 64) |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.offset|) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base| v_ArrVal_558) |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) .cse3))) |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) .cse3) |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))) (not (= |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)) (forall ((v_ArrVal_558 (Array (_ BitVec 64) (_ BitVec 64))) (aws_linked_list_insert_before_~to_add.offset (_ BitVec 64)) (v_ArrVal_562 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base| (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base| (store (store .cse2 aws_linked_list_insert_before_~to_add.offset |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (bvadd (_ bv8 64) aws_linked_list_insert_before_~to_add.offset) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base| v_ArrVal_558) |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) .cse3))))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) .cse3) v_ArrVal_562)) |c_ULTIMATE.start_aws_linked_list_push_back_~node#1.base|) aws_linked_list_insert_before_~to_add.offset))) (forall ((v_ArrVal_558 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| (store (store .cse0 .cse1 |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (bvadd |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| (_ bv32 64)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) .cse1))) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) .cse1) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|))))) is different from true [2024-11-05 08:20:05,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-05 08:20:10,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]