/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_init_harness_negated.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:17:37,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:17:37,197 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:17:37,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:17:37,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:17:37,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:17:37,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:17:37,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:17:37,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:17:37,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:17:37,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:17:37,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:17:37,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:17:37,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:17:37,225 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:17:37,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:17:37,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:17:37,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:17:37,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:17:37,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:17:37,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:17:37,228 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:17:37,228 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:17:37,230 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:17:37,230 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:17:37,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:17:37,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:17:37,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:17:37,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:17:37,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:17:37,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:17:37,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:17:37,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:17:37,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:17:37,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:17:37,232 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:17:37,232 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:17:37,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:17:37,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:17:37,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:17:37,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:17:37,234 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:17:37,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:17:37,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:17:37,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:17:37,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:17:37,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:17:37,439 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_init_harness_negated.i [2024-11-05 08:17:38,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:17:38,924 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:17:38,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness_negated.i [2024-11-05 08:17:38,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021dcac45/19dd910cd79f453988d15a34d0c53228/FLAG4c0e974a2 [2024-11-05 08:17:39,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021dcac45/19dd910cd79f453988d15a34d0c53228 [2024-11-05 08:17:39,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:17:39,180 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:17:39,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:17:39,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:17:39,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:17:39,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:17:39" (1/1) ... [2024-11-05 08:17:39,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10bdde40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:39, skipping insertion in model container [2024-11-05 08:17:39,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:17:39" (1/1) ... [2024-11-05 08:17:39,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:17:39,448 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_init_harness_negated.i[4494,4507] [2024-11-05 08:17:39,454 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_init_harness_negated.i[4554,4567] [2024-11-05 08:17:39,763 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:17:39,821 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:17:39,821 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:17:39,822 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:17:39,829 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:17:39,833 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,834 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,834 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,835 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:17:39,835 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,835 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,837 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:17:39,838 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:17:39,839 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:17:39,839 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:17:39,845 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,845 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:17:39,846 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,846 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:17:39,847 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,847 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:17:39,848 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,848 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:17:39,849 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,849 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:17:39,850 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,850 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:17:39,850 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:39,851 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,075 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:17:40,076 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:17:40,076 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:17:40,077 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:17:40,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:17:40,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:17:40,177 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 08:17:40,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:17:40,206 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_init_harness_negated.i[4494,4507] [2024-11-05 08:17:40,206 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_init_harness_negated.i[4554,4567] [2024-11-05 08:17:40,234 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:17:40,249 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:17:40,251 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:17:40,252 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:17:40,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:17:40,258 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,259 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,259 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,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:17:40,259 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,260 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,261 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:17:40,263 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:17:40,264 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:17:40,264 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:17:40,269 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,270 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:17:40,270 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,270 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:17:40,271 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,271 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:17:40,271 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,272 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:17:40,272 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,273 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:17:40,273 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,273 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:17:40,273 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,273 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,311 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:17:40,311 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:17:40,311 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:17:40,312 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:17:40,337 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:17:40,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:17:40,349 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:17:40,361 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_init_harness_negated.i[4494,4507] [2024-11-05 08:17:40,362 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_init_harness_negated.i[4554,4567] [2024-11-05 08:17:40,391 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,392 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,392 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,393 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,393 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,398 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,398 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,399 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,400 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,401 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,401 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,402 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,402 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:40,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:17:40,571 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 08:17:40,577 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:17:40,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40 WrapperNode [2024-11-05 08:17:40,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:17:40,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:17:40,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:17:40,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:17:40,584 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:17:40" (1/1) ... [2024-11-05 08:17:40,628 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:17:40" (1/1) ... [2024-11-05 08:17:40,654 INFO L138 Inliner]: procedures = 687, calls = 1034, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 93 [2024-11-05 08:17:40,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:17:40,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:17:40,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:17:40,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:17:40,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (1/1) ... [2024-11-05 08:17:40,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (1/1) ... [2024-11-05 08:17:40,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (1/1) ... [2024-11-05 08:17:40,683 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 4 writes are split as follows [0, 0, 4]. [2024-11-05 08:17:40,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (1/1) ... [2024-11-05 08:17:40,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (1/1) ... [2024-11-05 08:17:40,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (1/1) ... [2024-11-05 08:17:40,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (1/1) ... [2024-11-05 08:17:40,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (1/1) ... [2024-11-05 08:17:40,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (1/1) ... [2024-11-05 08:17:40,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:17:40,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:17:40,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:17:40,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:17:40,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (1/1) ... [2024-11-05 08:17:40,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:17:40,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:17:40,744 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:17:40,746 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:17:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2024-11-05 08:17:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2024-11-05 08:17:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:17:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:17:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 08:17:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:17:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-05 08:17:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:17:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-05 08:17:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-05 08:17:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:17:40,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:17:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:17:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 08:17:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 08:17:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 08:17:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 08:17:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 08:17:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 08:17:40,994 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:17:40,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:17:41,193 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-05 08:17:41,193 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:17:41,203 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:17:41,204 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 08:17:41,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:17:41 BoogieIcfgContainer [2024-11-05 08:17:41,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:17:41,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:17:41,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:17:41,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:17:41,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:17:39" (1/3) ... [2024-11-05 08:17:41,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6007ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:17:41, skipping insertion in model container [2024-11-05 08:17:41,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:40" (2/3) ... [2024-11-05 08:17:41,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6007ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:17:41, skipping insertion in model container [2024-11-05 08:17:41,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:17:41" (3/3) ... [2024-11-05 08:17:41,210 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness_negated.i [2024-11-05 08:17:41,220 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:17:41,220 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:17:41,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:17:41,269 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63963f7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:17:41,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:17:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:17:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 08:17:41,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:41,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:41,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:41,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1017333715, now seen corresponding path program 1 times [2024-11-05 08:17:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:41,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1633124052] [2024-11-05 08:17:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:41,291 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:17:41,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:41,293 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:17:41,294 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:17:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:41,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:17:41,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:41,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:41,459 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1633124052] [2024-11-05 08:17:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1633124052] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:41,460 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:41,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 08:17:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335290796] [2024-11-05 08:17:41,462 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:41,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:17:41,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:41,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:17:41,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:17:41,480 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 08:17:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:41,497 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2024-11-05 08:17:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:17:41,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-05 08:17:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:41,503 INFO L225 Difference]: With dead ends: 117 [2024-11-05 08:17:41,503 INFO L226 Difference]: Without dead ends: 56 [2024-11-05 08:17:41,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:17:41,508 INFO L432 NwaCegarLoop]: 75 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, 75 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:17:41,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:17:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-05 08:17:41,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-05 08:17:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-05 08:17:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-05 08:17:41,535 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2024-11-05 08:17:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:41,535 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-05 08:17:41,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 08:17:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-05 08:17:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 08:17:41,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:41,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:41,542 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:17:41,737 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:17:41,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1834982165, now seen corresponding path program 1 times [2024-11-05 08:17:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038417166] [2024-11-05 08:17:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:41,738 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:17:41,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:41,740 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:17:41,740 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:17:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:41,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-05 08:17:41,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:41,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-05 08:17:41,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-05 08:17:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:42,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:43,011 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:43,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038417166] [2024-11-05 08:17:43,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2038417166] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:43,012 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:43,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 6] imperfect sequences [] total 14 [2024-11-05 08:17:43,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829016230] [2024-11-05 08:17:43,012 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:43,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 08:17:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:43,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 08:17:43,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-05 08:17:43,014 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 14 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 08:17:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:43,587 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2024-11-05 08:17:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 08:17:43,588 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2024-11-05 08:17:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:43,592 INFO L225 Difference]: With dead ends: 114 [2024-11-05 08:17:43,592 INFO L226 Difference]: Without dead ends: 65 [2024-11-05 08:17:43,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:17:43,593 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:43,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 389 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 08:17:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-05 08:17:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-05 08:17:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-05 08:17:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2024-11-05 08:17:43,606 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 26 [2024-11-05 08:17:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:43,607 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-05 08:17:43,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 08:17:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2024-11-05 08:17:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 08:17:43,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:43,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:43,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:43,811 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:17:43,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:43,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1650638505, now seen corresponding path program 1 times [2024-11-05 08:17:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:43,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821058735] [2024-11-05 08:17:43,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:43,813 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:17:43,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:43,814 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:17:43,814 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:17:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:43,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:17:43,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:43,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:43,955 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:43,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821058735] [2024-11-05 08:17:43,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [821058735] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:43,956 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:43,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2024-11-05 08:17:43,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614615935] [2024-11-05 08:17:43,956 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:43,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:17:43,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:43,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:17:43,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:17:43,957 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:44,008 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2024-11-05 08:17:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:17:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-05 08:17:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:44,010 INFO L225 Difference]: With dead ends: 73 [2024-11-05 08:17:44,010 INFO L226 Difference]: Without dead ends: 71 [2024-11-05 08:17:44,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:17:44,011 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:44,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 461 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:17:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-05 08:17:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-05 08:17:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 51 states have internal predecessors, (61), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-05 08:17:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2024-11-05 08:17:44,021 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 26 [2024-11-05 08:17:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:44,021 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2024-11-05 08:17:44,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2024-11-05 08:17:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-05 08:17:44,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:44,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:44,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:44,222 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:17:44,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:44,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:44,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1687611897, now seen corresponding path program 1 times [2024-11-05 08:17:44,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:44,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1017316254] [2024-11-05 08:17:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:44,224 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:17:44,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:44,227 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:17:44,227 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:17:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:44,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:17:44,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:44,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:44,469 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1017316254] [2024-11-05 08:17:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1017316254] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:44,469 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:44,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2024-11-05 08:17:44,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068812738] [2024-11-05 08:17:44,469 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:44,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 08:17:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:44,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 08:17:44,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:17:44,470 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:44,620 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2024-11-05 08:17:44,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:17:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-05 08:17:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:44,621 INFO L225 Difference]: With dead ends: 129 [2024-11-05 08:17:44,621 INFO L226 Difference]: Without dead ends: 72 [2024-11-05 08:17:44,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-05 08:17:44,622 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:44,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 405 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:17:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-05 08:17:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-11-05 08:17:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.25) internal successors, (60), 51 states have internal predecessors, (60), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-05 08:17:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2024-11-05 08:17:44,639 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 28 [2024-11-05 08:17:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:44,639 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2024-11-05 08:17:44,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2024-11-05 08:17:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-05 08:17:44,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:44,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:44,647 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:17:44,842 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:17:44,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1850407916, now seen corresponding path program 1 times [2024-11-05 08:17:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [903979485] [2024-11-05 08:17:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:44,843 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:17:44,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:44,844 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:17:44,845 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:17:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:44,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:17:44,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:45,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:45,113 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [903979485] [2024-11-05 08:17:45,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [903979485] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:45,113 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:45,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 12 [2024-11-05 08:17:45,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926912266] [2024-11-05 08:17:45,114 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:45,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 08:17:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:45,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 08:17:45,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-05 08:17:45,115 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:45,309 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2024-11-05 08:17:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:17:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-05 08:17:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:45,310 INFO L225 Difference]: With dead ends: 135 [2024-11-05 08:17:45,310 INFO L226 Difference]: Without dead ends: 77 [2024-11-05 08:17:45,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-05 08:17:45,311 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 44 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:45,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 389 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:17:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-05 08:17:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2024-11-05 08:17:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-05 08:17:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-11-05 08:17:45,321 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 30 [2024-11-05 08:17:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:45,323 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-05 08:17:45,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2024-11-05 08:17:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-05 08:17:45,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:45,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:45,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 08:17:45,525 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:17:45,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:45,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1395309347, now seen corresponding path program 1 times [2024-11-05 08:17:45,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:45,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1541926179] [2024-11-05 08:17:45,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:45,526 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:17:45,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:45,529 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:17:45,529 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:17:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:45,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:17:45,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:45,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:45,701 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1541926179] [2024-11-05 08:17:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1541926179] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:45,701 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:45,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 3] imperfect sequences [] total 9 [2024-11-05 08:17:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256694620] [2024-11-05 08:17:45,701 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:45,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 08:17:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:45,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 08:17:45,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:17:45,702 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:45,865 INFO L93 Difference]: Finished difference Result 132 states and 163 transitions. [2024-11-05 08:17:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:17:45,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-11-05 08:17:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:45,867 INFO L225 Difference]: With dead ends: 132 [2024-11-05 08:17:45,867 INFO L226 Difference]: Without dead ends: 77 [2024-11-05 08:17:45,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:17:45,868 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:45,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 340 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:17:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-05 08:17:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-11-05 08:17:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.24) internal successors, (62), 53 states have internal predecessors, (62), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-05 08:17:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2024-11-05 08:17:45,886 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 31 [2024-11-05 08:17:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:45,886 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2024-11-05 08:17:45,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2024-11-05 08:17:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-05 08:17:45,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:45,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:45,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-05 08:17:46,087 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:17:46,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:46,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1854431003, now seen corresponding path program 1 times [2024-11-05 08:17:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [637384159] [2024-11-05 08:17:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:46,088 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:17:46,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:46,089 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:17:46,090 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:17:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:46,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:17:46,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:46,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:46,271 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [637384159] [2024-11-05 08:17:46,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [637384159] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:46,271 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:46,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2024-11-05 08:17:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388093882] [2024-11-05 08:17:46,271 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:46,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 08:17:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:46,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 08:17:46,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:17:46,273 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 08:17:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:46,315 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-11-05 08:17:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:17:46,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-05 08:17:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:46,316 INFO L225 Difference]: With dead ends: 83 [2024-11-05 08:17:46,317 INFO L226 Difference]: Without dead ends: 81 [2024-11-05 08:17:46,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:17:46,317 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:46,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 446 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:17:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-05 08:17:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2024-11-05 08:17:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 54 states have internal predecessors, (63), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-05 08:17:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2024-11-05 08:17:46,330 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 39 [2024-11-05 08:17:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:46,330 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-11-05 08:17:46,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 08:17:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2024-11-05 08:17:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 08:17:46,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:46,331 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 08:17:46,339 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 (8)] Ended with exit code 0 [2024-11-05 08:17:46,531 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:17:46,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:46,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1272793794, now seen corresponding path program 1 times [2024-11-05 08:17:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:46,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1715297345] [2024-11-05 08:17:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:46,533 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:17:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:46,534 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:17:46,535 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:17:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:46,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-05 08:17:46,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:46,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-05 08:17:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 08:17:47,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 08:17:47,409 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1715297345] [2024-11-05 08:17:47,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1715297345] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:47,409 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:47,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2024-11-05 08:17:47,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795151153] [2024-11-05 08:17:47,409 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:47,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 08:17:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:47,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 08:17:47,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:17:47,410 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 19 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-05 08:17:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:48,120 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2024-11-05 08:17:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 08:17:48,121 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) Word has length 42 [2024-11-05 08:17:48,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:48,122 INFO L225 Difference]: With dead ends: 156 [2024-11-05 08:17:48,122 INFO L226 Difference]: Without dead ends: 94 [2024-11-05 08:17:48,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2024-11-05 08:17:48,123 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 107 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:48,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 605 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 08:17:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-05 08:17:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2024-11-05 08:17:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 65 states have internal predecessors, (79), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-05 08:17:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2024-11-05 08:17:48,134 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 42 [2024-11-05 08:17:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:48,134 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2024-11-05 08:17:48,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-05 08:17:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2024-11-05 08:17:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 08:17:48,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:48,137 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 08:17:48,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-05 08:17:48,337 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:17:48,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:48,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1210754180, now seen corresponding path program 1 times [2024-11-05 08:17:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2027482788] [2024-11-05 08:17:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:48,338 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:17:48,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:48,340 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:17:48,341 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:17:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:48,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-05 08:17:48,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:48,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-05 08:17:48,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 7 [2024-11-05 08:17:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 08:17:48,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 08:17:49,246 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:49,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2027482788] [2024-11-05 08:17:49,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2027482788] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:49,246 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:49,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 7] imperfect sequences [] total 16 [2024-11-05 08:17:49,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997921032] [2024-11-05 08:17:49,246 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:49,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:17:49,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:49,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:17:49,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:17:49,247 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 16 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-05 08:17:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:50,172 INFO L93 Difference]: Finished difference Result 187 states and 237 transitions. [2024-11-05 08:17:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 08:17:50,173 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2024-11-05 08:17:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:50,174 INFO L225 Difference]: With dead ends: 187 [2024-11-05 08:17:50,174 INFO L226 Difference]: Without dead ends: 113 [2024-11-05 08:17:50,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-11-05 08:17:50,175 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 114 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:50,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 534 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 08:17:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-05 08:17:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 89. [2024-11-05 08:17:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 69 states have internal predecessors, (85), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-05 08:17:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2024-11-05 08:17:50,186 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 42 [2024-11-05 08:17:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:50,187 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2024-11-05 08:17:50,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-05 08:17:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2024-11-05 08:17:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 08:17:50,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:50,187 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 08:17:50,193 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 (10)] Ended with exit code 0 [2024-11-05 08:17:50,388 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:17:50,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:50,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1720227270, now seen corresponding path program 1 times [2024-11-05 08:17:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:50,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923601139] [2024-11-05 08:17:50,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:50,389 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:17:50,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:50,390 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:17:50,390 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:17:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:50,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-05 08:17:50,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:50,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:51,031 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 10 treesize of output 6 [2024-11-05 08:17:51,086 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 10 treesize of output 6 [2024-11-05 08:17:51,303 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:17:51,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2024-11-05 08:17:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 08:17:51,353 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:51,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923601139] [2024-11-05 08:17:51,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1923601139] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:17:51,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:17:51,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 25 [2024-11-05 08:17:51,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821362353] [2024-11-05 08:17:51,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:51,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 08:17:51,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:51,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 08:17:51,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2024-11-05 08:17:51,355 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-05 08:17:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:51,943 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2024-11-05 08:17:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 08:17:51,943 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-11-05 08:17:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:51,944 INFO L225 Difference]: With dead ends: 144 [2024-11-05 08:17:51,944 INFO L226 Difference]: Without dead ends: 142 [2024-11-05 08:17:51,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2024-11-05 08:17:51,945 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 46 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:51,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 842 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 08:17:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-05 08:17:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 119. [2024-11-05 08:17:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 93 states have internal predecessors, (114), 17 states have call successors, (17), 9 states have call predecessors, (17), 13 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2024-11-05 08:17:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2024-11-05 08:17:51,961 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 42 [2024-11-05 08:17:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:51,961 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2024-11-05 08:17:51,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-05 08:17:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2024-11-05 08:17:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 08:17:51,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:51,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:51,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:52,162 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:17:52,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:52,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1045188466, now seen corresponding path program 1 times [2024-11-05 08:17:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2044016045] [2024-11-05 08:17:52,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:52,163 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:17:52,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:52,164 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:17:52,165 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:17:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:52,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 08:17:52,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:56,398 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:17:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:56,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:56,660 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:56,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2044016045] [2024-11-05 08:17:56,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2044016045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:17:56,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:17:56,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-05 08:17:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925493073] [2024-11-05 08:17:56,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:17:56,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 08:17:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:56,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 08:17:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-05 08:17:56,662 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:57,069 INFO L93 Difference]: Finished difference Result 308 states and 430 transitions. [2024-11-05 08:17:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-05 08:17:57,069 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-05 08:17:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:57,071 INFO L225 Difference]: With dead ends: 308 [2024-11-05 08:17:57,071 INFO L226 Difference]: Without dead ends: 206 [2024-11-05 08:17:57,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-11-05 08:17:57,072 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 36 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:57,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 400 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 208 Unchecked, 0.3s Time] [2024-11-05 08:17:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-05 08:17:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 145. [2024-11-05 08:17:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.309090909090909) internal successors, (144), 115 states have internal predecessors, (144), 20 states have call successors, (20), 10 states have call predecessors, (20), 14 states have return successors, (29), 19 states have call predecessors, (29), 19 states have call successors, (29) [2024-11-05 08:17:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 193 transitions. [2024-11-05 08:17:57,105 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 193 transitions. Word has length 41 [2024-11-05 08:17:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:57,105 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 193 transitions. [2024-11-05 08:17:57,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 193 transitions. [2024-11-05 08:17:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 08:17:57,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:57,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:57,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:57,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:17:57,309 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:57,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1326550796, now seen corresponding path program 1 times [2024-11-05 08:17:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:57,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1696847914] [2024-11-05 08:17:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:57,310 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:17:57,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:57,311 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:17:57,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-05 08:17:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:57,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 08:17:57,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 08:17:57,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 08:17:57,427 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1696847914] [2024-11-05 08:17:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1696847914] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:57,428 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:57,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-05 08:17:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551770175] [2024-11-05 08:17:57,428 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:57,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:17:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:57,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:17:57,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:17:57,429 INFO L87 Difference]: Start difference. First operand 145 states and 193 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:57,456 INFO L93 Difference]: Finished difference Result 268 states and 359 transitions. [2024-11-05 08:17:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:17:57,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-05 08:17:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:57,459 INFO L225 Difference]: With dead ends: 268 [2024-11-05 08:17:57,459 INFO L226 Difference]: Without dead ends: 139 [2024-11-05 08:17:57,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 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:17:57,459 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 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:17:57,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:17:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-05 08:17:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-05 08:17:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 109 states have internal predecessors, (135), 20 states have call successors, (20), 10 states have call predecessors, (20), 14 states have return successors, (29), 19 states have call predecessors, (29), 19 states have call successors, (29) [2024-11-05 08:17:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 184 transitions. [2024-11-05 08:17:57,484 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 184 transitions. Word has length 41 [2024-11-05 08:17:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:57,484 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 184 transitions. [2024-11-05 08:17:57,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2024-11-05 08:17:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 08:17:57,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:57,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:57,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:57,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:17:57,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:57,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1186002186, now seen corresponding path program 1 times [2024-11-05 08:17:57,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:57,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [939430092] [2024-11-05 08:17:57,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:57,689 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:17:57,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:57,690 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:17:57,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-05 08:17:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:57,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:17:57,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 08:17:57,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 08:17:57,824 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:57,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [939430092] [2024-11-05 08:17:57,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [939430092] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:57,824 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:57,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2024-11-05 08:17:57,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618079090] [2024-11-05 08:17:57,825 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:57,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:17:57,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:57,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:17:57,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:17:57,826 INFO L87 Difference]: Start difference. First operand 139 states and 184 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:57,855 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2024-11-05 08:17:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:17:57,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-05 08:17:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:57,857 INFO L225 Difference]: With dead ends: 246 [2024-11-05 08:17:57,857 INFO L226 Difference]: Without dead ends: 123 [2024-11-05 08:17:57,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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:17:57,858 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 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:17:57,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:17:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-05 08:17:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-05 08:17:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 95 states have internal predecessors, (112), 18 states have call successors, (18), 10 states have call predecessors, (18), 14 states have return successors, (26), 17 states have call predecessors, (26), 17 states have call successors, (26) [2024-11-05 08:17:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 156 transitions. [2024-11-05 08:17:57,874 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 156 transitions. Word has length 41 [2024-11-05 08:17:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:57,875 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 156 transitions. [2024-11-05 08:17:57,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 156 transitions. [2024-11-05 08:17:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 08:17:57,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:57,875 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 08:17:57,882 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 (14)] Ended with exit code 0 [2024-11-05 08:17:58,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:17:58,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:58,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash 964483973, now seen corresponding path program 1 times [2024-11-05 08:17:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:58,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [77666197] [2024-11-05 08:17:58,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:58,077 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:17:58,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:58,078 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:17:58,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-05 08:17:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 08:17:58,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 08:17:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 08:17:58,273 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 08:17:58,273 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 08:17:58,274 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 08:17:58,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:58,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:17:58,478 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:58,503 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 08:17:58,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 08:17:58 BoogieIcfgContainer [2024-11-05 08:17:58,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 08:17:58,506 INFO L158 Benchmark]: Toolchain (without parser) took 19326.27ms. Allocated memory was 187.7MB in the beginning and 375.4MB in the end (delta: 187.7MB). Free memory was 124.8MB in the beginning and 175.4MB in the end (delta: -50.6MB). Peak memory consumption was 137.9MB. Max. memory is 8.0GB. [2024-11-05 08:17:58,506 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory was 140.1MB in the beginning and 140.0MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 08:17:58,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1397.12ms. Allocated memory was 187.7MB in the beginning and 300.9MB in the end (delta: 113.2MB). Free memory was 124.5MB in the beginning and 112.5MB in the end (delta: 12.0MB). Peak memory consumption was 127.9MB. Max. memory is 8.0GB. [2024-11-05 08:17:58,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.42ms. Allocated memory is still 300.9MB. Free memory was 112.5MB in the beginning and 106.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2024-11-05 08:17:58,507 INFO L158 Benchmark]: Boogie Preprocessor took 67.30ms. Allocated memory is still 300.9MB. Free memory was 106.7MB in the beginning and 102.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-05 08:17:58,507 INFO L158 Benchmark]: RCFGBuilder took 481.57ms. Allocated memory is still 300.9MB. Free memory was 102.0MB in the beginning and 243.1MB in the end (delta: -141.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 08:17:58,507 INFO L158 Benchmark]: TraceAbstraction took 17299.35ms. Allocated memory was 300.9MB in the beginning and 375.4MB in the end (delta: 74.4MB). Free memory was 242.0MB in the beginning and 175.4MB in the end (delta: 66.6MB). Peak memory consumption was 141.1MB. Max. memory is 8.0GB. [2024-11-05 08:17:58,508 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory was 140.1MB in the beginning and 140.0MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1397.12ms. Allocated memory was 187.7MB in the beginning and 300.9MB in the end (delta: 113.2MB). Free memory was 124.5MB in the beginning and 112.5MB in the end (delta: 12.0MB). Peak memory consumption was 127.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.42ms. Allocated memory is still 300.9MB. Free memory was 112.5MB in the beginning and 106.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.30ms. Allocated memory is still 300.9MB. Free memory was 106.7MB in the beginning and 102.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 481.57ms. Allocated memory is still 300.9MB. Free memory was 102.0MB in the beginning and 243.1MB in the end (delta: -141.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 17299.35ms. Allocated memory was 300.9MB in the beginning and 375.4MB in the end (delta: 74.4MB). Free memory was 242.0MB in the beginning and 175.4MB in the end (delta: 66.6MB). Peak memory consumption was 141.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7355] CALL aws_linked_list_init_harness() [L7344] struct aws_linked_list list; VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7350] CALL aws_linked_list_init(&list) VAL [\old(list)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4771] CALL assume_abort_if_not((list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4771] RET assume_abort_if_not((list)) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4772] list->head.next = &list->tail [L4773-L4774] list->head.prev = ((void *)0) [L4776] list->tail.prev = &list->head [L4777-L4778] list->tail.next = ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4780] CALL, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4780] RET, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4780] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 489 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 462 mSDsluCounter, 5340 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 208 IncrementalHoareTripleChecker+Unchecked, 4508 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1765 IncrementalHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 832 mSDtfsCounter, 1765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 920 GetRequests, 763 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=11, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 141 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 884 ConstructedInterpolants, 54 QuantifiedInterpolants, 4744 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1686 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 38/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-05 08:17:58,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...