./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_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_linked_list_init_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 cfa46b1b74f9528e420997256345b81eb5e96730cd46353f45cf9329326ca074 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:20:48,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:20:48,392 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:20:48,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:20:48,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:20:48,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:20:48,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:20:48,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:20:48,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:20:48,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:20:48,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:20:48,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:20:48,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:20:48,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:20:48,413 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:20:48,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:20:48,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:20:48,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:20:48,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:20:48,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:20:48,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:20:48,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:20:48,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:20:48,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:20:48,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:20:48,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:20:48,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:20:48,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:20:48,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:20:48,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:48,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:20:48,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:20:48,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:20:48,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:20:48,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:48,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:20:48,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:20:48,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:20:48,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:20:48,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:20:48,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:20:48,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:20:48,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:20:48,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:20:48,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:20:48,416 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 -> cfa46b1b74f9528e420997256345b81eb5e96730cd46353f45cf9329326ca074 [2025-01-09 17:20:48,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:20:48,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:20:48,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:20:48,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:20:48,643 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:20:48,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i [2025-01-09 17:20:49,792 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6ab9e311/100f70cd038e4a3c9c8ce9588809ee16/FLAGfa7838469 [2025-01-09 17:20:50,212 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:20:50,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i [2025-01-09 17:20:50,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6ab9e311/100f70cd038e4a3c9c8ce9588809ee16/FLAGfa7838469 [2025-01-09 17:20:50,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6ab9e311/100f70cd038e4a3c9c8ce9588809ee16 [2025-01-09 17:20:50,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:20:50,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:20:50,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:50,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:20:50,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:20:50,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:50" (1/1) ... [2025-01-09 17:20:50,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1985c534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:50, skipping insertion in model container [2025-01-09 17:20:50,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:50" (1/1) ... [2025-01-09 17:20:50,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:20:50,658 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_linked_list_init_harness_negated.i[4494,4507] [2025-01-09 17:20:50,663 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_linked_list_init_harness_negated.i[4554,4567] [2025-01-09 17:20:51,080 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,081 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,081 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,082 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,082 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,091 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,092 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,093 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,093 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,095 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,095 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,096 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,096 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,351 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_linked_list_init_harness_negated.i[150488,150501] [2025-01-09 17:20:51,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:51,362 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:20:51,376 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_linked_list_init_harness_negated.i[4494,4507] [2025-01-09 17:20:51,376 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_linked_list_init_harness_negated.i[4554,4567] [2025-01-09 17:20:51,411 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,411 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,411 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,412 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,413 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,422 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,425 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,425 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,426 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,426 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,427 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,428 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,428 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:51,509 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_linked_list_init_harness_negated.i[150488,150501] [2025-01-09 17:20:51,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:51,679 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:20:51,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51 WrapperNode [2025-01-09 17:20:51,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:51,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:51,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:20:51,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:20:51,687 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:20:51" (1/1) ... [2025-01-09 17:20:51,721 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:20:51" (1/1) ... [2025-01-09 17:20:51,738 INFO L138 Inliner]: procedures = 668, calls = 1034, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 89 [2025-01-09 17:20:51,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:51,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:20:51,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:20:51,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:20:51,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,762 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 4 writes are split as follows [0, 0, 4]. [2025-01-09 17:20:51,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,779 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:20:51,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:20:51,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:20:51,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:20:51,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (1/1) ... [2025-01-09 17:20:51,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:51,824 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:20:51,833 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:20:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2025-01-09 17:20:51,847 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2025-01-09 17:20:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:20:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:20:51,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:20:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:51,847 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-01-09 17:20:51,847 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-01-09 17:20:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:20:51,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-01-09 17:20:51,848 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:20:51,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 17:20:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 17:20:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 17:20:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:20:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:20:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:20:52,014 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:20:52,016 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:20:52,184 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-01-09 17:20:52,184 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:20:52,190 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:20:52,190 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 17:20:52,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:52 BoogieIcfgContainer [2025-01-09 17:20:52,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:20:52,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:20:52,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:20:52,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:20:52,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:20:50" (1/3) ... [2025-01-09 17:20:52,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30299c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:52, skipping insertion in model container [2025-01-09 17:20:52,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:51" (2/3) ... [2025-01-09 17:20:52,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30299c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:52, skipping insertion in model container [2025-01-09 17:20:52,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:52" (3/3) ... [2025-01-09 17:20:52,198 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness_negated.i [2025-01-09 17:20:52,207 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:20:52,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_init_harness_negated.i that has 7 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 17:20:52,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:20:52,255 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;@6042031b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:20:52,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:20:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 17:20:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 17:20:52,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:52,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:52,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:52,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash -424318463, now seen corresponding path program 1 times [2025-01-09 17:20:52,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:52,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141283030] [2025-01-09 17:20:52,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:52,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 17:20:52,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 17:20:52,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:52,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:52,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141283030] [2025-01-09 17:20:52,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141283030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:52,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 17:20:52,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007691091] [2025-01-09 17:20:52,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:52,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:20:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:52,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:20:52,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:20:52,524 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:52,537 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2025-01-09 17:20:52,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:20:52,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-09 17:20:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:52,546 INFO L225 Difference]: With dead ends: 117 [2025-01-09 17:20:52,546 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 17:20:52,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:20:52,550 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:52,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 17:20:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 17:20:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 17:20:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-01-09 17:20:52,578 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2025-01-09 17:20:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:52,579 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-01-09 17:20:52,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-01-09 17:20:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 17:20:52,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:52,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:52,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 17:20:52,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:52,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1241966913, now seen corresponding path program 1 times [2025-01-09 17:20:52,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:52,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956781221] [2025-01-09 17:20:52,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:52,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 17:20:52,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 17:20:52,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:52,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:52,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:52,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956781221] [2025-01-09 17:20:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956781221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:52,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:52,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:20:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718745167] [2025-01-09 17:20:52,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:52,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:20:52,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:52,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:20:52,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:20:52,991 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:53,037 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2025-01-09 17:20:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 17:20:53,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-09 17:20:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:53,040 INFO L225 Difference]: With dead ends: 66 [2025-01-09 17:20:53,040 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 17:20:53,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:20:53,041 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:53,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 330 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 17:20:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-01-09 17:20:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 17:20:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-01-09 17:20:53,056 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 26 [2025-01-09 17:20:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:53,056 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-01-09 17:20:53,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-01-09 17:20:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 17:20:53,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:53,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:53,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 17:20:53,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:53,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash 936375003, now seen corresponding path program 1 times [2025-01-09 17:20:53,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243705771] [2025-01-09 17:20:53,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:53,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 17:20:53,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 17:20:53,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:53,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:53,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243705771] [2025-01-09 17:20:53,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243705771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:53,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:53,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 17:20:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306822363] [2025-01-09 17:20:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:53,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 17:20:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:53,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 17:20:53,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:20:53,276 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:53,397 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2025-01-09 17:20:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 17:20:53,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-01-09 17:20:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:53,398 INFO L225 Difference]: With dead ends: 119 [2025-01-09 17:20:53,398 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 17:20:53,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:53,399 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:53,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 361 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 17:20:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-01-09 17:20:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.255813953488372) internal successors, (54), 45 states have internal predecessors, (54), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 17:20:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2025-01-09 17:20:53,409 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 28 [2025-01-09 17:20:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:53,409 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2025-01-09 17:20:53,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2025-01-09 17:20:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 17:20:53,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:53,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:53,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 17:20:53,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:53,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1603387799, now seen corresponding path program 1 times [2025-01-09 17:20:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:53,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129145065] [2025-01-09 17:20:53,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:53,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:53,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 17:20:53,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 17:20:53,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:53,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:53,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:53,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129145065] [2025-01-09 17:20:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129145065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:53,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:20:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797441964] [2025-01-09 17:20:53,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:53,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:53,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:53,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:53,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:53,568 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:53,701 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2025-01-09 17:20:53,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 17:20:53,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-09 17:20:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:53,702 INFO L225 Difference]: With dead ends: 125 [2025-01-09 17:20:53,702 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 17:20:53,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 17:20:53,703 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:53,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 395 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 17:20:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-01-09 17:20:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.25) internal successors, (55), 46 states have internal predecessors, (55), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 17:20:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2025-01-09 17:20:53,709 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 30 [2025-01-09 17:20:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:53,709 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2025-01-09 17:20:53,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2025-01-09 17:20:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 17:20:53,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:53,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:53,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 17:20:53,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:53,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash -258619564, now seen corresponding path program 1 times [2025-01-09 17:20:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:53,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601555434] [2025-01-09 17:20:53,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:53,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:53,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 17:20:53,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 17:20:53,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:53,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:53,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:53,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601555434] [2025-01-09 17:20:53,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601555434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:53,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:53,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:20:53,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235644140] [2025-01-09 17:20:53,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:53,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:53,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:53,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:53,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:53,965 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:54,088 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2025-01-09 17:20:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:20:54,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-01-09 17:20:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:54,090 INFO L225 Difference]: With dead ends: 126 [2025-01-09 17:20:54,090 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 17:20:54,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 17:20:54,091 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 27 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:54,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 404 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 17:20:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2025-01-09 17:20:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 47 states have internal predecessors, (56), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 17:20:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-01-09 17:20:54,097 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 31 [2025-01-09 17:20:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:54,097 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-01-09 17:20:54,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-01-09 17:20:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 17:20:54,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:54,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:54,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 17:20:54,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:54,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:54,098 INFO L85 PathProgramCache]: Analyzing trace with hash 633938102, now seen corresponding path program 1 times [2025-01-09 17:20:54,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:54,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982757830] [2025-01-09 17:20:54,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:54,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 17:20:54,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 17:20:54,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:54,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:54,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982757830] [2025-01-09 17:20:54,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982757830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:54,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:54,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 17:20:54,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297033061] [2025-01-09 17:20:54,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:54,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:20:54,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:54,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:20:54,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:20:54,396 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 17:20:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:54,439 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2025-01-09 17:20:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:20:54,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-01-09 17:20:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:54,441 INFO L225 Difference]: With dead ends: 76 [2025-01-09 17:20:54,443 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 17:20:54,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:20:54,443 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:54,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 383 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 17:20:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2025-01-09 17:20:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 48 states have internal predecessors, (57), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 17:20:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2025-01-09 17:20:54,453 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 39 [2025-01-09 17:20:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:54,453 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2025-01-09 17:20:54,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 17:20:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2025-01-09 17:20:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:20:54,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:54,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:54,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 17:20:54,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:54,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:54,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1246330525, now seen corresponding path program 1 times [2025-01-09 17:20:54,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:54,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035582081] [2025-01-09 17:20:54,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:54,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:20:54,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:20:54,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:54,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 17:20:54,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:54,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035582081] [2025-01-09 17:20:54,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035582081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:54,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:54,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:20:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33550993] [2025-01-09 17:20:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:54,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:54,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:54,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:54,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:54,919 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 17:20:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:55,065 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2025-01-09 17:20:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:20:55,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2025-01-09 17:20:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:55,066 INFO L225 Difference]: With dead ends: 129 [2025-01-09 17:20:55,066 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 17:20:55,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 17:20:55,067 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 17 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:55,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 396 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 17:20:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-01-09 17:20:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 51 states have internal predecessors, (60), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-01-09 17:20:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2025-01-09 17:20:55,074 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 42 [2025-01-09 17:20:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:55,074 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2025-01-09 17:20:55,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 17:20:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2025-01-09 17:20:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:20:55,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:55,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:55,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 17:20:55,076 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:55,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1380344031, now seen corresponding path program 1 times [2025-01-09 17:20:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:55,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548850985] [2025-01-09 17:20:55,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:55,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:20:55,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:20:55,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:55,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 17:20:55,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548850985] [2025-01-09 17:20:55,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548850985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:55,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:55,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 17:20:55,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647771306] [2025-01-09 17:20:55,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:55,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:55,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:55,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:55,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:20:55,451 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 17:20:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:55,634 INFO L93 Difference]: Finished difference Result 152 states and 189 transitions. [2025-01-09 17:20:55,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:20:55,635 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2025-01-09 17:20:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:55,635 INFO L225 Difference]: With dead ends: 152 [2025-01-09 17:20:55,636 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 17:20:55,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:55,636 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:55,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 413 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 17:20:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2025-01-09 17:20:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 62 states have internal predecessors, (76), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-01-09 17:20:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2025-01-09 17:20:55,644 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 42 [2025-01-09 17:20:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:55,644 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2025-01-09 17:20:55,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 17:20:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2025-01-09 17:20:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:20:55,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:55,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:55,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 17:20:55,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:55,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1318304417, now seen corresponding path program 1 times [2025-01-09 17:20:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667144899] [2025-01-09 17:20:55,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:55,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:20:55,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:20:55,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:55,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 17:20:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:56,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667144899] [2025-01-09 17:20:56,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667144899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:56,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:56,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 17:20:56,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711855880] [2025-01-09 17:20:56,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:56,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:56,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:56,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:20:56,079 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 17:20:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:56,272 INFO L93 Difference]: Finished difference Result 183 states and 234 transitions. [2025-01-09 17:20:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:20:56,272 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2025-01-09 17:20:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:56,273 INFO L225 Difference]: With dead ends: 183 [2025-01-09 17:20:56,273 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 17:20:56,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:56,274 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 43 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:56,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 464 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 17:20:56,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2025-01-09 17:20:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 66 states have internal predecessors, (82), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-01-09 17:20:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2025-01-09 17:20:56,282 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 42 [2025-01-09 17:20:56,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:56,282 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2025-01-09 17:20:56,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 17:20:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2025-01-09 17:20:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:20:56,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:56,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:56,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 17:20:56,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:56,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1827777507, now seen corresponding path program 1 times [2025-01-09 17:20:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:56,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521420545] [2025-01-09 17:20:56,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:56,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:20:56,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:20:56,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:56,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 17:20:56,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:56,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521420545] [2025-01-09 17:20:56,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521420545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:56,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:56,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 17:20:56,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447314669] [2025-01-09 17:20:56,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:56,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:56,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:56,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:56,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:20:56,479 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 17:20:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:56,668 INFO L93 Difference]: Finished difference Result 207 states and 269 transitions. [2025-01-09 17:20:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:20:56,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2025-01-09 17:20:56,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:56,670 INFO L225 Difference]: With dead ends: 207 [2025-01-09 17:20:56,670 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 17:20:56,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:56,671 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 62 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:56,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 433 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 17:20:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 89. [2025-01-09 17:20:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 70 states have internal predecessors, (88), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-01-09 17:20:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2025-01-09 17:20:56,680 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 42 [2025-01-09 17:20:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:56,681 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2025-01-09 17:20:56,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 17:20:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2025-01-09 17:20:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:20:56,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:56,682 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:56,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 17:20:56,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:56,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1805145253, now seen corresponding path program 1 times [2025-01-09 17:20:56,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:56,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259135170] [2025-01-09 17:20:56,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:56,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:56,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:20:56,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:20:56,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:56,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 17:20:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259135170] [2025-01-09 17:20:56,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259135170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:56,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:56,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 17:20:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407413600] [2025-01-09 17:20:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:56,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:20:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:56,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:20:56,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:20:56,765 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 17:20:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:56,820 INFO L93 Difference]: Finished difference Result 204 states and 266 transitions. [2025-01-09 17:20:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:20:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2025-01-09 17:20:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:56,822 INFO L225 Difference]: With dead ends: 204 [2025-01-09 17:20:56,822 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 17:20:56,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:20:56,822 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:56,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 360 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 17:20:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 17:20:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 63 states have internal predecessors, (76), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-01-09 17:20:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2025-01-09 17:20:56,830 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 42 [2025-01-09 17:20:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:56,831 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2025-01-09 17:20:56,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 17:20:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2025-01-09 17:20:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 17:20:56,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:56,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:56,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 17:20:56,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:56,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1275665230, now seen corresponding path program 1 times [2025-01-09 17:20:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:56,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049445947] [2025-01-09 17:20:56,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:56,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:56,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 17:20:56,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 17:20:56,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:56,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:57,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049445947] [2025-01-09 17:20:57,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049445947] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932569106] [2025-01-09 17:20:57,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:57,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:57,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:57,140 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:20:57,142 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:20:57,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 17:20:57,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 17:20:57,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:57,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:57,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 17:20:57,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:20:57,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:57,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932569106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:57,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:57,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-01-09 17:20:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49064030] [2025-01-09 17:20:57,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:57,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:57,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:57,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:57,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2025-01-09 17:20:57,488 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 17:20:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:57,553 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2025-01-09 17:20:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:20:57,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-01-09 17:20:57,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:57,556 INFO L225 Difference]: With dead ends: 99 [2025-01-09 17:20:57,556 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 17:20:57,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2025-01-09 17:20:57,557 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:57,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 477 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 17:20:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2025-01-09 17:20:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 64 states have internal predecessors, (77), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-01-09 17:20:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2025-01-09 17:20:57,569 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 103 transitions. Word has length 41 [2025-01-09 17:20:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:57,570 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-01-09 17:20:57,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 17:20:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2025-01-09 17:20:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:20:57,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:57,571 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:57,581 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:20:57,771 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,SelfDestructingSolverStorable11 [2025-01-09 17:20:57,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:57,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash 685049753, now seen corresponding path program 1 times [2025-01-09 17:20:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:57,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194854999] [2025-01-09 17:20:57,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:57,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:20:57,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:20:57,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:57,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 17:20:57,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 17:20:57,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:20:57,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:20:57,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:57,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 17:20:57,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 17:20:57,851 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 17:20:57,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 17:20:57,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 17:20:57,855 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:57,886 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 17:20:57,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 05:20:57 BoogieIcfgContainer [2025-01-09 17:20:57,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 17:20:57,890 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 17:20:57,890 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 17:20:57,890 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 17:20:57,890 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:52" (3/4) ... [2025-01-09 17:20:57,892 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 17:20:57,937 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 21. [2025-01-09 17:20:57,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 17:20:57,986 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 17:20:57,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 17:20:57,987 INFO L158 Benchmark]: Toolchain (without parser) took 7611.12ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 99.2MB in the beginning and 232.1MB in the end (delta: -132.9MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. [2025-01-09 17:20:57,987 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 226.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 17:20:57,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1304.19ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 78.7MB in the end (delta: 20.4MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2025-01-09 17:20:57,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.96ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 73.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 17:20:57,987 INFO L158 Benchmark]: Boogie Preprocessor took 56.48ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 70.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 17:20:57,988 INFO L158 Benchmark]: RCFGBuilder took 391.96ms. Allocated memory is still 142.6MB. Free memory was 70.4MB in the beginning and 48.6MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 17:20:57,988 INFO L158 Benchmark]: TraceAbstraction took 5697.67ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 48.6MB in the beginning and 240.5MB in the end (delta: -191.9MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2025-01-09 17:20:57,988 INFO L158 Benchmark]: Witness Printer took 96.29ms. Allocated memory is still 402.7MB. Free memory was 240.5MB in the beginning and 232.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 17:20:57,989 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.75ms. Allocated memory is still 226.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1304.19ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 78.7MB in the end (delta: 20.4MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.96ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 73.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.48ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 70.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 391.96ms. Allocated memory is still 142.6MB. Free memory was 70.4MB in the beginning and 48.6MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5697.67ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 48.6MB in the beginning and 240.5MB in the end (delta: -191.9MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Witness Printer took 96.29ms. Allocated memory is still 402.7MB. Free memory was 240.5MB in the beginning and 232.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7355] CALL aws_linked_list_init_harness() [L7344] struct aws_linked_list list; VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7350] CALL aws_linked_list_init(&list) VAL [\old(list)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4771] CALL assume_abort_if_not((list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4771] RET assume_abort_if_not((list)) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4772] list->head.next = &list->tail [L4773-L4774] list->head.prev = ((void *)0) [L4776] list->tail.prev = &list->head [L4777-L4778] list->tail.next = ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4780] CALL, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4780] RET, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4780] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 330 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 296 mSDsluCounter, 4491 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3716 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1030 IncrementalHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 775 mSDtfsCounter, 1030 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=10, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 111 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 1 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 31/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 17:20:58,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE