./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.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_hash_table_init_bounded_harness_negated.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 ace14697ac0820cd1cdf4cf69cd00f22476365c493527983be1f9a153e0d5b6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:18:29,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:18:29,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:18:29,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:18:29,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:18:29,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:18:29,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:18:29,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:18:29,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:18:29,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:18:29,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:18:29,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:18:29,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:18:29,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:18:29,639 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:18:29,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:18:29,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:18:29,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:18:29,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:18:29,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:18:29,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:18:29,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:18:29,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:18:29,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:18:29,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:18:29,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:18:29,642 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:18:29,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:18:29,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:18:29,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:18:29,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:18:29,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:18:29,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:18:29,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:18:29,642 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 -> ace14697ac0820cd1cdf4cf69cd00f22476365c493527983be1f9a153e0d5b6f [2025-01-09 17:18:29,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:18:29,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:18:29,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:18:29,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:18:29,895 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:18:29,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i [2025-01-09 17:18:31,024 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ed878777/f5c74fed8271494f9e4f82549a2cb078/FLAGcedd1cf23 [2025-01-09 17:18:31,458 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:18:31,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i [2025-01-09 17:18:31,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ed878777/f5c74fed8271494f9e4f82549a2cb078/FLAGcedd1cf23 [2025-01-09 17:18:31,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ed878777/f5c74fed8271494f9e4f82549a2cb078 [2025-01-09 17:18:31,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:18:31,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:18:31,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:18:31,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:18:31,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:18:31,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:31" (1/1) ... [2025-01-09 17:18:31,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21be819e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:31, skipping insertion in model container [2025-01-09 17:18:31,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:31" (1/1) ... [2025-01-09 17:18:31,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:18:31,737 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_hash_table_init_bounded_harness_negated.i[4501,4514] [2025-01-09 17:18:31,745 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_hash_table_init_bounded_harness_negated.i[4561,4574] [2025-01-09 17:18:33,132 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,132 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,133 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,133 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,134 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,147 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,147 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,148 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,148 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,151 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,152 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,152 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:33,154 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,479 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,480 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,505 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,506 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,511 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,512 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,523 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,524 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,524 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,524 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,525 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,525 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,525 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,550 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_hash_table_init_bounded_harness_negated.i[228071,228084] [2025-01-09 17:18:34,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:18:34,585 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:18:34,599 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_hash_table_init_bounded_harness_negated.i[4501,4514] [2025-01-09 17:18:34,600 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_hash_table_init_bounded_harness_negated.i[4561,4574] [2025-01-09 17:18:34,635 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,637 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,637 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,637 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,638 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,644 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,644 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,645 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,647 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,648 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,648 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,649 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,649 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,720 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7526-7537] [2025-01-09 17:18:34,824 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,824 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,829 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,830 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,832 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,832 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,838 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,838 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,839 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,839 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,839 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,839 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,839 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:18:34,853 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_hash_table_init_bounded_harness_negated.i[228071,228084] [2025-01-09 17:18:34,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:18:34,997 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:18:34,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34 WrapperNode [2025-01-09 17:18:34,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:18:34,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:18:34,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:18:35,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:18:35,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,151 INFO L138 Inliner]: procedures = 763, calls = 2426, calls flagged for inlining = 67, calls inlined = 13, statements flattened = 854 [2025-01-09 17:18:35,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:18:35,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:18:35,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:18:35,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:18:35,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,184 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 17:18:35,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:18:35,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:18:35,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:18:35,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:18:35,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (1/1) ... [2025-01-09 17:18:35,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:18:35,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:18:35,279 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 17:18:35,285 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 17:18:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-01-09 17:18:35,302 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-01-09 17:18:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 17:18:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:18:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-01-09 17:18:35,302 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-01-09 17:18:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-01-09 17:18:35,303 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-01-09 17:18:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 17:18:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-01-09 17:18:35,303 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-01-09 17:18:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 17:18:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-01-09 17:18:35,303 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-01-09 17:18:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:18:35,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:18:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 17:18:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-01-09 17:18:35,304 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-01-09 17:18:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:18:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:18:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-01-09 17:18:35,305 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:18:35,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-01-09 17:18:35,305 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-01-09 17:18:35,305 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:18:35,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-01-09 17:18:35,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-01-09 17:18:35,305 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-01-09 17:18:35,305 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-01-09 17:18:35,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-01-09 17:18:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-01-09 17:18:35,306 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-01-09 17:18:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-01-09 17:18:35,306 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-01-09 17:18:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 17:18:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-01-09 17:18:35,306 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-01-09 17:18:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 17:18:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-01-09 17:18:35,306 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-01-09 17:18:35,575 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:18:35,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:18:36,104 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-09 17:18:41,747 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2025-01-09 17:18:41,749 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2025-01-09 17:18:41,877 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2025-01-09 17:18:41,878 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:18:41,891 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:18:41,893 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 17:18:41,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:41 BoogieIcfgContainer [2025-01-09 17:18:41,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:18:41,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:18:41,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:18:41,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:18:41,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:18:31" (1/3) ... [2025-01-09 17:18:41,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc35c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:41, skipping insertion in model container [2025-01-09 17:18:41,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:34" (2/3) ... [2025-01-09 17:18:41,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc35c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:41, skipping insertion in model container [2025-01-09 17:18:41,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:41" (3/3) ... [2025-01-09 17:18:41,902 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_bounded_harness_negated.i [2025-01-09 17:18:41,914 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:18:41,931 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_bounded_harness_negated.i that has 20 procedures, 205 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 17:18:41,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:18:41,987 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;@20c7c5d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:18:41,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:18:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 146 states have internal predecessors, (185), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 17:18:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 17:18:41,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:18:42,000 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:18:42,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:18:42,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:18:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1301518678, now seen corresponding path program 1 times [2025-01-09 17:18:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:18:42,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904464173] [2025-01-09 17:18:42,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:18:42,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:18:46,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 17:18:46,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 17:18:46,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:18:46,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:18:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 17:18:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:18:47,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904464173] [2025-01-09 17:18:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904464173] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:18:47,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749240290] [2025-01-09 17:18:47,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:18:47,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:18:47,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:18:47,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:18:47,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 17:18:51,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 17:18:52,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 17:18:52,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:18:52,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:18:52,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 4103 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 17:18:52,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:18:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 17:18:52,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:18:52,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749240290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:18:52,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:18:52,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 17:18:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55944691] [2025-01-09 17:18:52,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:18:52,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:18:52,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:18:52,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:18:52,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:18:52,090 INFO L87 Difference]: Start difference. First operand has 205 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 146 states have internal predecessors, (185), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:18:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:18:52,132 INFO L93 Difference]: Finished difference Result 399 states and 534 transitions. [2025-01-09 17:18:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:18:52,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-01-09 17:18:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:18:52,141 INFO L225 Difference]: With dead ends: 399 [2025-01-09 17:18:52,141 INFO L226 Difference]: Without dead ends: 196 [2025-01-09 17:18:52,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:18:52,151 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:18:52,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:18:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-09 17:18:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-01-09 17:18:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 137 states have (on average 1.2481751824817517) internal successors, (171), 138 states have internal predecessors, (171), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 17:18:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2025-01-09 17:18:52,192 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 76 [2025-01-09 17:18:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:18:52,193 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2025-01-09 17:18:52,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:18:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2025-01-09 17:18:52,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 17:18:52,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:18:52,196 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:18:52,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 17:18:52,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 17:18:52,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:18:52,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:18:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1082817808, now seen corresponding path program 1 times [2025-01-09 17:18:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:18:52,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703915326] [2025-01-09 17:18:52,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:18:52,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:18:56,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 17:18:56,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 17:18:56,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:18:56,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:18:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 17:18:57,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:18:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703915326] [2025-01-09 17:18:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703915326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:18:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:18:57,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:18:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886312144] [2025-01-09 17:18:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:18:57,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:18:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:18:57,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:18:57,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:18:57,308 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:18:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:18:57,466 INFO L93 Difference]: Finished difference Result 338 states and 417 transitions. [2025-01-09 17:18:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:18:57,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-01-09 17:18:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:18:57,468 INFO L225 Difference]: With dead ends: 338 [2025-01-09 17:18:57,468 INFO L226 Difference]: Without dead ends: 198 [2025-01-09 17:18:57,469 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 17:18:57,473 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:18:57,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 733 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:18:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-09 17:18:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-01-09 17:18:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 140 states have internal predecessors, (173), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 17:18:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2025-01-09 17:18:57,497 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 76 [2025-01-09 17:18:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:18:57,498 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2025-01-09 17:18:57,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:18:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2025-01-09 17:18:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 17:18:57,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:18:57,505 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:18:57,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 17:18:57,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:18:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:18:57,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1899895979, now seen corresponding path program 1 times [2025-01-09 17:18:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:18:57,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467972819] [2025-01-09 17:18:57,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:18:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:01,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 17:19:01,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 17:19:01,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:01,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 17:19:02,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:02,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467972819] [2025-01-09 17:19:02,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467972819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:02,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:02,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:19:02,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470482030] [2025-01-09 17:19:02,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:02,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:19:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:02,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:19:02,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:19:02,221 INFO L87 Difference]: Start difference. First operand 198 states and 250 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:19:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:02,330 INFO L93 Difference]: Finished difference Result 250 states and 308 transitions. [2025-01-09 17:19:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:19:02,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2025-01-09 17:19:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:02,334 INFO L225 Difference]: With dead ends: 250 [2025-01-09 17:19:02,335 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 17:19:02,337 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 17:19:02,340 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:02,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 733 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:19:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 17:19:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-01-09 17:19:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.2394366197183098) internal successors, (176), 143 states have internal predecessors, (176), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-01-09 17:19:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2025-01-09 17:19:02,357 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 78 [2025-01-09 17:19:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:02,358 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2025-01-09 17:19:02,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:19:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2025-01-09 17:19:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 17:19:02,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:02,361 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:19:02,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 17:19:02,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:02,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1151022943, now seen corresponding path program 1 times [2025-01-09 17:19:02,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:02,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112426735] [2025-01-09 17:19:02,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:02,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:05,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:19:06,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:19:06,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:06,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 17:19:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112426735] [2025-01-09 17:19:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112426735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:06,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:06,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:19:06,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585543214] [2025-01-09 17:19:06,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:06,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:19:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:06,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:19:06,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:19:06,897 INFO L87 Difference]: Start difference. First operand 202 states and 254 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 17:19:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:06,982 INFO L93 Difference]: Finished difference Result 250 states and 307 transitions. [2025-01-09 17:19:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:19:06,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-01-09 17:19:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:06,985 INFO L225 Difference]: With dead ends: 250 [2025-01-09 17:19:06,986 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 17:19:06,987 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 17:19:06,988 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:06,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 735 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:19:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 17:19:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2025-01-09 17:19:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 139 states have (on average 1.2302158273381294) internal successors, (171), 140 states have internal predecessors, (171), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 17:19:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 248 transitions. [2025-01-09 17:19:06,999 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 248 transitions. Word has length 83 [2025-01-09 17:19:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:06,999 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 248 transitions. [2025-01-09 17:19:07,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 17:19:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 248 transitions. [2025-01-09 17:19:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 17:19:07,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:07,001 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:19:07,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 17:19:07,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:07,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1327299412, now seen corresponding path program 1 times [2025-01-09 17:19:07,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:07,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068483353] [2025-01-09 17:19:07,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:07,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:10,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 17:19:10,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 17:19:10,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:10,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 17:19:11,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:11,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068483353] [2025-01-09 17:19:11,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068483353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:11,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:11,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:19:11,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131193014] [2025-01-09 17:19:11,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:11,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:19:11,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:11,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:19:11,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:19:11,346 INFO L87 Difference]: Start difference. First operand 198 states and 248 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:19:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:11,500 INFO L93 Difference]: Finished difference Result 318 states and 390 transitions. [2025-01-09 17:19:11,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:19:11,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-01-09 17:19:11,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:11,503 INFO L225 Difference]: With dead ends: 318 [2025-01-09 17:19:11,503 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 17:19:11,503 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 17:19:11,504 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 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 17:19:11,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:19:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 17:19:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-01-09 17:19:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.2237762237762237) internal successors, (175), 144 states have internal predecessors, (175), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-01-09 17:19:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 255 transitions. [2025-01-09 17:19:11,515 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 255 transitions. Word has length 100 [2025-01-09 17:19:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:11,515 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 255 transitions. [2025-01-09 17:19:11,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:19:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 255 transitions. [2025-01-09 17:19:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 17:19:11,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:11,516 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:19:11,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 17:19:11,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:11,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash 721441017, now seen corresponding path program 1 times [2025-01-09 17:19:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428214021] [2025-01-09 17:19:11,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:15,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 17:19:15,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 17:19:15,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:15,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 17:19:17,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:17,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428214021] [2025-01-09 17:19:17,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428214021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:17,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:17,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:19:17,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527923986] [2025-01-09 17:19:17,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:17,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:19:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:17,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:19:17,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:19:17,205 INFO L87 Difference]: Start difference. First operand 203 states and 255 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 17:19:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:17,526 INFO L93 Difference]: Finished difference Result 258 states and 317 transitions. [2025-01-09 17:19:17,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:19:17,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-01-09 17:19:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:17,528 INFO L225 Difference]: With dead ends: 258 [2025-01-09 17:19:17,528 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 17:19:17,528 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 17:19:17,529 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:17,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 972 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 17:19:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 17:19:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-01-09 17:19:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.2097902097902098) internal successors, (173), 144 states have internal predecessors, (173), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-01-09 17:19:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2025-01-09 17:19:17,536 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 106 [2025-01-09 17:19:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:17,537 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2025-01-09 17:19:17,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 17:19:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2025-01-09 17:19:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 17:19:17,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:17,538 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:19:17,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 17:19:17,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:17,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash -173700675, now seen corresponding path program 1 times [2025-01-09 17:19:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:17,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403781094] [2025-01-09 17:19:17,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:21,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 17:19:21,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 17:19:21,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:21,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 17:19:21,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:21,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403781094] [2025-01-09 17:19:21,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403781094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:21,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:21,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:19:21,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050667070] [2025-01-09 17:19:21,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:21,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:19:21,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:21,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:19:21,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:19:21,577 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 17:19:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:21,639 INFO L93 Difference]: Finished difference Result 321 states and 389 transitions. [2025-01-09 17:19:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:19:21,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 141 [2025-01-09 17:19:21,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:21,642 INFO L225 Difference]: With dead ends: 321 [2025-01-09 17:19:21,642 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 17:19:21,642 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 17:19:21,642 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:21,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 731 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:19:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 17:19:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2025-01-09 17:19:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 139 states have (on average 1.2014388489208634) internal successors, (167), 140 states have internal predecessors, (167), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 17:19:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2025-01-09 17:19:21,652 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 141 [2025-01-09 17:19:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:21,652 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2025-01-09 17:19:21,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 17:19:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2025-01-09 17:19:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 17:19:21,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:21,654 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:19:21,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 17:19:21,655 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:21,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash -668690355, now seen corresponding path program 1 times [2025-01-09 17:19:21,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:21,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175130256] [2025-01-09 17:19:21,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:25,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 17:19:25,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 17:19:25,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:25,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 17:19:26,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:26,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175130256] [2025-01-09 17:19:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175130256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:26,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:26,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:19:26,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740118855] [2025-01-09 17:19:26,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:26,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:19:26,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:26,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:19:26,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:19:26,061 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 17:19:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:26,250 INFO L93 Difference]: Finished difference Result 260 states and 316 transitions. [2025-01-09 17:19:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:19:26,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2025-01-09 17:19:26,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:26,256 INFO L225 Difference]: With dead ends: 260 [2025-01-09 17:19:26,256 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 17:19:26,256 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 17:19:26,257 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 950 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:26,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 950 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:19:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 17:19:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-01-09 17:19:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.1958041958041958) internal successors, (171), 144 states have internal predecessors, (171), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-01-09 17:19:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2025-01-09 17:19:26,273 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 147 [2025-01-09 17:19:26,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:26,274 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2025-01-09 17:19:26,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 17:19:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2025-01-09 17:19:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 17:19:26,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:26,275 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:19:26,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 17:19:26,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:26,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1368070874, now seen corresponding path program 1 times [2025-01-09 17:19:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:26,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244267021] [2025-01-09 17:19:26,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:29,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 17:19:29,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 17:19:29,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:29,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 17:19:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:30,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244267021] [2025-01-09 17:19:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244267021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:30,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:30,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:19:30,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382079500] [2025-01-09 17:19:30,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:30,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:19:30,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:30,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:19:30,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:19:30,759 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 17:19:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:30,965 INFO L93 Difference]: Finished difference Result 260 states and 315 transitions. [2025-01-09 17:19:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:19:30,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2025-01-09 17:19:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:30,967 INFO L225 Difference]: With dead ends: 260 [2025-01-09 17:19:30,967 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 17:19:30,968 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 17:19:30,971 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:30,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 720 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:19:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 17:19:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2025-01-09 17:19:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 140 states have internal predecessors, (166), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 17:19:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2025-01-09 17:19:30,976 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 153 [2025-01-09 17:19:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:30,976 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2025-01-09 17:19:30,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 17:19:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2025-01-09 17:19:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 17:19:30,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:30,978 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:19:30,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 17:19:30,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:30,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash -636381911, now seen corresponding path program 1 times [2025-01-09 17:19:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:30,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958248860] [2025-01-09 17:19:30,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:30,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:34,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 17:19:34,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 17:19:34,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:34,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 17:19:35,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:35,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958248860] [2025-01-09 17:19:35,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958248860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:35,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:35,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:19:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32207939] [2025-01-09 17:19:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:35,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:19:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:35,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:19:35,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:19:35,924 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 17:19:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:36,171 INFO L93 Difference]: Finished difference Result 262 states and 315 transitions. [2025-01-09 17:19:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 17:19:36,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-01-09 17:19:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:36,173 INFO L225 Difference]: With dead ends: 262 [2025-01-09 17:19:36,174 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 17:19:36,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:19:36,175 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 2 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:36,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1176 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:19:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 17:19:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2025-01-09 17:19:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.1888111888111887) internal successors, (170), 144 states have internal predecessors, (170), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-01-09 17:19:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 248 transitions. [2025-01-09 17:19:36,190 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 248 transitions. Word has length 160 [2025-01-09 17:19:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:36,190 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 248 transitions. [2025-01-09 17:19:36,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 17:19:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 248 transitions. [2025-01-09 17:19:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 17:19:36,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:36,192 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:19:36,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 17:19:36,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:36,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash -4930485, now seen corresponding path program 1 times [2025-01-09 17:19:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:36,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691615844] [2025-01-09 17:19:36,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:36,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:39,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 17:19:39,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 17:19:39,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:39,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 17:19:41,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:41,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691615844] [2025-01-09 17:19:41,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691615844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:41,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:41,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 17:19:41,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57887879] [2025-01-09 17:19:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:41,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 17:19:41,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:41,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 17:19:41,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:19:41,345 INFO L87 Difference]: Start difference. First operand 203 states and 248 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 17:19:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:19:41,743 INFO L93 Difference]: Finished difference Result 261 states and 313 transitions. [2025-01-09 17:19:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 17:19:41,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 166 [2025-01-09 17:19:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:19:41,749 INFO L225 Difference]: With dead ends: 261 [2025-01-09 17:19:41,750 INFO L226 Difference]: Without dead ends: 196 [2025-01-09 17:19:41,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:19:41,751 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:19:41,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1643 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:19:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-09 17:19:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-01-09 17:19:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 138 states have (on average 1.181159420289855) internal successors, (163), 139 states have internal predecessors, (163), 38 states have call successors, (38), 19 states have call predecessors, (38), 19 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 17:19:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 238 transitions. [2025-01-09 17:19:41,760 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 238 transitions. Word has length 166 [2025-01-09 17:19:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:19:41,762 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 238 transitions. [2025-01-09 17:19:41,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 17:19:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 238 transitions. [2025-01-09 17:19:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 17:19:41,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:19:41,763 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:19:41,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 17:19:41,763 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:19:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:19:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash -816007831, now seen corresponding path program 1 times [2025-01-09 17:19:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:19:41,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851498320] [2025-01-09 17:19:41,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:19:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:19:45,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 17:19:45,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 17:19:45,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:19:45,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:19:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-01-09 17:19:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:19:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851498320] [2025-01-09 17:19:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851498320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:19:49,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:19:49,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 17:19:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109821987] [2025-01-09 17:19:49,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:19:49,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 17:19:49,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:19:49,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 17:19:49,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-01-09 17:19:49,884 INFO L87 Difference]: Start difference. First operand 196 states and 238 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 17:19:53,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:19:58,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:20:02,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []