./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2373b89bc80623f6b757372a5453fd0e33def233d789f1b6f34f054b43a428a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:52:09,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:52:09,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 16:52:09,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:52:09,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:52:09,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:52:09,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:52:09,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:52:09,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:52:09,216 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:52:09,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:52:09,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:52:09,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:52:09,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:52:09,216 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:52:09,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:52:09,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:52:09,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:52:09,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:52:09,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:52:09,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:52:09,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:52:09,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:52:09,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:52:09,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:52:09,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:52:09,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:52:09,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:52:09,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:52:09,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:52:09,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:52:09,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:52:09,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:52:09,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:52:09,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:52:09,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:52:09,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:52:09,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:52:09,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:52:09,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:52:09,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:52:09,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:52:09,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:52:09,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:52:09,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:52:09,219 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-jdk21/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 -> 2373b89bc80623f6b757372a5453fd0e33def233d789f1b6f34f054b43a428a7 [2025-01-09 16:52:09,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:52:09,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:52:09,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:52:09,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:52:09,480 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:52:09,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i [2025-01-09 16:52:10,643 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abba14a15/21649a1d724f42c3b27f947a64735241/FLAGa23f937b4 [2025-01-09 16:52:11,118 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:52:11,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i [2025-01-09 16:52:11,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abba14a15/21649a1d724f42c3b27f947a64735241/FLAGa23f937b4 [2025-01-09 16:52:11,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abba14a15/21649a1d724f42c3b27f947a64735241 [2025-01-09 16:52:11,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:52:11,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:52:11,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:52:11,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:52:11,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:52:11,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:52:11" (1/1) ... [2025-01-09 16:52:11,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b28366c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:11, skipping insertion in model container [2025-01-09 16:52:11,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:52:11" (1/1) ... [2025-01-09 16:52:11,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:52:11,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i[4497,4510] [2025-01-09 16:52:11,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i[4557,4570] [2025-01-09 16:52:11,886 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,889 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,889 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,890 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,890 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,904 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,905 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,907 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,908 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,909 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,912 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,912 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:11,912 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i[156169,156182] [2025-01-09 16:52:12,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i[156388,156401] [2025-01-09 16:52:12,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i[156584,156597] [2025-01-09 16:52:12,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:52:12,282 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:52:12,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i[4497,4510] [2025-01-09 16:52:12,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i[4557,4570] [2025-01-09 16:52:12,344 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,346 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,359 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,359 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 16:52:12,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [6944-6955] [2025-01-09 16:52:12,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i[156169,156182] [2025-01-09 16:52:12,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i[156388,156401] [2025-01-09 16:52:12,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_add_size_saturating_harness.i[156584,156597] [2025-01-09 16:52:12,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:52:12,606 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:52:12,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12 WrapperNode [2025-01-09 16:52:12,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:52:12,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:52:12,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:52:12,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:52:12,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,687 INFO L138 Inliner]: procedures = 669, calls = 1209, calls flagged for inlining = 41, calls inlined = 4, statements flattened = 487 [2025-01-09 16:52:12,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:52:12,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:52:12,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:52:12,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:52:12,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,757 INFO L175 MemorySlicer]: Split 240 memory accesses to 2 slices as follows [2, 238]. 99 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 232 writes are split as follows [0, 232]. [2025-01-09 16:52:12,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:52:12,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:52:12,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:52:12,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:52:12,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (1/1) ... [2025-01-09 16:52:12,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:52:12,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:52:12,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:52:12,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:52:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-01-09 16:52:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-01-09 16:52:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 16:52:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 16:52:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 16:52:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 16:52:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:52:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:52:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:52:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 16:52:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 16:52:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint32_t [2025-01-09 16:52:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint32_t [2025-01-09 16:52:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_u64_saturating [2025-01-09 16:52:12,866 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_u64_saturating [2025-01-09 16:52:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 16:52:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 16:52:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-01-09 16:52:12,866 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-01-09 16:52:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:52:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:52:13,046 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:52:13,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:52:18,501 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 16:52:18,502 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:52:18,511 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:52:18,511 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:52:18,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:18 BoogieIcfgContainer [2025-01-09 16:52:18,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:52:18,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:52:18,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:52:18,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:52:18,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:52:11" (1/3) ... [2025-01-09 16:52:18,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1009f6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:52:18, skipping insertion in model container [2025-01-09 16:52:18,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:12" (2/3) ... [2025-01-09 16:52:18,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1009f6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:52:18, skipping insertion in model container [2025-01-09 16:52:18,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:18" (3/3) ... [2025-01-09 16:52:18,519 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_add_size_saturating_harness.i [2025-01-09 16:52:18,531 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:52:18,533 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_add_size_saturating_harness.i that has 6 procedures, 47 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 16:52:18,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:52:18,599 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;@25d693dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:52:18,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:52:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:52:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 16:52:18,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:52:18,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:18,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:52:18,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:18,618 INFO L85 PathProgramCache]: Analyzing trace with hash 972435346, now seen corresponding path program 1 times [2025-01-09 16:52:18,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:18,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995905613] [2025-01-09 16:52:18,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:23,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:52:23,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:52:23,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:23,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:52:25,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:25,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995905613] [2025-01-09 16:52:25,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995905613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:25,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:25,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:52:25,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877508048] [2025-01-09 16:52:25,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:25,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:52:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:25,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:52:25,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:52:25,939 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 16:52:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:52:26,258 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2025-01-09 16:52:26,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:52:26,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-01-09 16:52:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:52:26,264 INFO L225 Difference]: With dead ends: 66 [2025-01-09 16:52:26,264 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 16:52:26,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:52:26,268 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:52:26,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 265 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:52:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 16:52:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-01-09 16:52:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 16:52:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-01-09 16:52:26,293 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 24 [2025-01-09 16:52:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:52:26,294 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-01-09 16:52:26,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 16:52:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-01-09 16:52:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 16:52:26,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:52:26,295 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:26,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:52:26,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:52:26,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash 975265491, now seen corresponding path program 1 times [2025-01-09 16:52:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611064218] [2025-01-09 16:52:26,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:30,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:52:30,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:52:30,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:30,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:52:32,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:32,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611064218] [2025-01-09 16:52:32,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611064218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:32,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:32,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:52:32,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130202815] [2025-01-09 16:52:32,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:32,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:52:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:32,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:52:32,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:52:32,309 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 16:52:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:52:32,445 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-01-09 16:52:32,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:52:32,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-01-09 16:52:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:52:32,447 INFO L225 Difference]: With dead ends: 46 [2025-01-09 16:52:32,447 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 16:52:32,447 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-01-09 16:52:32,448 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:52:32,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:52:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 16:52:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 16:52:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 16:52:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-01-09 16:52:32,455 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 24 [2025-01-09 16:52:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:52:32,456 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-01-09 16:52:32,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 16:52:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-01-09 16:52:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 16:52:32,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:52:32,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:32,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:52:32,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:52:32,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1547524588, now seen corresponding path program 1 times [2025-01-09 16:52:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:32,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548563060] [2025-01-09 16:52:32,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:36,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:52:36,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:52:36,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:36,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:52:38,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:38,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548563060] [2025-01-09 16:52:38,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548563060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:38,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:38,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:52:38,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112745418] [2025-01-09 16:52:38,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:38,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:52:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:38,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:52:38,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:52:38,143 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 16:52:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:52:38,296 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-01-09 16:52:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:52:38,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-01-09 16:52:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:52:38,298 INFO L225 Difference]: With dead ends: 43 [2025-01-09 16:52:38,298 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 16:52:38,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-09 16:52:38,299 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:52:38,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 147 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:52:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 16:52:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-09 16:52:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 16:52:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-01-09 16:52:38,303 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 24 [2025-01-09 16:52:38,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:52:38,303 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-01-09 16:52:38,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 16:52:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-01-09 16:52:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 16:52:38,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:52:38,307 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:38,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:52:38,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:52:38,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1544694443, now seen corresponding path program 1 times [2025-01-09 16:52:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882254976] [2025-01-09 16:52:38,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:41,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:52:42,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:52:42,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:42,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:52:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882254976] [2025-01-09 16:52:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882254976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:44,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:52:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044243887] [2025-01-09 16:52:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:52:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:44,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:52:44,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:52:44,177 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 16:52:44,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:52:44,526 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2025-01-09 16:52:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:52:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-01-09 16:52:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:52:44,527 INFO L225 Difference]: With dead ends: 42 [2025-01-09 16:52:44,527 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 16:52:44,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:52:44,528 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:52:44,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 219 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:52:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 16:52:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 16:52:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 16:52:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-01-09 16:52:44,530 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2025-01-09 16:52:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:52:44,531 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-09 16:52:44,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 16:52:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-01-09 16:52:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 16:52:44,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:52:44,531 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:44,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:52:44,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:52:44,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:44,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1687413384, now seen corresponding path program 1 times [2025-01-09 16:52:44,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:44,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848589848] [2025-01-09 16:52:44,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:48,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:52:48,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:52:48,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:48,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:52:49,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:49,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848589848] [2025-01-09 16:52:49,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848589848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:49,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:49,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:52:49,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616721096] [2025-01-09 16:52:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:49,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:52:49,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:49,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:52:49,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:52:49,469 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 16:52:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:52:49,731 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-01-09 16:52:49,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:52:49,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2025-01-09 16:52:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:52:49,736 INFO L225 Difference]: With dead ends: 37 [2025-01-09 16:52:49,736 INFO L226 Difference]: Without dead ends: 32 [2025-01-09 16:52:49,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:52:49,738 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 155 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-01-09 16:52:49,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 155 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:52:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-09 16:52:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-01-09 16:52:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 16:52:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-01-09 16:52:49,744 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2025-01-09 16:52:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:52:49,744 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-01-09 16:52:49,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 16:52:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-01-09 16:52:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 16:52:49,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:52:49,744 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:49,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:52:49,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:52:49,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:49,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1684583239, now seen corresponding path program 1 times [2025-01-09 16:52:49,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:49,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451531568] [2025-01-09 16:52:49,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:53,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:52:53,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:52:53,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:53,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:52:55,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:55,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451531568] [2025-01-09 16:52:55,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451531568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:55,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:55,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:52:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127958918] [2025-01-09 16:52:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:55,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:52:55,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:55,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:52:55,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:52:55,076 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 16:52:55,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:52:55,233 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2025-01-09 16:52:55,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:52:55,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2025-01-09 16:52:55,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:52:55,234 INFO L225 Difference]: With dead ends: 36 [2025-01-09 16:52:55,234 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 16:52:55,234 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-01-09 16:52:55,235 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:52:55,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:52:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 16:52:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 16:52:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 16:52:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-01-09 16:52:55,242 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 28 [2025-01-09 16:52:55,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:52:55,242 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-01-09 16:52:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 16:52:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-01-09 16:52:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 16:52:55,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:52:55,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:55,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:52:55,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:52:55,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash 800099449, now seen corresponding path program 1 times [2025-01-09 16:52:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995995382] [2025-01-09 16:52:55,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:58,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:52:58,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:52:58,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:58,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:53:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:53:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:53:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995995382] [2025-01-09 16:53:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995995382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:53:00,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:53:00,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:53:00,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532461511] [2025-01-09 16:53:00,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:53:00,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:53:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:53:00,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:53:00,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:53:00,464 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 16:53:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:53:00,597 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2025-01-09 16:53:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:53:00,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2025-01-09 16:53:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:53:00,598 INFO L225 Difference]: With dead ends: 31 [2025-01-09 16:53:00,598 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 16:53:00,598 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-01-09 16:53:00,598 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:53:00,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 83 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:53:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 16:53:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 16:53:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 16:53:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-01-09 16:53:00,601 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 28 [2025-01-09 16:53:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:53:00,601 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-01-09 16:53:00,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 16:53:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-01-09 16:53:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 16:53:00,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:53:00,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:53:00,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:53:00,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:53:00,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:53:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash 802929594, now seen corresponding path program 1 times [2025-01-09 16:53:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:53:00,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422390292] [2025-01-09 16:53:00,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:53:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:53:04,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:53:04,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:53:04,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:53:04,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:53:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:53:06,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:53:06,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422390292] [2025-01-09 16:53:06,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422390292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:53:06,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:53:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:53:06,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418977716] [2025-01-09 16:53:06,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:53:06,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:53:06,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:53:06,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:53:06,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:53:06,438 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 16:53:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:53:06,835 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2025-01-09 16:53:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:53:06,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2025-01-09 16:53:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:53:06,835 INFO L225 Difference]: With dead ends: 26 [2025-01-09 16:53:06,835 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 16:53:06,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:53:06,836 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:53:06,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:53:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 16:53:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 16:53:06,837 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-01-09 16:53:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 16:53:06,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-01-09 16:53:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:53:06,837 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 16:53:06,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 16:53:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 16:53:06,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 16:53:06,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:53:06,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:53:06,841 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:53:06,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 16:53:07,216 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:53:07,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:53:07 BoogieIcfgContainer [2025-01-09 16:53:07,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:53:07,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:53:07,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:53:07,221 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:53:07,221 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:18" (3/4) ... [2025-01-09 16:53:07,223 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:53:07,227 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2025-01-09 16:53:07,227 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint32_t [2025-01-09 16:53:07,227 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2025-01-09 16:53:07,227 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-09 16:53:07,227 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_u64_saturating [2025-01-09 16:53:07,232 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 108 nodes and edges [2025-01-09 16:53:07,232 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2025-01-09 16:53:07,232 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-01-09 16:53:07,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 16:53:07,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 16:53:07,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 16:53:07,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 16:53:07,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 16:53:07,525 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:53:07,526 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:53:07,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:53:07,527 INFO L158 Benchmark]: Toolchain (without parser) took 56296.24ms. Allocated memory was 167.8MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 127.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 449.1MB. Max. memory is 16.1GB. [2025-01-09 16:53:07,527 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 226.5MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:53:07,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1375.43ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 84.3MB in the end (delta: 43.2MB). Peak memory consumption was 103.5MB. Max. memory is 16.1GB. [2025-01-09 16:53:07,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.44ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 77.5MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:53:07,527 INFO L158 Benchmark]: Boogie Preprocessor took 112.78ms. Allocated memory is still 167.8MB. Free memory was 77.5MB in the beginning and 67.2MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:53:07,527 INFO L158 Benchmark]: RCFGBuilder took 5710.30ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 67.2MB in the beginning and 265.5MB in the end (delta: -198.4MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2025-01-09 16:53:07,527 INFO L158 Benchmark]: TraceAbstraction took 48706.59ms. Allocated memory was 335.5MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 264.2MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 298.8MB. Max. memory is 16.1GB. [2025-01-09 16:53:07,528 INFO L158 Benchmark]: Witness Printer took 305.21ms. Allocated memory is still 2.2GB. Free memory was 1.9GB in the beginning and 1.7GB in the end (delta: 127.0MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2025-01-09 16:53:07,528 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 226.5MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1375.43ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 84.3MB in the end (delta: 43.2MB). Peak memory consumption was 103.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.44ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 77.5MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.78ms. Allocated memory is still 167.8MB. Free memory was 77.5MB in the beginning and 67.2MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 5710.30ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 67.2MB in the beginning and 265.5MB in the end (delta: -198.4MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * TraceAbstraction took 48706.59ms. Allocated memory was 335.5MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 264.2MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 298.8MB. Max. memory is 16.1GB. * Witness Printer took 305.21ms. Allocated memory is still 2.2GB. Free memory was 1.9GB in the beginning and 1.7GB in the end (delta: 127.0MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 6944]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [6944-6955] * 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 6 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 1204 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 932 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 272 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 47, 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.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 24/24 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-01-09 16:53:07,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE