./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.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 1194f340f7ee532bc519199f81b46559282d195b8cb72a1fef2be81878780cc3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:41:51,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:41:51,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 17:41:51,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:41:51,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:41:51,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:41:51,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:41:51,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:41:51,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:41:51,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:41:51,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:41:51,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:41:51,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:41:51,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:41:51,508 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:41:51,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:41:51,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:41:51,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:41:51,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:41:51,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:41:51,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:41:51,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:41:51,511 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:41:51,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:41:51,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:41:51,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:41:51,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:41:51,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:41:51,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:41:51,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:41:51,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 1194f340f7ee532bc519199f81b46559282d195b8cb72a1fef2be81878780cc3 [2025-03-08 17:41:51,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:41:51,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:41:51,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:41:51,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:41:51,723 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:41:51,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i [2025-03-08 17:41:52,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d281c5e73/87b5c3e78d0547a2b9492eebe424a25d/FLAG83f159e29 [2025-03-08 17:41:53,166 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:41:53,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i [2025-03-08 17:41:53,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d281c5e73/87b5c3e78d0547a2b9492eebe424a25d/FLAG83f159e29 [2025-03-08 17:41:53,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d281c5e73/87b5c3e78d0547a2b9492eebe424a25d [2025-03-08 17:41:53,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:41:53,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:41:53,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:41:53,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:41:53,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:41:53,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:41:53" (1/1) ... [2025-03-08 17:41:53,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad8ecf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:53, skipping insertion in model container [2025-03-08 17:41:53,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:41:53" (1/1) ... [2025-03-08 17:41:53,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:41:53,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i[4494,4507] [2025-03-08 17:41:53,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i[4554,4567] [2025-03-08 17:41:53,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,911 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,911 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,911 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,912 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,920 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,920 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,921 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,922 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,923 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,924 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,925 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:53,925 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i[156113,156126] [2025-03-08 17:41:54,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i[156332,156345] [2025-03-08 17:41:54,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i[156528,156541] [2025-03-08 17:41:54,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:41:54,196 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:41:54,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i[4494,4507] [2025-03-08 17:41:54,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i[4554,4567] [2025-03-08 17:41:54,235 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,235 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,236 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,236 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,236 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,244 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,244 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,245 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,245 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,249 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,249 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,250 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,250 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 17:41:54,285 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [6947-6958] [2025-03-08 17:41:54,303 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i[156113,156126] [2025-03-08 17:41:54,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i[156332,156345] [2025-03-08 17:41:54,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_checked_harness.i[156528,156541] [2025-03-08 17:41:54,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:41:54,460 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:41:54,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54 WrapperNode [2025-03-08 17:41:54,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:41:54,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:41:54,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:41:54,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:41:54,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,537 INFO L138 Inliner]: procedures = 671, calls = 1227, calls flagged for inlining = 41, calls inlined = 5, statements flattened = 517 [2025-03-08 17:41:54,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:41:54,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:41:54,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:41:54,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:41:54,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,598 INFO L175 MemorySlicer]: Split 246 memory accesses to 4 slices as follows [2, 3, 3, 238]. 97 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 1, 1, 6]. The 234 writes are split as follows [0, 1, 1, 232]. [2025-03-08 17:41:54,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:41:54,644 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:41:54,644 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:41:54,644 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:41:54,645 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (1/1) ... [2025-03-08 17:41:54,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:41:54,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:41:54,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:41:54,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:41:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 17:41:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-08 17:41:54,691 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-08 17:41:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 17:41:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 17:41:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 17:41:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-08 17:41:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 17:41:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:41:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 17:41:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint32_t [2025-03-08 17:41:54,693 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint32_t [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-08 17:41:54,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_u64_checked [2025-03-08 17:41:54,693 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_u64_checked [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 17:41:54,693 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:41:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 17:41:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 17:41:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:41:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:41:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:41:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 17:41:54,858 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:41:54,860 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:41:54,885 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-08 17:41:54,909 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 17:41:54,921 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: havoc #t~nondet8; [2025-03-08 17:42:00,366 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-08 17:42:00,366 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:42:00,372 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:42:00,372 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:42:00,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:00 BoogieIcfgContainer [2025-03-08 17:42:00,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:42:00,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:42:00,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:42:00,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:42:00,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:41:53" (1/3) ... [2025-03-08 17:42:00,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f20a40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:00, skipping insertion in model container [2025-03-08 17:42:00,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:41:54" (2/3) ... [2025-03-08 17:42:00,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f20a40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:00, skipping insertion in model container [2025-03-08 17:42:00,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:00" (3/3) ... [2025-03-08 17:42:00,379 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_add_size_checked_harness.i [2025-03-08 17:42:00,388 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:42:00,389 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_add_size_checked_harness.i that has 8 procedures, 66 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 17:42:00,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:42:00,443 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@619270db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:42:00,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:42:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 17:42:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 17:42:00,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:42:00,451 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 17:42:00,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:42:00,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:42:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1668675653, now seen corresponding path program 1 times [2025-03-08 17:42:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:42:00,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215466708] [2025-03-08 17:42:00,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:42:00,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:42:04,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:42:05,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:42:05,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:42:05,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:42:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:42:08,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:42:08,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215466708] [2025-03-08 17:42:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215466708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:42:08,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:42:08,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:42:08,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73129686] [2025-03-08 17:42:08,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:42:08,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:42:08,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:42:08,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:42:08,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:42:08,994 INFO L87 Difference]: Start difference. First operand has 66 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 17:42:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:42:09,752 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2025-03-08 17:42:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:42:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2025-03-08 17:42:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:42:09,759 INFO L225 Difference]: With dead ends: 88 [2025-03-08 17:42:09,759 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 17:42:09,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:42:09,762 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:42:09,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 427 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:42:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 17:42:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-08 17:42:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 38 states have internal predecessors, (40), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 17:42:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-08 17:42:09,790 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 33 [2025-03-08 17:42:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:42:09,791 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-08 17:42:09,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 17:42:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-08 17:42:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 17:42:09,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:42:09,794 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 17:42:09,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:42:09,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:42:09,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:42:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1670582277, now seen corresponding path program 1 times [2025-03-08 17:42:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:42:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654033501] [2025-03-08 17:42:09,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:42:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:42:13,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:42:13,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:42:13,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:42:13,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:42:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:42:14,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:42:14,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654033501] [2025-03-08 17:42:14,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654033501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:42:14,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:42:14,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:42:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828315900] [2025-03-08 17:42:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:42:14,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:42:14,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:42:14,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:42:14,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:42:14,126 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 17:42:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:42:14,218 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2025-03-08 17:42:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:42:14,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2025-03-08 17:42:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:42:14,219 INFO L225 Difference]: With dead ends: 63 [2025-03-08 17:42:14,219 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 17:42:14,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:42:14,220 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:42:14,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:42:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 17:42:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 17:42:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 17:42:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-03-08 17:42:14,225 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 33 [2025-03-08 17:42:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:42:14,226 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-03-08 17:42:14,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 17:42:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-03-08 17:42:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 17:42:14,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:42:14,227 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 17:42:14,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:42:14,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:42:14,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:42:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1730139726, now seen corresponding path program 1 times [2025-03-08 17:42:14,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:42:14,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001731652] [2025-03-08 17:42:14,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:42:14,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:42:17,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 17:42:18,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 17:42:18,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:42:18,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:42:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:42:21,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:42:21,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001731652] [2025-03-08 17:42:21,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001731652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:42:21,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:42:21,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:42:21,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003344284] [2025-03-08 17:42:21,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:42:21,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:42:21,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:42:21,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:42:21,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:42:21,253 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 17:42:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:42:21,903 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2025-03-08 17:42:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:42:21,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2025-03-08 17:42:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:42:21,904 INFO L225 Difference]: With dead ends: 66 [2025-03-08 17:42:21,904 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 17:42:21,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:42:21,905 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:42:21,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 407 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 17:42:21,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 17:42:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-08 17:42:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 39 states have internal predecessors, (40), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-08 17:42:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2025-03-08 17:42:21,915 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 37 [2025-03-08 17:42:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:42:21,915 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2025-03-08 17:42:21,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 17:42:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2025-03-08 17:42:21,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 17:42:21,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:42:21,916 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 17:42:21,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:42:21,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:42:21,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:42:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1728233102, now seen corresponding path program 1 times [2025-03-08 17:42:21,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:42:21,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451174019] [2025-03-08 17:42:21,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:42:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:42:25,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 17:42:25,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 17:42:25,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:42:25,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:42:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:42:26,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:42:26,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451174019] [2025-03-08 17:42:26,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451174019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:42:26,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:42:26,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:42:26,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687812639] [2025-03-08 17:42:26,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:42:26,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:42:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:42:26,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:42:26,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:42:26,013 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 17:42:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:42:26,108 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-03-08 17:42:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:42:26,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 37 [2025-03-08 17:42:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:42:26,109 INFO L225 Difference]: With dead ends: 65 [2025-03-08 17:42:26,109 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 17:42:26,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:42:26,110 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 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 [2025-03-08 17:42:26,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:42:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 17:42:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 17:42:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 17:42:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2025-03-08 17:42:26,114 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 37 [2025-03-08 17:42:26,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:42:26,114 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-03-08 17:42:26,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 17:42:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2025-03-08 17:42:26,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 17:42:26,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:42:26,115 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 17:42:26,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:42:26,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:42:26,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:42:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1426186829, now seen corresponding path program 1 times [2025-03-08 17:42:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:42:26,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4035822] [2025-03-08 17:42:26,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:42:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:42:29,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 17:42:29,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 17:42:29,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:42:29,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:42:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:42:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:42:30,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4035822] [2025-03-08 17:42:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4035822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:42:30,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:42:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:42:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404118732] [2025-03-08 17:42:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:42:30,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:42:30,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:42:30,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:42:30,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:42:30,287 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 17:42:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:42:30,455 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2025-03-08 17:42:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:42:30,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2025-03-08 17:42:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:42:30,456 INFO L225 Difference]: With dead ends: 60 [2025-03-08 17:42:30,456 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 17:42:30,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:42:30,457 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:42:30,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:42:30,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 17:42:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 17:42:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 17:42:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2025-03-08 17:42:30,461 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 39 [2025-03-08 17:42:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:42:30,461 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2025-03-08 17:42:30,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 17:42:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2025-03-08 17:42:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 17:42:30,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:42:30,464 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 17:42:30,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:42:30,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:42:30,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:42:30,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1428093453, now seen corresponding path program 1 times [2025-03-08 17:42:30,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:42:30,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73696115] [2025-03-08 17:42:30,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:42:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:42:33,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 17:42:34,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 17:42:34,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:42:34,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:42:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:42:35,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:42:35,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73696115] [2025-03-08 17:42:35,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73696115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:42:35,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:42:35,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:42:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473030860] [2025-03-08 17:42:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:42:35,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:42:35,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:42:35,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:42:35,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:42:35,804 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 17:42:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:42:35,902 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2025-03-08 17:42:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:42:35,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2025-03-08 17:42:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:42:35,904 INFO L225 Difference]: With dead ends: 63 [2025-03-08 17:42:35,904 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 17:42:35,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:42:35,905 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:42:35,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:42:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 17:42:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 17:42:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 17:42:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-03-08 17:42:35,912 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 39 [2025-03-08 17:42:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:42:35,912 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-03-08 17:42:35,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 17:42:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-03-08 17:42:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 17:42:35,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:42:35,915 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 17:42:35,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:42:35,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:42:35,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:42:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash 330593011, now seen corresponding path program 1 times [2025-03-08 17:42:35,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:42:35,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402253472] [2025-03-08 17:42:35,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:42:35,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:42:39,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 17:42:39,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 17:42:39,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:42:39,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:42:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:42:40,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:42:40,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402253472] [2025-03-08 17:42:40,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402253472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:42:40,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:42:40,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:42:40,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708442368] [2025-03-08 17:42:40,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:42:40,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:42:40,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:42:40,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:42:40,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:42:40,273 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 17:42:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:42:40,458 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2025-03-08 17:42:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:42:40,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2025-03-08 17:42:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:42:40,459 INFO L225 Difference]: With dead ends: 43 [2025-03-08 17:42:40,459 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 17:42:40,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:42:40,460 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:42:40,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:42:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 17:42:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 17:42:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 17:42:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-03-08 17:42:40,463 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 43 [2025-03-08 17:42:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:42:40,463 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-03-08 17:42:40,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 17:42:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2025-03-08 17:42:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 17:42:40,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:42:40,464 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 17:42:40,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:42:40,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:42:40,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:42:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash 332499635, now seen corresponding path program 1 times [2025-03-08 17:42:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:42:40,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747091289] [2025-03-08 17:42:40,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:42:40,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:42:43,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 17:42:44,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 17:42:44,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:42:44,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:42:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:42:47,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:42:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747091289] [2025-03-08 17:42:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747091289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:42:47,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:42:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:42:47,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313501611] [2025-03-08 17:42:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:42:47,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:42:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:42:47,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:42:47,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:42:47,887 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 17:42:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:42:48,609 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2025-03-08 17:42:48,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:42:48,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2025-03-08 17:42:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:42:48,610 INFO L225 Difference]: With dead ends: 38 [2025-03-08 17:42:48,610 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 17:42:48,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:42:48,610 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:42:48,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 212 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:42:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 17:42:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 17:42:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:42:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 17:42:48,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2025-03-08 17:42:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:42:48,612 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 17:42:48,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 17:42:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 17:42:48,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 17:42:48,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 17:42:48,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:42:48,615 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:42:48,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 17:42:49,449 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:42:49,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:42:49 BoogieIcfgContainer [2025-03-08 17:42:49,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:42:49,456 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:42:49,456 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:42:49,456 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:42:49,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:00" (3/4) ... [2025-03-08 17:42:49,458 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:42:49,462 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_add_u64_checked [2025-03-08 17:42:49,462 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2025-03-08 17:42:49,462 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure nondet_uint32_t [2025-03-08 17:42:49,462 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2025-03-08 17:42:49,462 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-08 17:42:49,462 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2025-03-08 17:42:49,462 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2025-03-08 17:42:49,470 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 114 nodes and edges [2025-03-08 17:42:49,471 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2025-03-08 17:42:49,472 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-08 17:42:49,472 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 17:42:49,473 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 17:42:49,473 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 17:42:49,473 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 17:42:49,474 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 17:42:49,848 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:42:49,849 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:42:49,849 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:42:49,849 INFO L158 Benchmark]: Toolchain (without parser) took 56470.28ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 107.1MB in the beginning and 1.1GB in the end (delta: -983.9MB). Peak memory consumption was 522.3MB. Max. memory is 16.1GB. [2025-03-08 17:42:49,850 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:42:49,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1083.21ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 90.5MB in the end (delta: 16.5MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2025-03-08 17:42:49,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.08ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 83.6MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:42:49,851 INFO L158 Benchmark]: Boogie Preprocessor took 105.16ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 73.1MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:42:49,851 INFO L158 Benchmark]: IcfgBuilder took 5728.69ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 72.4MB in the beginning and 163.3MB in the end (delta: -90.8MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2025-03-08 17:42:49,851 INFO L158 Benchmark]: TraceAbstraction took 49081.29ms. Allocated memory was 251.7MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 163.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 349.0MB. Max. memory is 16.1GB. [2025-03-08 17:42:49,852 INFO L158 Benchmark]: Witness Printer took 393.00ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 129.9MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2025-03-08 17:42:49,853 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.54ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1083.21ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 90.5MB in the end (delta: 16.5MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.08ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 83.6MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.16ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 73.1MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 5728.69ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 72.4MB in the beginning and 163.3MB in the end (delta: -90.8MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * TraceAbstraction took 49081.29ms. Allocated memory was 251.7MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 163.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 349.0MB. Max. memory is 16.1GB. * Witness Printer took 393.00ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 129.9MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 6947]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [6947-6958] * 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 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 66 locations, 96 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.2s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 2137 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1687 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 450 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 72/72 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 17:42:49,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE