./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_array_list_init_static_harness_negated.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_array_list_init_static_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2c7620c04b53a1111f5b17144531c175c6eddb6cd3ee4753e0e2343c89b58c63 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:59:59,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:59:59,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:59:59,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:59:59,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:59:59,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:59:59,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:59:59,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:59:59,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:59:59,369 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:59:59,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:59:59,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:59:59,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:59:59,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:59:59,372 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:59:59,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:59:59,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:59:59,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:59:59,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:59:59,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:59:59,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:59:59,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:59:59,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:59:59,374 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:59:59,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:59:59,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:59:59,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:59:59,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:59:59,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:59:59,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:59:59,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:59:59,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:59:59,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:59:59,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:59:59,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:59:59,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:59:59,377 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:59:59,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:59:59,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:59:59,379 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c7620c04b53a1111f5b17144531c175c6eddb6cd3ee4753e0e2343c89b58c63 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 07:59:59,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:59:59,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:59:59,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:59:59,794 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:59:59,794 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:59:59,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_array_list_init_static_harness_negated.i [2023-11-23 08:00:01,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:00:01,513 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:00:01,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_array_list_init_static_harness_negated.i [2023-11-23 08:00:01,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a447320/cd68df3e705f452782b3e6ca67137a3e/FLAG7a32e6d2f [2023-11-23 08:00:01,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a447320/cd68df3e705f452782b3e6ca67137a3e [2023-11-23 08:00:01,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:00:01,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:00:01,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:00:01,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:00:01,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:00:01,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:00:01" (1/1) ... [2023-11-23 08:00:01,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143406c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:01, skipping insertion in model container [2023-11-23 08:00:01,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:00:01" (1/1) ... [2023-11-23 08:00:01,711 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:00:01,931 WARN L240 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_array_list_init_static_harness_negated.i[4500,4513] [2023-11-23 08:00:01,938 WARN L240 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_array_list_init_static_harness_negated.i[4560,4573] [2023-11-23 08:00:02,476 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,477 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,478 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,478 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,479 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,488 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,493 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,495 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,495 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,497 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,498 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,498 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,499 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,716 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:00:02,719 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:00:02,720 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:00:02,721 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:00:02,725 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:00:02,726 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:00:02,726 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:00:02,728 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:00:02,729 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:00:02,729 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:00:02,810 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,818 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:00:02,855 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:00:02,874 WARN L240 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_array_list_init_static_harness_negated.i[4500,4513] [2023-11-23 08:00:02,875 WARN L240 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_array_list_init_static_harness_negated.i[4560,4573] [2023-11-23 08:00:02,921 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,927 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,927 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,928 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,929 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,941 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,941 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,942 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,943 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,944 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,944 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,947 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,947 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:02,978 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:00:02,979 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:00:02,979 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:00:02,980 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:00:02,981 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:00:02,982 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:00:02,982 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:00:02,983 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:00:02,983 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:00:02,983 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:00:03,019 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:03,026 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:03,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:00:03,183 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,184 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,184 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,184 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,184 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,184 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,184 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,184 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,184 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,185 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,185 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,185 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,185 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,185 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:03,191 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:00:03,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03 WrapperNode [2023-11-23 08:00:03,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:00:03,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:00:03,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:00:03,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:00:03,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,279 INFO L138 Inliner]: procedures = 680, calls = 1246, calls flagged for inlining = 53, calls inlined = 9, statements flattened = 161 [2023-11-23 08:00:03,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:00:03,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:00:03,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:00:03,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:00:03,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:00:03,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:00:03,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:00:03,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:00:03,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (1/1) ... [2023-11-23 08:00:03,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:00:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:00:03,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 08:00:03,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 08:00:03,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:00:03,423 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2023-11-23 08:00:03,423 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2023-11-23 08:00:03,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:00:03,424 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-23 08:00:03,424 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-23 08:00:03,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:00:03,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:00:03,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:00:03,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:00:03,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:00:03,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:00:03,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:00:03,426 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:00:03,426 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:00:03,426 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2023-11-23 08:00:03,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2023-11-23 08:00:03,426 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2023-11-23 08:00:03,426 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2023-11-23 08:00:03,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:00:03,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:00:03,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:00:03,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:00:03,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:00:03,427 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2023-11-23 08:00:03,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2023-11-23 08:00:03,427 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:00:03,428 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:00:03,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 08:00:03,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:00:03,737 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:00:03,740 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:00:03,971 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:00:04,000 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:00:04,001 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 08:00:04,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:00:04 BoogieIcfgContainer [2023-11-23 08:00:04,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:00:04,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:00:04,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:00:04,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:00:04,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:00:01" (1/3) ... [2023-11-23 08:00:04,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b17e915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:00:04, skipping insertion in model container [2023-11-23 08:00:04,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:03" (2/3) ... [2023-11-23 08:00:04,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b17e915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:00:04, skipping insertion in model container [2023-11-23 08:00:04,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:00:04" (3/3) ... [2023-11-23 08:00:04,007 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_init_static_harness_negated.i [2023-11-23 08:00:04,021 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:00:04,021 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:00:04,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:00:04,072 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5353a69f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:00:04,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:00:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 53 states have internal predecessors, (63), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-23 08:00:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 08:00:04,086 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:00:04,087 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:00:04,087 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:00:04,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:00:04,093 INFO L85 PathProgramCache]: Analyzing trace with hash 453604280, now seen corresponding path program 1 times [2023-11-23 08:00:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:00:04,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321985440] [2023-11-23 08:00:04,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:04,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:00:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:00:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:00:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321985440] [2023-11-23 08:00:04,478 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-23 08:00:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765819433] [2023-11-23 08:00:04,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:04,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:00:04,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:00:04,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:00:04,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 08:00:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:00:04,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 08:00:04,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:00:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-11-23 08:00:04,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:00:04,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765819433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:00:04,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:00:04,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:00:04,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365171211] [2023-11-23 08:00:04,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:00:04,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:00:04,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:00:04,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:00:04,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:00:04,791 INFO L87 Difference]: Start difference. First operand has 93 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 53 states have internal predecessors, (63), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 08:00:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:00:04,827 INFO L93 Difference]: Finished difference Result 184 states and 265 transitions. [2023-11-23 08:00:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:00:04,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 83 [2023-11-23 08:00:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:00:04,839 INFO L225 Difference]: With dead ends: 184 [2023-11-23 08:00:04,839 INFO L226 Difference]: Without dead ends: 88 [2023-11-23 08:00:04,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:00:04,845 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:00:04,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:00:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-23 08:00:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-23 08:00:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.163265306122449) internal successors, (57), 50 states have internal predecessors, (57), 30 states have call successors, (30), 9 states have call predecessors, (30), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 08:00:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2023-11-23 08:00:04,895 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 83 [2023-11-23 08:00:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:00:04,895 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2023-11-23 08:00:04,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 08:00:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2023-11-23 08:00:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 08:00:04,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:00:04,898 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:00:04,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 08:00:05,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-23 08:00:05,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:00:05,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:00:05,105 INFO L85 PathProgramCache]: Analyzing trace with hash 355263358, now seen corresponding path program 1 times [2023-11-23 08:00:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:00:05,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876926114] [2023-11-23 08:00:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:00:05,181 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 08:00:05,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289154105] [2023-11-23 08:00:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:05,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:00:05,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:00:05,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:00:05,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 08:00:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:00:05,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 08:00:05,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:00:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-11-23 08:00:05,438 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:00:05,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:00:05,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876926114] [2023-11-23 08:00:05,439 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 08:00:05,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289154105] [2023-11-23 08:00:05,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289154105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:00:05,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:00:05,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:00:05,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79598231] [2023-11-23 08:00:05,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:00:05,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:00:05,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:00:05,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:00:05,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:00:05,442 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-23 08:00:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:00:05,544 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2023-11-23 08:00:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:00:05,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 83 [2023-11-23 08:00:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:00:05,546 INFO L225 Difference]: With dead ends: 151 [2023-11-23 08:00:05,546 INFO L226 Difference]: Without dead ends: 88 [2023-11-23 08:00:05,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:00:05,548 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 32 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:00:05,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 394 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:00:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-23 08:00:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-23 08:00:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 50 states have internal predecessors, (56), 30 states have call successors, (30), 9 states have call predecessors, (30), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 08:00:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2023-11-23 08:00:05,558 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 83 [2023-11-23 08:00:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:00:05,559 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2023-11-23 08:00:05,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-23 08:00:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2023-11-23 08:00:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-23 08:00:05,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:00:05,561 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:00:05,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:00:05,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-23 08:00:05,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:00:05,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:00:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1477870221, now seen corresponding path program 1 times [2023-11-23 08:00:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:00:05,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055072864] [2023-11-23 08:00:05,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:05,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:00:05,851 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 08:00:05,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272447499] [2023-11-23 08:00:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:05,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:00:05,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:00:05,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:00:05,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 08:00:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:00:06,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 08:00:06,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:00:06,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 08:00:06,368 WARN L876 $PredicateComparison]: unable to prove that (exists ((|aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| Int) (|aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| Int)) (and (<= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |c_aws_mul_size_checked_#in~r#1.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| (store (select |c_old(#memory_$Pointer$.base)| |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base|) |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| (select (select |c_#memory_$Pointer$.base| |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base|) |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset|)))))) is different from true [2023-11-23 08:00:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-11-23 08:00:06,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:00:06,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:00:06,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055072864] [2023-11-23 08:00:06,582 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 08:00:06,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272447499] [2023-11-23 08:00:06,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272447499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:00:06,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:00:06,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-23 08:00:06,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426297722] [2023-11-23 08:00:06,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:00:06,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 08:00:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:00:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 08:00:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=197, Unknown=6, NotChecked=28, Total=272 [2023-11-23 08:00:06,585 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 7 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-23 08:00:08,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:00:10,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:00:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:00:12,469 INFO L93 Difference]: Finished difference Result 193 states and 259 transitions. [2023-11-23 08:00:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-23 08:00:12,470 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 7 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 96 [2023-11-23 08:00:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:00:12,492 INFO L225 Difference]: With dead ends: 193 [2023-11-23 08:00:12,492 INFO L226 Difference]: Without dead ends: 132 [2023-11-23 08:00:12,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=574, Unknown=7, NotChecked=50, Total=756 [2023-11-23 08:00:12,494 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 83 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 56 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:00:12,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 457 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 984 Invalid, 2 Unknown, 237 Unchecked, 5.5s Time] [2023-11-23 08:00:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-23 08:00:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 91. [2023-11-23 08:00:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-23 08:00:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2023-11-23 08:00:12,531 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 96 [2023-11-23 08:00:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:00:12,532 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2023-11-23 08:00:12,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 7 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-23 08:00:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2023-11-23 08:00:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-23 08:00:12,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:00:12,538 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:00:12,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 08:00:12,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:00:12,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:00:12,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:00:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1135846503, now seen corresponding path program 1 times [2023-11-23 08:00:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:00:12,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295011663] [2023-11-23 08:00:12,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:12,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:00:12,819 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 08:00:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1994165900] [2023-11-23 08:00:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:12,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:00:12,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:00:12,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:00:12,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 08:00:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 08:00:13,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 08:00:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 08:00:14,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 08:00:14,059 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 08:00:14,060 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 08:00:14,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 08:00:14,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:00:14,281 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-23 08:00:14,283 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 08:00:14,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated [2023-11-23 08:00:14,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret791 could not be translated [2023-11-23 08:00:14,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret791 could not be translated [2023-11-23 08:00:14,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem792 could not be translated [2023-11-23 08:00:14,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret793 [2023-11-23 08:00:14,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem792 could not be translated [2023-11-23 08:00:14,371 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated [2023-11-23 08:00:14,372 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret128 could not be translated [2023-11-23 08:00:14,373 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated [2023-11-23 08:00:14,373 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem131 could not be translated [2023-11-23 08:00:14,373 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated [2023-11-23 08:00:14,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated [2023-11-23 08:00:14,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem131 could not be translated [2023-11-23 08:00:14,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret132 could not be translated [2023-11-23 08:00:14,375 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated [2023-11-23 08:00:14,375 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem136 [2023-11-23 08:00:14,375 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem135 could not be translated [2023-11-23 08:00:14,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem138 could not be translated [2023-11-23 08:00:14,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem136 [2023-11-23 08:00:14,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated [2023-11-23 08:00:14,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated [2023-11-23 08:00:14,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem135 could not be translated [2023-11-23 08:00:14,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated [2023-11-23 08:00:14,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem136 [2023-11-23 08:00:14,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem138 could not be translated [2023-11-23 08:00:14,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated [2023-11-23 08:00:14,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated [2023-11-23 08:00:14,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem135 could not be translated [2023-11-23 08:00:14,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated [2023-11-23 08:00:14,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret129 could not be translated [2023-11-23 08:00:14,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:00:14 BoogieIcfgContainer [2023-11-23 08:00:14,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 08:00:14,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 08:00:14,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 08:00:14,397 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 08:00:14,398 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:00:04" (3/4) ... [2023-11-23 08:00:14,400 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 08:00:14,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 08:00:14,401 INFO L158 Benchmark]: Toolchain (without parser) took 12820.84ms. Allocated memory was 165.7MB in the beginning and 278.9MB in the end (delta: 113.2MB). Free memory was 90.1MB in the beginning and 125.1MB in the end (delta: -35.0MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2023-11-23 08:00:14,401 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:00:14,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1607.65ms. Allocated memory is still 165.7MB. Free memory was 89.8MB in the beginning and 79.7MB in the end (delta: 10.1MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2023-11-23 08:00:14,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.12ms. Allocated memory is still 165.7MB. Free memory was 79.7MB in the beginning and 73.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 08:00:14,402 INFO L158 Benchmark]: Boogie Preprocessor took 53.15ms. Allocated memory is still 165.7MB. Free memory was 73.4MB in the beginning and 69.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 08:00:14,402 INFO L158 Benchmark]: RCFGBuilder took 667.84ms. Allocated memory was 165.7MB in the beginning and 278.9MB in the end (delta: 113.2MB). Free memory was 69.9MB in the beginning and 210.2MB in the end (delta: -140.2MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-11-23 08:00:14,402 INFO L158 Benchmark]: TraceAbstraction took 10393.99ms. Allocated memory is still 278.9MB. Free memory was 210.2MB in the beginning and 125.1MB in the end (delta: 85.0MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2023-11-23 08:00:14,402 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 278.9MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:00:14,403 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.15ms. Allocated memory is still 165.7MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1607.65ms. Allocated memory is still 165.7MB. Free memory was 89.8MB in the beginning and 79.7MB in the end (delta: 10.1MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.12ms. Allocated memory is still 165.7MB. Free memory was 79.7MB in the beginning and 73.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.15ms. Allocated memory is still 165.7MB. Free memory was 73.4MB in the beginning and 69.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 667.84ms. Allocated memory was 165.7MB in the beginning and 278.9MB in the end (delta: 113.2MB). Free memory was 69.9MB in the beginning and 210.2MB in the end (delta: -140.2MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10393.99ms. Allocated memory is still 278.9MB. Free memory was 210.2MB in the beginning and 125.1MB in the end (delta: 85.0MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 278.9MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret791 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret791 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem792 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret793 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem792 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem131 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem131 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret132 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem136 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem135 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem138 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem136 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem135 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem136 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem138 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem135 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short141 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret129 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 223]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of __builtin_umull_overflow at line 255. Possible FailurePath: [L2762-L2767] 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, }; [L7327] static __thread int tl_last_error = 0; [L7583] CALL aws_array_list_init_static_harness() [L7554] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7554] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7554] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7554] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7557] size_t item_size; [L7558] size_t initial_item_allocation; [L7559] size_t len; VAL [len={10:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7562] CALL assume_abort_if_not(initial_item_allocation > 0 && initial_item_allocation <= 9223372036854775808U) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7562] RET assume_abort_if_not(initial_item_allocation > 0 && initial_item_allocation <= 9223372036854775808U) VAL [initial_item_allocation=9223372036854775808, len={10:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7563] CALL assume_abort_if_not(item_size > 0 && item_size <= 2) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7563] RET assume_abort_if_not(item_size > 0 && item_size <= 2) VAL [initial_item_allocation=9223372036854775808, item_size=2, len={10:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7564] CALL, EXPR aws_mul_size_checked(initial_item_allocation, item_size, &len) VAL [\old(tl_last_error)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, a=9223372036854775808, b=2, r={10:0}, r={10:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, \result=0, a=9223372036854775808, b=2, r={10:0}, r={10:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L7564] RET, EXPR aws_mul_size_checked(initial_item_allocation, item_size, &len) VAL [initial_item_allocation=9223372036854775808, item_size=2, len={10:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7564] CALL assume_abort_if_not(!aws_mul_size_checked(initial_item_allocation, item_size, &len)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7564] RET assume_abort_if_not(!aws_mul_size_checked(initial_item_allocation, item_size, &len)) VAL [initial_item_allocation=9223372036854775808, item_size=2, len={10:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7567] EXPR \read(len) VAL [initial_item_allocation=9223372036854775808, item_size=2, len={10:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7567] CALL, EXPR bounded_malloc(len) VAL [\old(size)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2779-L2781] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2779-L2781] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=0, s_can_fail_allocator_static={4:0}, size=0, tl_last_error=0] [L2782] return malloc(size); [L7567] RET, EXPR bounded_malloc(len) VAL [initial_item_allocation=9223372036854775808, item_size=2, len={10:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7567] uint8_t *raw_array = bounded_malloc(len); [L7568] struct store_byte_from_buffer old_byte; [L7569] EXPR \read(len) [L7569] CALL save_byte_from_array(raw_array, len, &old_byte) [L7171] COND FALSE !(size > 0 && array && storage) VAL [\old(size)=0, array={5:0}, array={5:0}, s_can_fail_allocator_static={4:0}, size=0, storage={11:0}, storage={11:0}, tl_last_error=0] [L7569] RET save_byte_from_array(raw_array, len, &old_byte) [L7571] CALL aws_array_list_init_static(&list, raw_array, initial_item_allocation, item_size) [L3237-L3239] CALL assume_abort_if_not((list != ((void *)0) )) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3237-L3239] RET assume_abort_if_not((list != ((void *)0) )) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={7:0}, list={7:0}, raw_array={5:0}, raw_array={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3240-L3242] CALL assume_abort_if_not((raw_array != ((void *)0) )) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3240-L3242] RET assume_abort_if_not((raw_array != ((void *)0) )) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={7:0}, list={7:0}, raw_array={5:0}, raw_array={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3243] CALL assume_abort_if_not((item_count > 0)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3243] RET assume_abort_if_not((item_count > 0)) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={7:0}, list={7:0}, raw_array={5:0}, raw_array={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3244] CALL assume_abort_if_not((item_size > 0)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3244] RET assume_abort_if_not((item_size > 0)) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={7:0}, list={7:0}, raw_array={5:0}, raw_array={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3246-L3247] list->alloc = ((void *)0) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={7:0}, list={7:0}, raw_array={5:0}, raw_array={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3250] CALL, EXPR aws_mul_size_checked(item_count, item_size, &list->current_size) VAL [\old(tl_last_error)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, a=9223372036854775808, b=2, r={7:8}, r={7:8}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, \result=0, a=9223372036854775808, b=2, r={7:8}, r={7:8}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3250] RET, EXPR aws_mul_size_checked(item_count, item_size, &list->current_size) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={7:0}, list={7:0}, raw_array={5:0}, raw_array={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3250] int no_overflow = !aws_mul_size_checked(item_count, item_size, &list->current_size); [L3251] CALL assume_abort_if_not((no_overflow)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3251] RET assume_abort_if_not((no_overflow)) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={7:0}, list={7:0}, no_overflow=1, raw_array={5:0}, raw_array={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3253] list->item_size = item_size [L3254] list->length = 0 [L3255] list->data = raw_array VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={7:0}, list={7:0}, no_overflow=1, raw_array={5:0}, raw_array={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3256] CALL, EXPR aws_array_list_is_valid(list) VAL [\old(tl_last_error)=0, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size VAL [\old(tl_last_error)=0, list={7:0}, list={7:0}, required_size={9:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) VAL [\old(a)=0, \old(b)=2, \old(tl_last_error)=0, r={9:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) VAL [\old(a)=0, \old(b)=2, \old(tl_last_error)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) VAL [\old(a)=0, \old(b)=2, \old(tl_last_error)=0, a=0, b=2, r={9:0}, r={9:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); VAL [\old(a)=0, \old(b)=2, \old(tl_last_error)=0, \result=0, a=0, b=2, r={9:0}, r={9:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) VAL [\old(tl_last_error)=0, list={7:0}, list={7:0}, required_size={9:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) VAL [\old(tl_last_error)=0, current_size_is_valid=1, list={7:0}, list={7:0}, required_size={9:0}, required_size_is_valid=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3281] EXPR list->current_size [L3281] EXPR (((list->current_size)) == 0) || ((list->data)) VAL [\old(tl_last_error)=0, current_size_is_valid=1, list={7:0}, list={7:0}, required_size={9:0}, required_size_is_valid=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) VAL [\old(tl_last_error)=0, current_size_is_valid=1, list={7:0}, list={7:0}, required_size={9:0}, required_size_is_valid=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; VAL [\old(tl_last_error)=0, \result=1, current_size_is_valid=1, data_is_valid=1, item_size_is_valid=1, list={7:0}, list={7:0}, required_size_is_valid=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3256] RET, EXPR aws_array_list_is_valid(list) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={7:0}, list={7:0}, no_overflow=1, raw_array={5:0}, raw_array={5:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3256] CALL __VERIFIER_assert(!((aws_array_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, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 963 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 237 IncrementalHoareTripleChecker+Unchecked, 679 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1099 IncrementalHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 284 mSDtfsCounter, 1099 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 41 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 443 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 259 ConstructedInterpolants, 9 QuantifiedInterpolants, 697 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1816 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 467/467 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 could not prove your program: unable to determine feasibility of some traces [2023-11-23 08:00:14,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_array_list_init_static_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2c7620c04b53a1111f5b17144531c175c6eddb6cd3ee4753e0e2343c89b58c63 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:00:16,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:00:16,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-23 08:00:16,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:00:16,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:00:16,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:00:16,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:00:16,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:00:16,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:00:16,940 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:00:16,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:00:16,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:00:16,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:00:16,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:00:16,942 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:00:16,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:00:16,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:00:16,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:00:16,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:00:16,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:00:16,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:00:16,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 08:00:16,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 08:00:16,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 08:00:16,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:00:16,951 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:00:16,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:00:16,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:00:16,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:00:16,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:00:16,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:00:16,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:00:16,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:00:16,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:00:16,953 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 08:00:16,953 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 08:00:16,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:00:16,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:00:16,954 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:00:16,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:00:16,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:00:16,955 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 08:00:16,955 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c7620c04b53a1111f5b17144531c175c6eddb6cd3ee4753e0e2343c89b58c63 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:00:17,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:00:17,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:00:17,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:00:17,293 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:00:17,294 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:00:17,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_array_list_init_static_harness_negated.i [2023-11-23 08:00:18,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:00:18,901 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:00:18,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_array_list_init_static_harness_negated.i [2023-11-23 08:00:18,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc4cd363/6da782b481a946a0b7c9e268ab24956b/FLAG24c14a40e [2023-11-23 08:00:18,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc4cd363/6da782b481a946a0b7c9e268ab24956b [2023-11-23 08:00:18,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:00:18,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:00:18,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:00:18,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:00:18,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:00:18,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:00:18" (1/1) ... [2023-11-23 08:00:18,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462831f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:18, skipping insertion in model container [2023-11-23 08:00:18,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:00:18" (1/1) ... [2023-11-23 08:00:19,054 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:00:19,276 WARN L240 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_array_list_init_static_harness_negated.i[4500,4513] [2023-11-23 08:00:19,283 WARN L240 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_array_list_init_static_harness_negated.i[4560,4573] [2023-11-23 08:00:19,839 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,839 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,840 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,843 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,843 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,857 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,858 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,859 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,859 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,860 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,861 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,862 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:19,863 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,086 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:00:20,090 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:00:20,090 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:00:20,091 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:00:20,117 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:00:20,117 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:00:20,118 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:00:20,118 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:00:20,118 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:00:20,119 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:00:20,206 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,214 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:00:20,245 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-23 08:00:20,285 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:00:20,290 WARN L240 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_array_list_init_static_harness_negated.i[4500,4513] [2023-11-23 08:00:20,291 WARN L240 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_array_list_init_static_harness_negated.i[4560,4573] [2023-11-23 08:00:20,352 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,354 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,354 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,355 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,355 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,359 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,360 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,362 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,363 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,364 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,364 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,365 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,366 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,414 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:00:20,415 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:00:20,416 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:00:20,417 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:00:20,418 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:00:20,419 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:00:20,419 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:00:20,419 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:00:20,420 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:00:20,420 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:00:20,454 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,459 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:00:20,481 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:00:20,497 WARN L240 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_array_list_init_static_harness_negated.i[4500,4513] [2023-11-23 08:00:20,498 WARN L240 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_array_list_init_static_harness_negated.i[4560,4573] [2023-11-23 08:00:20,528 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,528 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,529 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,529 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,529 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,542 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,542 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,543 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,544 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,544 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,545 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,545 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,545 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,590 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:00:20,591 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:00:20,592 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:00:20,592 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:00:20,593 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:00:20,593 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:00:20,593 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:00:20,594 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:00:20,594 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:00:20,594 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:00:20,619 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,624 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:00:20,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:00:20,830 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,831 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,831 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,831 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,831 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,831 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,831 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,832 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,832 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,832 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,832 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,832 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,832 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,832 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:00:20,838 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:00:20,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20 WrapperNode [2023-11-23 08:00:20,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:00:20,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:00:20,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:00:20,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:00:20,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:20,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:21,046 INFO L138 Inliner]: procedures = 699, calls = 1246, calls flagged for inlining = 53, calls inlined = 9, statements flattened = 158 [2023-11-23 08:00:21,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:00:21,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:00:21,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:00:21,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:00:21,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:21,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:21,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:21,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:21,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:21,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:21,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:21,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:21,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:00:21,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:00:21,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:00:21,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:00:21,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (1/1) ... [2023-11-23 08:00:21,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:00:21,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:00:21,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 08:00:21,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 08:00:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:00:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2023-11-23 08:00:21,259 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2023-11-23 08:00:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 08:00:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2023-11-23 08:00:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-23 08:00:21,260 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-23 08:00:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:00:21,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:00:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:00:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:00:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:00:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:00:21,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:00:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:00:21,262 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:00:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-23 08:00:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2023-11-23 08:00:21,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2023-11-23 08:00:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2023-11-23 08:00:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2023-11-23 08:00:21,263 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2023-11-23 08:00:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:00:21,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:00:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:00:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:00:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2023-11-23 08:00:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-23 08:00:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:00:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2023-11-23 08:00:21,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2023-11-23 08:00:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:00:21,265 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:00:21,491 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:00:21,493 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:00:23,114 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:00:23,150 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:00:23,150 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 08:00:23,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:00:23 BoogieIcfgContainer [2023-11-23 08:00:23,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:00:23,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:00:23,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:00:23,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:00:23,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:00:18" (1/3) ... [2023-11-23 08:00:23,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f978a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:00:23, skipping insertion in model container [2023-11-23 08:00:23,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:00:20" (2/3) ... [2023-11-23 08:00:23,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f978a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:00:23, skipping insertion in model container [2023-11-23 08:00:23,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:00:23" (3/3) ... [2023-11-23 08:00:23,159 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_init_static_harness_negated.i [2023-11-23 08:00:23,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:00:23,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:00:23,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:00:23,228 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1dc8e1e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:00:23,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:00:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-23 08:00:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:00:23,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:00:23,248 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:00:23,248 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:00:23,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:00:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1433027268, now seen corresponding path program 1 times [2023-11-23 08:00:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:00:23,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367036483] [2023-11-23 08:00:23,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:23,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:00:23,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:00:23,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:00:23,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 08:00:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:00:23,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 08:00:23,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:00:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-11-23 08:00:23,775 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:00:23,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:00:23,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367036483] [2023-11-23 08:00:23,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367036483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:00:23,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:00:23,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:00:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789907296] [2023-11-23 08:00:23,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:00:23,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:00:23,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:00:23,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:00:23,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:00:23,802 INFO L87 Difference]: Start difference. First operand has 92 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 08:00:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:00:23,900 INFO L93 Difference]: Finished difference Result 182 states and 263 transitions. [2023-11-23 08:00:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:00:23,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 82 [2023-11-23 08:00:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:00:23,908 INFO L225 Difference]: With dead ends: 182 [2023-11-23 08:00:23,909 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 08:00:23,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:00:23,914 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:00:23,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:00:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 08:00:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-23 08:00:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 30 states have call successors, (30), 9 states have call predecessors, (30), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 08:00:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2023-11-23 08:00:23,947 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 82 [2023-11-23 08:00:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:00:23,948 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2023-11-23 08:00:23,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 08:00:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2023-11-23 08:00:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:00:23,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:00:23,951 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:00:23,965 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 [2023-11-23 08:00:24,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:00:24,163 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:00:24,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:00:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1870546954, now seen corresponding path program 1 times [2023-11-23 08:00:24,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:00:24,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025136048] [2023-11-23 08:00:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:24,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:00:24,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:00:24,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:00:24,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-23 08:00:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:00:24,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:00:24,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:00:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-11-23 08:00:24,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:00:24,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:00:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025136048] [2023-11-23 08:00:24,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025136048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:00:24,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:00:24,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:00:24,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114727502] [2023-11-23 08:00:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:00:24,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:00:24,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:00:24,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:00:24,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:00:24,811 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-23 08:00:26,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:00:28,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:00:29,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:00:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:00:30,174 INFO L93 Difference]: Finished difference Result 150 states and 191 transitions. [2023-11-23 08:00:30,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:00:30,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 82 [2023-11-23 08:00:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:00:30,177 INFO L225 Difference]: With dead ends: 150 [2023-11-23 08:00:30,177 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 08:00:30,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:00:30,178 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 32 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:00:30,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 390 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2023-11-23 08:00:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 08:00:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-23 08:00:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 30 states have call successors, (30), 9 states have call predecessors, (30), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 08:00:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2023-11-23 08:00:30,195 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 82 [2023-11-23 08:00:30,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:00:30,196 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2023-11-23 08:00:30,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-23 08:00:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2023-11-23 08:00:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-23 08:00:30,202 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:00:30,203 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:00:30,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:00:30,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:00:30,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:00:30,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:00:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash 334753757, now seen corresponding path program 1 times [2023-11-23 08:00:30,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:00:30,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596249620] [2023-11-23 08:00:30,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:00:30,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:00:30,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:00:30,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:00:30,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-23 08:00:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:00:32,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-23 08:00:32,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:00:32,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 08:00:32,923 WARN L876 $PredicateComparison]: unable to prove that (exists ((|aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| (_ BitVec 64))) (= (store |c_old(#memory_$Pointer$.base)| |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| (let ((.cse0 (select |c_#memory_$Pointer$.base| |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base|)) (.cse7 (bvadd (_ bv7 64) |c_aws_mul_size_checked_#in~r#1.offset|))) (store (let ((.cse6 (bvadd (_ bv6 64) |c_aws_mul_size_checked_#in~r#1.offset|))) (store (let ((.cse5 (bvadd |c_aws_mul_size_checked_#in~r#1.offset| (_ bv5 64)))) (store (let ((.cse4 (bvadd (_ bv4 64) |c_aws_mul_size_checked_#in~r#1.offset|))) (store (let ((.cse3 (bvadd (_ bv3 64) |c_aws_mul_size_checked_#in~r#1.offset|))) (store (let ((.cse2 (bvadd (_ bv2 64) |c_aws_mul_size_checked_#in~r#1.offset|))) (store (let ((.cse1 (bvadd (_ bv1 64) |c_aws_mul_size_checked_#in~r#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base|) |c_aws_mul_size_checked_#in~r#1.offset| (select .cse0 |c_aws_mul_size_checked_#in~r#1.offset|)) .cse1 (select .cse0 .cse1))) .cse2 (select .cse0 .cse2))) .cse3 (select .cse0 .cse3))) .cse4 (select .cse0 .cse4))) .cse5 (select .cse0 .cse5))) .cse6 (select .cse0 .cse6))) .cse7 (select .cse0 .cse7)))) |c_#memory_$Pointer$.base|)) is different from true [2023-11-23 08:00:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-11-23 08:00:59,292 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:00:59,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:00:59,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596249620] [2023-11-23 08:00:59,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596249620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:00:59,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:00:59,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-23 08:00:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170112583] [2023-11-23 08:00:59,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:00:59,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 08:00:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:00:59,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 08:00:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=190, Unknown=13, NotChecked=28, Total=272 [2023-11-23 08:00:59,294 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand has 17 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 15 states have internal predecessors, (31), 7 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-23 08:01:01,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:03,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:07,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:09,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:12,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:14,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:16,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:18,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:20,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:23,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:25,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:32,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:34,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:36,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:38,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:41,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:43,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:45,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:47,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:49,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:01:51,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:01:53,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:01:55,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:01:57,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:01:59,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:01,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:02:04,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:12,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:02:14,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:16,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:18,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:28,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:30,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:32,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:34,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:37,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:39,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:42,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:44,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:46,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:48,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:50,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:52,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:57,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:02:59,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:01,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:03,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:06,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:08,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:10,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:12,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:15,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:17,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:19,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:21,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:24,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:26,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:28,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:30,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:33,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:35,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:37,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:39,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:41,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:43,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:46,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:48,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:51,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:53,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:56,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:03:58,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:00,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:03,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:05,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:07,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:09,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:12,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:14,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:16,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:19,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:21,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:24,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:26,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:29,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:31,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:04:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:04:31,200 INFO L93 Difference]: Finished difference Result 192 states and 258 transitions. [2023-11-23 08:04:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-23 08:04:31,283 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 15 states have internal predecessors, (31), 7 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 95 [2023-11-23 08:04:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:04:31,287 INFO L225 Difference]: With dead ends: 192 [2023-11-23 08:04:31,287 INFO L226 Difference]: Without dead ends: 131 [2023-11-23 08:04:31,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=125, Invalid=562, Unknown=19, NotChecked=50, Total=756 [2023-11-23 08:04:31,288 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 114 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 68 mSolverCounterUnsat, 140 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 188.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 140 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 195.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:04:31,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 528 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 911 Invalid, 140 Unknown, 236 Unchecked, 195.7s Time] [2023-11-23 08:04:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-23 08:04:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2023-11-23 08:04:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.14) internal successors, (57), 52 states have internal predecessors, (57), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-23 08:04:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2023-11-23 08:04:31,307 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 95 [2023-11-23 08:04:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:04:31,308 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2023-11-23 08:04:31,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 15 states have internal predecessors, (31), 7 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-23 08:04:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2023-11-23 08:04:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-23 08:04:31,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:04:31,311 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:04:31,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-23 08:04:31,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:04:31,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:04:31,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:04:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1266282121, now seen corresponding path program 1 times [2023-11-23 08:04:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:04:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474527851] [2023-11-23 08:04:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:04:31,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:04:31,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:04:31,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:04:31,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-23 08:04:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 08:04:33,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 08:04:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 08:04:36,007 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-23 08:04:36,008 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 08:04:36,008 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 08:04:36,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-23 08:04:36,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:04:36,213 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-23 08:04:36,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 08:04:36,267 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated [2023-11-23 08:04:36,269 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret782 could not be translated [2023-11-23 08:04:36,271 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret782 could not be translated [2023-11-23 08:04:36,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem783 could not be translated [2023-11-23 08:04:36,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret784 [2023-11-23 08:04:36,277 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem783 could not be translated [2023-11-23 08:04:36,279 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated [2023-11-23 08:04:36,280 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret120 could not be translated [2023-11-23 08:04:36,282 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem123 could not be translated [2023-11-23 08:04:36,283 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem122 could not be translated [2023-11-23 08:04:36,283 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated [2023-11-23 08:04:36,284 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem123 could not be translated [2023-11-23 08:04:36,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem122 could not be translated [2023-11-23 08:04:36,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret124 could not be translated [2023-11-23 08:04:36,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem128 [2023-11-23 08:04:36,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short129 could not be translated [2023-11-23 08:04:36,288 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated [2023-11-23 08:04:36,288 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated [2023-11-23 08:04:36,288 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem128 [2023-11-23 08:04:36,288 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated [2023-11-23 08:04:36,288 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short129 could not be translated [2023-11-23 08:04:36,288 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated [2023-11-23 08:04:36,289 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short132 could not be translated [2023-11-23 08:04:36,289 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated [2023-11-23 08:04:36,289 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem128 [2023-11-23 08:04:36,289 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated [2023-11-23 08:04:36,289 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short129 could not be translated [2023-11-23 08:04:36,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated [2023-11-23 08:04:36,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short132 could not be translated [2023-11-23 08:04:36,293 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret121 could not be translated [2023-11-23 08:04:36,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:04:36 BoogieIcfgContainer [2023-11-23 08:04:36,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 08:04:36,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 08:04:36,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 08:04:36,306 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 08:04:36,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:00:23" (3/4) ... [2023-11-23 08:04:36,308 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 08:04:36,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 08:04:36,309 INFO L158 Benchmark]: Toolchain (without parser) took 257356.17ms. Allocated memory was 58.7MB in the beginning and 272.6MB in the end (delta: 213.9MB). Free memory was 32.7MB in the beginning and 198.3MB in the end (delta: -165.6MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2023-11-23 08:04:36,309 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 44.0MB. Free memory was 22.8MB in the beginning and 22.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:04:36,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1884.55ms. Allocated memory was 58.7MB in the beginning and 94.4MB in the end (delta: 35.7MB). Free memory was 32.5MB in the beginning and 35.3MB in the end (delta: -2.8MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2023-11-23 08:04:36,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 206.06ms. Allocated memory is still 94.4MB. Free memory was 35.3MB in the beginning and 28.6MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 08:04:36,310 INFO L158 Benchmark]: Boogie Preprocessor took 122.78ms. Allocated memory was 94.4MB in the beginning and 146.8MB in the end (delta: 52.4MB). Free memory was 28.6MB in the beginning and 103.0MB in the end (delta: -74.4MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2023-11-23 08:04:36,311 INFO L158 Benchmark]: RCFGBuilder took 1980.61ms. Allocated memory is still 146.8MB. Free memory was 103.0MB in the beginning and 91.1MB in the end (delta: 11.9MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2023-11-23 08:04:36,311 INFO L158 Benchmark]: TraceAbstraction took 253152.87ms. Allocated memory was 146.8MB in the beginning and 272.6MB in the end (delta: 125.8MB). Free memory was 91.1MB in the beginning and 198.3MB in the end (delta: -107.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2023-11-23 08:04:36,311 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 272.6MB. Free memory is still 198.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:04:36,314 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.17ms. Allocated memory is still 44.0MB. Free memory was 22.8MB in the beginning and 22.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1884.55ms. Allocated memory was 58.7MB in the beginning and 94.4MB in the end (delta: 35.7MB). Free memory was 32.5MB in the beginning and 35.3MB in the end (delta: -2.8MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 206.06ms. Allocated memory is still 94.4MB. Free memory was 35.3MB in the beginning and 28.6MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.78ms. Allocated memory was 94.4MB in the beginning and 146.8MB in the end (delta: 52.4MB). Free memory was 28.6MB in the beginning and 103.0MB in the end (delta: -74.4MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1980.61ms. Allocated memory is still 146.8MB. Free memory was 103.0MB in the beginning and 91.1MB in the end (delta: 11.9MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * TraceAbstraction took 253152.87ms. Allocated memory was 146.8MB in the beginning and 272.6MB in the end (delta: 125.8MB). Free memory was 91.1MB in the beginning and 198.3MB in the end (delta: -107.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 272.6MB. Free memory is still 198.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret782 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret782 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem783 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret784 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem783 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem122 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem122 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem128 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem128 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short132 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem128 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short133 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short132 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret121 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 223]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of __builtin_umull_overflow at line 255. Possible FailurePath: [L2762-L2767] 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, }; [L7327] static __thread int tl_last_error = 0; [L7583] CALL aws_array_list_init_static_harness() [L7554] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7554] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7554] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7554] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7557] size_t item_size; [L7558] size_t initial_item_allocation; [L7559] size_t len; VAL [len={27:0}, list={30:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7562] CALL assume_abort_if_not(initial_item_allocation > 0 && initial_item_allocation <= 9223372036854775808U) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7562] RET assume_abort_if_not(initial_item_allocation > 0 && initial_item_allocation <= 9223372036854775808U) VAL [initial_item_allocation=9223372036854775808, len={27:0}, list={30:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7563] CALL assume_abort_if_not(item_size > 0 && item_size <= 2) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7563] RET assume_abort_if_not(item_size > 0 && item_size <= 2) VAL [initial_item_allocation=9223372036854775808, item_size=2, len={27:0}, list={30:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7564] CALL, EXPR aws_mul_size_checked(initial_item_allocation, item_size, &len) VAL [\old(tl_last_error)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, a=9223372036854775808, b=2, r={27:0}, r={27:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, \result=0, a=9223372036854775808, b=2, r={27:0}, r={27:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L7564] RET, EXPR aws_mul_size_checked(initial_item_allocation, item_size, &len) VAL [initial_item_allocation=9223372036854775808, item_size=2, len={27:0}, list={30:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7564] CALL assume_abort_if_not(!aws_mul_size_checked(initial_item_allocation, item_size, &len)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7564] RET assume_abort_if_not(!aws_mul_size_checked(initial_item_allocation, item_size, &len)) VAL [initial_item_allocation=9223372036854775808, item_size=2, len={27:0}, list={30:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7567] EXPR \read(len) VAL [initial_item_allocation=9223372036854775808, item_size=2, len={27:0}, list={30:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7567] CALL, EXPR bounded_malloc(len) VAL [\old(size)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2779-L2781] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2779-L2781] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=0, s_can_fail_allocator_static={4:0}, size=0, tl_last_error=0] [L2782] return malloc(size); [L7567] RET, EXPR bounded_malloc(len) VAL [initial_item_allocation=9223372036854775808, item_size=2, len={27:0}, list={30:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7567] uint8_t *raw_array = bounded_malloc(len); [L7568] struct store_byte_from_buffer old_byte; [L7569] EXPR \read(len) [L7569] CALL save_byte_from_array(raw_array, len, &old_byte) [L7171] COND FALSE !(size > 0 && array && storage) VAL [\old(size)=0, array={7:0}, array={7:0}, s_can_fail_allocator_static={4:0}, size=0, storage={-9223372036854775778:0}, storage={-9223372036854775778:0}, tl_last_error=0] [L7569] RET save_byte_from_array(raw_array, len, &old_byte) [L7571] CALL aws_array_list_init_static(&list, raw_array, initial_item_allocation, item_size) [L3237-L3239] CALL assume_abort_if_not((list != ((void *)0) )) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3237-L3239] RET assume_abort_if_not((list != ((void *)0) )) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={30:0}, list={30:0}, raw_array={7:0}, raw_array={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3240-L3242] CALL assume_abort_if_not((raw_array != ((void *)0) )) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3240-L3242] RET assume_abort_if_not((raw_array != ((void *)0) )) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={30:0}, list={30:0}, raw_array={7:0}, raw_array={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3243] CALL assume_abort_if_not((item_count > 0)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3243] RET assume_abort_if_not((item_count > 0)) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={30:0}, list={30:0}, raw_array={7:0}, raw_array={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3244] CALL assume_abort_if_not((item_size > 0)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3244] RET assume_abort_if_not((item_size > 0)) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={30:0}, list={30:0}, raw_array={7:0}, raw_array={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3246-L3247] list->alloc = ((void *)0) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={30:0}, list={30:0}, raw_array={7:0}, raw_array={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3250] CALL, EXPR aws_mul_size_checked(item_count, item_size, &list->current_size) VAL [\old(tl_last_error)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, a=9223372036854775808, b=2, r={30:8}, r={30:8}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); VAL [\old(a)=9223372036854775808, \old(b)=2, \old(tl_last_error)=0, \result=0, a=9223372036854775808, b=2, r={30:8}, r={30:8}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3250] RET, EXPR aws_mul_size_checked(item_count, item_size, &list->current_size) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={30:0}, list={30:0}, raw_array={7:0}, raw_array={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3250] int no_overflow = !aws_mul_size_checked(item_count, item_size, &list->current_size); [L3251] CALL assume_abort_if_not((no_overflow)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3251] RET assume_abort_if_not((no_overflow)) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={30:0}, list={30:0}, no_overflow=1, raw_array={7:0}, raw_array={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3253] list->item_size = item_size [L3254] list->length = 0 [L3255] list->data = raw_array VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={30:0}, list={30:0}, no_overflow=1, raw_array={7:0}, raw_array={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3256] CALL, EXPR aws_array_list_is_valid(list) VAL [\old(tl_last_error)=0, list={30:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size VAL [\old(tl_last_error)=0, list={30:0}, list={30:0}, required_size={62:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) VAL [\old(a)=0, \old(b)=2, \old(tl_last_error)=0, r={62:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) VAL [\old(a)=0, \old(b)=2, \old(tl_last_error)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) VAL [\old(a)=0, \old(b)=2, \old(tl_last_error)=0, a=0, b=2, r={62:0}, r={62:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); VAL [\old(a)=0, \old(b)=2, \old(tl_last_error)=0, \result=0, a=0, b=2, r={62:0}, r={62:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) VAL [\old(tl_last_error)=0, list={30:0}, list={30:0}, required_size={62:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) VAL [\old(tl_last_error)=0, current_size_is_valid=1, list={30:0}, list={30:0}, required_size={62:0}, required_size_is_valid=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3281] EXPR list->current_size [L3281] EXPR (((list->current_size)) == 0) || ((list->data)) VAL [\old(tl_last_error)=0, current_size_is_valid=1, list={30:0}, list={30:0}, required_size={62:0}, required_size_is_valid=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) VAL [\old(tl_last_error)=0, current_size_is_valid=1, list={30:0}, list={30:0}, required_size={62:0}, required_size_is_valid=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; VAL [\old(tl_last_error)=0, \result=1, current_size_is_valid=1, data_is_valid=1, item_size_is_valid=1, list={30:0}, list={30:0}, required_size_is_valid=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3256] RET, EXPR aws_array_list_is_valid(list) VAL [\old(item_count)=9223372036854775808, \old(item_size)=2, item_count=9223372036854775808, item_size=2, list={30:0}, list={30:0}, no_overflow=1, raw_array={7:0}, raw_array={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L3256] CALL __VERIFIER_assert(!((aws_array_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, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 253.0s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 217.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 141 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 201.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 1029 SdHoareTripleChecker+Invalid, 194.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 236 IncrementalHoareTripleChecker+Unchecked, 728 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1025 IncrementalHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 301 mSDtfsCounter, 1025 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 42.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 41 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 256 ConstructedInterpolants, 9 QuantifiedInterpolants, 1168 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1442 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 467/467 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 could not prove your program: unable to determine feasibility of some traces [2023-11-23 08:04:36,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample