./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4c883892095e0f755900dfa24a6bc793b8370cf6ff9d1a6368a9f789f01f5b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:54:15,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:54:15,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:54:15,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:54:15,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:54:15,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:54:15,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:54:15,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:54:15,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:54:15,107 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:54:15,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:54:15,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:54:15,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:54:15,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:54:15,109 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:54:15,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:54:15,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:54:15,110 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:54:15,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:54:15,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:54:15,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:54:15,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:54:15,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:54:15,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:54:15,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:54:15,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:54:15,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:54:15,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:54:15,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:54:15,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:54:15,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:54:15,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:54:15,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:54:15,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:54:15,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:54:15,112 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:54:15,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:54:15,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:54:15,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:54:15,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:54:15,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:54:15,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:54:15,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:54:15,112 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4c883892095e0f755900dfa24a6bc793b8370cf6ff9d1a6368a9f789f01f5b0 [2025-03-08 06:54:15,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:54:15,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:54:15,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:54:15,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:54:15,363 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:54:15,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c [2025-03-08 06:54:16,502 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723f105ef/76e968c32802462e8ffcb109a6a9c939/FLAG783932302 [2025-03-08 06:54:16,976 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:54:16,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c [2025-03-08 06:54:17,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723f105ef/76e968c32802462e8ffcb109a6a9c939/FLAG783932302 [2025-03-08 06:54:17,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723f105ef/76e968c32802462e8ffcb109a6a9c939 [2025-03-08 06:54:17,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:54:17,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:54:17,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:54:17,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:54:17,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:54:17,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:54:17" (1/1) ... [2025-03-08 06:54:17,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:17, skipping insertion in model container [2025-03-08 06:54:17,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:54:17" (1/1) ... [2025-03-08 06:54:17,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:54:18,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c[380323,380336] [2025-03-08 06:54:18,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c[383339,383352] [2025-03-08 06:54:18,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:54:18,579 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:54:19,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c[380323,380336] [2025-03-08 06:54:19,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c[383339,383352] [2025-03-08 06:54:19,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:54:19,139 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:54:19,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19 WrapperNode [2025-03-08 06:54:19,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:54:19,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:54:19,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:54:19,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:54:19,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,579 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12900 [2025-03-08 06:54:19,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:54:19,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:54:19,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:54:19,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:54:19,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,726 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:54:19,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:54:19,978 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:54:19,978 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:54:19,978 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:54:19,979 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (1/1) ... [2025-03-08 06:54:19,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:54:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:54:20,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:54:20,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:54:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:54:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:54:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:54:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:54:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:54:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:54:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:54:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:54:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:54:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:54:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:54:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:54:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:54:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:54:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:54:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:54:20,121 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:54:20,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:54:26,587 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:54:26,589 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:54:26,590 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:54:26,590 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:54:26,590 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:54:26,590 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:54:26,591 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:54:26,778 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2025-03-08 06:54:26,778 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:54:26,832 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:54:26,832 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:54:26,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:54:26 BoogieIcfgContainer [2025-03-08 06:54:26,832 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:54:26,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:54:26,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:54:26,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:54:26,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:54:17" (1/3) ... [2025-03-08 06:54:26,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72498dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:54:26, skipping insertion in model container [2025-03-08 06:54:26,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:54:19" (2/3) ... [2025-03-08 06:54:26,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72498dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:54:26, skipping insertion in model container [2025-03-08 06:54:26,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:54:26" (3/3) ... [2025-03-08 06:54:26,840 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.07.cil-1.c [2025-03-08 06:54:26,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:54:26,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.07.cil-1.c that has 7 procedures, 2438 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-03-08 06:54:26,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:54:26,962 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;@64411b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:54:26,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:54:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 2438 states, 2409 states have (on average 1.8451639684516397) internal successors, (4445), 2411 states have internal predecessors, (4445), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 06:54:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:26,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:26,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:26,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:26,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash 140385463, now seen corresponding path program 1 times [2025-03-08 06:54:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481928006] [2025-03-08 06:54:26,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:27,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:27,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:27,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:27,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:27,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:27,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481928006] [2025-03-08 06:54:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481928006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:27,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:27,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:54:27,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711603024] [2025-03-08 06:54:27,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:27,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:54:27,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:27,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:54:27,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:54:27,518 INFO L87 Difference]: Start difference. First operand has 2438 states, 2409 states have (on average 1.8451639684516397) internal successors, (4445), 2411 states have internal predecessors, (4445), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:28,028 INFO L93 Difference]: Finished difference Result 4875 states and 8979 transitions. [2025-03-08 06:54:28,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:54:28,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:28,055 INFO L225 Difference]: With dead ends: 4875 [2025-03-08 06:54:28,055 INFO L226 Difference]: Without dead ends: 2387 [2025-03-08 06:54:28,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:28,069 INFO L435 NwaCegarLoop]: 4314 mSDtfsCounter, 4541 mSDsluCounter, 8523 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4556 SdHoareTripleChecker+Valid, 12837 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:28,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4556 Valid, 12837 Invalid, 332 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:54:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2025-03-08 06:54:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2371. [2025-03-08 06:54:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2342 states have (on average 1.8373185311699403) internal successors, (4303), 2344 states have internal predecessors, (4303), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 06:54:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 4345 transitions. [2025-03-08 06:54:28,200 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 4345 transitions. Word has length 121 [2025-03-08 06:54:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:28,201 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 4345 transitions. [2025-03-08 06:54:28,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 4345 transitions. [2025-03-08 06:54:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:28,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:28,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:28,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:54:28,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:28,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash -792968874, now seen corresponding path program 1 times [2025-03-08 06:54:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:28,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891280783] [2025-03-08 06:54:28,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:28,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:28,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:28,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:28,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:28,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:28,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891280783] [2025-03-08 06:54:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891280783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:28,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:28,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:54:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551853219] [2025-03-08 06:54:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:28,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:54:28,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:28,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:54:28,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:28,434 INFO L87 Difference]: Start difference. First operand 2371 states and 4345 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:29,026 INFO L93 Difference]: Finished difference Result 2885 states and 5161 transitions. [2025-03-08 06:54:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:54:29,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:29,042 INFO L225 Difference]: With dead ends: 2885 [2025-03-08 06:54:29,043 INFO L226 Difference]: Without dead ends: 2650 [2025-03-08 06:54:29,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:54:29,047 INFO L435 NwaCegarLoop]: 4455 mSDtfsCounter, 4674 mSDsluCounter, 13459 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4689 SdHoareTripleChecker+Valid, 17914 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:29,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4689 Valid, 17914 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:54:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2025-03-08 06:54:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2618. [2025-03-08 06:54:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2563 states have (on average 1.81467030823254) internal successors, (4651), 2567 states have internal predecessors, (4651), 39 states have call successors, (39), 12 states have call predecessors, (39), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-03-08 06:54:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 4736 transitions. [2025-03-08 06:54:29,131 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 4736 transitions. Word has length 121 [2025-03-08 06:54:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:29,131 INFO L471 AbstractCegarLoop]: Abstraction has 2618 states and 4736 transitions. [2025-03-08 06:54:29,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 4736 transitions. [2025-03-08 06:54:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:29,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:29,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:29,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:54:29,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:29,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:29,135 INFO L85 PathProgramCache]: Analyzing trace with hash 700943575, now seen corresponding path program 1 times [2025-03-08 06:54:29,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:29,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854424857] [2025-03-08 06:54:29,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:29,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:29,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:29,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:29,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:29,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:29,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854424857] [2025-03-08 06:54:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854424857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:29,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:29,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:54:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185041565] [2025-03-08 06:54:29,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:29,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:54:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:29,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:54:29,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:29,335 INFO L87 Difference]: Start difference. First operand 2618 states and 4736 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:29,912 INFO L93 Difference]: Finished difference Result 3622 states and 6329 transitions. [2025-03-08 06:54:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:54:29,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:29,928 INFO L225 Difference]: With dead ends: 3622 [2025-03-08 06:54:29,928 INFO L226 Difference]: Without dead ends: 3142 [2025-03-08 06:54:29,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:54:29,932 INFO L435 NwaCegarLoop]: 4421 mSDtfsCounter, 4670 mSDsluCounter, 13388 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 17809 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:29,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 17809 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:54:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2025-03-08 06:54:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3098. [2025-03-08 06:54:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2995 states have (on average 1.778964941569282) internal successors, (5328), 3003 states have internal predecessors, (5328), 71 states have call successors, (71), 24 states have call predecessors, (71), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-03-08 06:54:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 5493 transitions. [2025-03-08 06:54:30,031 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 5493 transitions. Word has length 121 [2025-03-08 06:54:30,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:30,031 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 5493 transitions. [2025-03-08 06:54:30,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:30,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 5493 transitions. [2025-03-08 06:54:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:30,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:30,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:30,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:54:30,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:30,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash -497791690, now seen corresponding path program 1 times [2025-03-08 06:54:30,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:30,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151098203] [2025-03-08 06:54:30,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:30,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:30,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:30,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:30,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151098203] [2025-03-08 06:54:30,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151098203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:30,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:30,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:54:30,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73419744] [2025-03-08 06:54:30,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:30,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:54:30,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:30,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:54:30,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:30,178 INFO L87 Difference]: Start difference. First operand 3098 states and 5493 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:30,715 INFO L93 Difference]: Finished difference Result 5159 states and 8800 transitions. [2025-03-08 06:54:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:54:30,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:30,738 INFO L225 Difference]: With dead ends: 5159 [2025-03-08 06:54:30,739 INFO L226 Difference]: Without dead ends: 4199 [2025-03-08 06:54:30,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:54:30,746 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 4665 mSDsluCounter, 13376 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4680 SdHoareTripleChecker+Valid, 17795 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:30,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4680 Valid, 17795 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:54:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2025-03-08 06:54:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 4132. [2025-03-08 06:54:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4132 states, 3927 states have (on average 1.73414820473644) internal successors, (6810), 3949 states have internal predecessors, (6810), 135 states have call successors, (135), 48 states have call predecessors, (135), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-03-08 06:54:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 7159 transitions. [2025-03-08 06:54:30,885 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 7159 transitions. Word has length 121 [2025-03-08 06:54:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:30,885 INFO L471 AbstractCegarLoop]: Abstraction has 4132 states and 7159 transitions. [2025-03-08 06:54:30,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 7159 transitions. [2025-03-08 06:54:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:30,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:30,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:30,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:54:30,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:30,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash 17728759, now seen corresponding path program 1 times [2025-03-08 06:54:30,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:30,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996640976] [2025-03-08 06:54:30,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:30,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:30,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:30,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:30,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:30,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996640976] [2025-03-08 06:54:31,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996640976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:31,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:31,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:54:31,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648147677] [2025-03-08 06:54:31,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:31,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:54:31,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:31,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:54:31,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:31,176 INFO L87 Difference]: Start difference. First operand 4132 states and 7159 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:31,853 INFO L93 Difference]: Finished difference Result 8510 states and 14338 transitions. [2025-03-08 06:54:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:54:31,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:31,883 INFO L225 Difference]: With dead ends: 8510 [2025-03-08 06:54:31,884 INFO L226 Difference]: Without dead ends: 6516 [2025-03-08 06:54:31,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:54:31,895 INFO L435 NwaCegarLoop]: 4415 mSDtfsCounter, 4660 mSDsluCounter, 13359 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4675 SdHoareTripleChecker+Valid, 17774 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:31,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4675 Valid, 17774 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:54:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6516 states. [2025-03-08 06:54:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6516 to 6406. [2025-03-08 06:54:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6406 states, 5979 states have (on average 1.6939287506271952) internal successors, (10128), 6047 states have internal predecessors, (10128), 263 states have call successors, (263), 96 states have call predecessors, (263), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-03-08 06:54:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6406 states to 6406 states and 10941 transitions. [2025-03-08 06:54:32,106 INFO L78 Accepts]: Start accepts. Automaton has 6406 states and 10941 transitions. Word has length 121 [2025-03-08 06:54:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:32,107 INFO L471 AbstractCegarLoop]: Abstraction has 6406 states and 10941 transitions. [2025-03-08 06:54:32,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 6406 states and 10941 transitions. [2025-03-08 06:54:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:32,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:32,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:32,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:54:32,116 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:32,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash -935472874, now seen corresponding path program 1 times [2025-03-08 06:54:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360890094] [2025-03-08 06:54:32,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:32,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:32,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:32,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:32,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:32,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:32,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360890094] [2025-03-08 06:54:32,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360890094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:32,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:32,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:54:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854977411] [2025-03-08 06:54:32,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:32,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:54:32,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:32,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:54:32,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:32,286 INFO L87 Difference]: Start difference. First operand 6406 states and 10941 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:32,911 INFO L93 Difference]: Finished difference Result 15977 states and 27196 transitions. [2025-03-08 06:54:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:54:32,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:32,960 INFO L225 Difference]: With dead ends: 15977 [2025-03-08 06:54:32,961 INFO L226 Difference]: Without dead ends: 11709 [2025-03-08 06:54:32,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:54:32,979 INFO L435 NwaCegarLoop]: 4413 mSDtfsCounter, 4655 mSDsluCounter, 13347 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4670 SdHoareTripleChecker+Valid, 17760 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:32,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4670 Valid, 17760 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:54:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11709 states. [2025-03-08 06:54:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11709 to 11520. [2025-03-08 06:54:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 10595 states have (on average 1.673053327041057) internal successors, (17726), 10809 states have internal predecessors, (17726), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:54:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 19851 transitions. [2025-03-08 06:54:33,392 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 19851 transitions. Word has length 121 [2025-03-08 06:54:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:33,393 INFO L471 AbstractCegarLoop]: Abstraction has 11520 states and 19851 transitions. [2025-03-08 06:54:33,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 19851 transitions. [2025-03-08 06:54:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:33,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:33,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:33,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:54:33,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:33,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:33,402 INFO L85 PathProgramCache]: Analyzing trace with hash -134937321, now seen corresponding path program 1 times [2025-03-08 06:54:33,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:33,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386327425] [2025-03-08 06:54:33,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:33,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:33,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:33,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:33,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386327425] [2025-03-08 06:54:33,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386327425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:33,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:33,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:54:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816040336] [2025-03-08 06:54:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:33,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:54:33,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:33,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:54:33,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:54:33,491 INFO L87 Difference]: Start difference. First operand 11520 states and 19851 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:34,170 INFO L93 Difference]: Finished difference Result 23334 states and 41003 transitions. [2025-03-08 06:54:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:54:34,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:34,230 INFO L225 Difference]: With dead ends: 23334 [2025-03-08 06:54:34,231 INFO L226 Difference]: Without dead ends: 13950 [2025-03-08 06:54:34,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:34,265 INFO L435 NwaCegarLoop]: 4234 mSDtfsCounter, 4466 mSDsluCounter, 8364 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 12598 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:34,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 12598 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:54:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13950 states. [2025-03-08 06:54:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13950 to 11520. [2025-03-08 06:54:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 10595 states have (on average 1.6699386503067484) internal successors, (17693), 10809 states have internal predecessors, (17693), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:54:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 19818 transitions. [2025-03-08 06:54:34,766 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 19818 transitions. Word has length 121 [2025-03-08 06:54:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:34,767 INFO L471 AbstractCegarLoop]: Abstraction has 11520 states and 19818 transitions. [2025-03-08 06:54:34,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 19818 transitions. [2025-03-08 06:54:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:34,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:34,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:34,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:54:34,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:34,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:34,775 INFO L85 PathProgramCache]: Analyzing trace with hash -663302922, now seen corresponding path program 1 times [2025-03-08 06:54:34,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:34,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598617628] [2025-03-08 06:54:34,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:34,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:34,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:34,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:34,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:34,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:34,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:34,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598617628] [2025-03-08 06:54:34,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598617628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:34,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:34,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:54:34,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58229631] [2025-03-08 06:54:34,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:34,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:54:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:34,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:54:34,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:54:34,870 INFO L87 Difference]: Start difference. First operand 11520 states and 19818 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:35,475 INFO L93 Difference]: Finished difference Result 22848 states and 39965 transitions. [2025-03-08 06:54:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:54:35,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:35,543 INFO L225 Difference]: With dead ends: 22848 [2025-03-08 06:54:35,544 INFO L226 Difference]: Without dead ends: 13464 [2025-03-08 06:54:35,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:35,589 INFO L435 NwaCegarLoop]: 4229 mSDtfsCounter, 4460 mSDsluCounter, 8353 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4475 SdHoareTripleChecker+Valid, 12582 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:35,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4475 Valid, 12582 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:54:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13464 states. [2025-03-08 06:54:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13464 to 11520. [2025-03-08 06:54:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 10595 states have (on average 1.6668239735724397) internal successors, (17660), 10809 states have internal predecessors, (17660), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:54:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 19785 transitions. [2025-03-08 06:54:36,447 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 19785 transitions. Word has length 121 [2025-03-08 06:54:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:36,448 INFO L471 AbstractCegarLoop]: Abstraction has 11520 states and 19785 transitions. [2025-03-08 06:54:36,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 19785 transitions. [2025-03-08 06:54:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:36,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:36,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:36,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:54:36,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:36,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:36,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1472790379, now seen corresponding path program 1 times [2025-03-08 06:54:36,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:36,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012815336] [2025-03-08 06:54:36,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:36,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:36,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:36,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:36,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:36,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:36,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:36,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012815336] [2025-03-08 06:54:36,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012815336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:36,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:36,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:54:36,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28583679] [2025-03-08 06:54:36,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:36,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:54:36,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:36,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:54:36,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:36,575 INFO L87 Difference]: Start difference. First operand 11520 states and 19785 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:37,635 INFO L93 Difference]: Finished difference Result 33455 states and 58477 transitions. [2025-03-08 06:54:37,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:54:37,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:37,727 INFO L225 Difference]: With dead ends: 33455 [2025-03-08 06:54:37,727 INFO L226 Difference]: Without dead ends: 24073 [2025-03-08 06:54:37,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:54:37,757 INFO L435 NwaCegarLoop]: 4398 mSDtfsCounter, 4796 mSDsluCounter, 13279 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4819 SdHoareTripleChecker+Valid, 17677 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:37,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4819 Valid, 17677 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:54:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24073 states. [2025-03-08 06:54:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24073 to 22464. [2025-03-08 06:54:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22464 states, 20413 states have (on average 1.658256993092637) internal successors, (33850), 21081 states have internal predecessors, (33850), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:54:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22464 states to 22464 states and 40071 transitions. [2025-03-08 06:54:38,925 INFO L78 Accepts]: Start accepts. Automaton has 22464 states and 40071 transitions. Word has length 121 [2025-03-08 06:54:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:38,926 INFO L471 AbstractCegarLoop]: Abstraction has 22464 states and 40071 transitions. [2025-03-08 06:54:38,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 22464 states and 40071 transitions. [2025-03-08 06:54:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:38,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:38,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:38,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:54:38,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:38,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1914544874, now seen corresponding path program 1 times [2025-03-08 06:54:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:38,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351959776] [2025-03-08 06:54:38,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:38,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:38,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:38,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:39,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:39,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351959776] [2025-03-08 06:54:39,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351959776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:39,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:39,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:54:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186760547] [2025-03-08 06:54:39,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:39,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:54:39,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:39,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:54:39,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:54:39,082 INFO L87 Difference]: Start difference. First operand 22464 states and 40071 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:40,081 INFO L93 Difference]: Finished difference Result 47166 states and 87073 transitions. [2025-03-08 06:54:40,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:54:40,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:40,191 INFO L225 Difference]: With dead ends: 47166 [2025-03-08 06:54:40,192 INFO L226 Difference]: Without dead ends: 26838 [2025-03-08 06:54:40,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:40,247 INFO L435 NwaCegarLoop]: 4224 mSDtfsCounter, 4456 mSDsluCounter, 8344 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4471 SdHoareTripleChecker+Valid, 12568 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:40,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4471 Valid, 12568 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:54:40,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26838 states. [2025-03-08 06:54:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26838 to 22464. [2025-03-08 06:54:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22464 states, 20413 states have (on average 1.6550727477587812) internal successors, (33785), 21081 states have internal predecessors, (33785), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:54:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22464 states to 22464 states and 40006 transitions. [2025-03-08 06:54:41,826 INFO L78 Accepts]: Start accepts. Automaton has 22464 states and 40006 transitions. Word has length 121 [2025-03-08 06:54:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:41,827 INFO L471 AbstractCegarLoop]: Abstraction has 22464 states and 40006 transitions. [2025-03-08 06:54:41,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 22464 states and 40006 transitions. [2025-03-08 06:54:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:41,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:41,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:41,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:54:41,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:41,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1928795019, now seen corresponding path program 1 times [2025-03-08 06:54:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:41,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774111223] [2025-03-08 06:54:41,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:41,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:41,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:41,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:41,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:41,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:41,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:41,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774111223] [2025-03-08 06:54:41,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774111223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:41,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:41,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:54:41,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993317612] [2025-03-08 06:54:41,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:41,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:54:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:41,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:54:41,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:54:41,924 INFO L87 Difference]: Start difference. First operand 22464 states and 40006 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:42,907 INFO L93 Difference]: Finished difference Result 46437 states and 85485 transitions. [2025-03-08 06:54:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:54:42,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:43,018 INFO L225 Difference]: With dead ends: 46437 [2025-03-08 06:54:43,018 INFO L226 Difference]: Without dead ends: 26109 [2025-03-08 06:54:43,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:43,078 INFO L435 NwaCegarLoop]: 4221 mSDtfsCounter, 4453 mSDsluCounter, 8339 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4468 SdHoareTripleChecker+Valid, 12560 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:43,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4468 Valid, 12560 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:54:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26109 states. [2025-03-08 06:54:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26109 to 22464. [2025-03-08 06:54:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22464 states, 20413 states have (on average 1.6518885024249252) internal successors, (33720), 21081 states have internal predecessors, (33720), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:54:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22464 states to 22464 states and 39941 transitions. [2025-03-08 06:54:44,274 INFO L78 Accepts]: Start accepts. Automaton has 22464 states and 39941 transitions. Word has length 121 [2025-03-08 06:54:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:44,275 INFO L471 AbstractCegarLoop]: Abstraction has 22464 states and 39941 transitions. [2025-03-08 06:54:44,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 22464 states and 39941 transitions. [2025-03-08 06:54:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:44,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:44,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:44,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:54:44,285 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:44,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:44,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1395881270, now seen corresponding path program 1 times [2025-03-08 06:54:44,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:44,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551135624] [2025-03-08 06:54:44,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:44,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:44,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:44,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:44,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:44,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:44,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551135624] [2025-03-08 06:54:44,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551135624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:44,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:44,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:54:44,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707740082] [2025-03-08 06:54:44,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:44,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:54:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:44,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:54:44,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:44,374 INFO L87 Difference]: Start difference. First operand 22464 states and 39941 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:46,748 INFO L93 Difference]: Finished difference Result 67462 states and 126143 transitions. [2025-03-08 06:54:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:54:46,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:46,966 INFO L225 Difference]: With dead ends: 67462 [2025-03-08 06:54:46,966 INFO L226 Difference]: Without dead ends: 47136 [2025-03-08 06:54:47,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:54:47,054 INFO L435 NwaCegarLoop]: 4387 mSDtfsCounter, 4685 mSDsluCounter, 13230 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4708 SdHoareTripleChecker+Valid, 17617 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:47,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4708 Valid, 17617 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:54:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47136 states. [2025-03-08 06:54:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47136 to 45466. [2025-03-08 06:54:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45466 states, 40709 states have (on average 1.6418482399469405) internal successors, (66838), 42771 states have internal predecessors, (66838), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-08 06:54:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45466 states to 45466 states and 87331 transitions. [2025-03-08 06:54:49,551 INFO L78 Accepts]: Start accepts. Automaton has 45466 states and 87331 transitions. Word has length 121 [2025-03-08 06:54:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:49,552 INFO L471 AbstractCegarLoop]: Abstraction has 45466 states and 87331 transitions. [2025-03-08 06:54:49,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 45466 states and 87331 transitions. [2025-03-08 06:54:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:49,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:49,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:49,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:54:49,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:49,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1960554411, now seen corresponding path program 1 times [2025-03-08 06:54:49,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:49,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560352089] [2025-03-08 06:54:49,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:49,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:49,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:49,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:49,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:49,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:49,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:49,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560352089] [2025-03-08 06:54:49,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560352089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:49,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:49,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:54:49,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163545854] [2025-03-08 06:54:49,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:49,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:54:49,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:49,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:54:49,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:54:49,635 INFO L87 Difference]: Start difference. First operand 45466 states and 87331 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:52,396 INFO L93 Difference]: Finished difference Result 95357 states and 194137 transitions. [2025-03-08 06:54:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:54:52,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:54:52,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:52,639 INFO L225 Difference]: With dead ends: 95357 [2025-03-08 06:54:52,639 INFO L226 Difference]: Without dead ends: 52027 [2025-03-08 06:54:52,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:52,733 INFO L435 NwaCegarLoop]: 4216 mSDtfsCounter, 4449 mSDsluCounter, 8330 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4464 SdHoareTripleChecker+Valid, 12546 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:52,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4464 Valid, 12546 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:54:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2025-03-08 06:54:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 45466. [2025-03-08 06:54:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45466 states, 40709 states have (on average 1.6386794075020266) internal successors, (66709), 42771 states have internal predecessors, (66709), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-08 06:54:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45466 states to 45466 states and 87202 transitions. [2025-03-08 06:54:57,406 INFO L78 Accepts]: Start accepts. Automaton has 45466 states and 87202 transitions. Word has length 121 [2025-03-08 06:54:57,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:57,406 INFO L471 AbstractCegarLoop]: Abstraction has 45466 states and 87202 transitions. [2025-03-08 06:54:57,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:54:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 45466 states and 87202 transitions. [2025-03-08 06:54:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:54:57,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:57,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:57,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:54:57,420 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:57,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1949046102, now seen corresponding path program 1 times [2025-03-08 06:54:57,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:57,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640930557] [2025-03-08 06:54:57,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:57,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:57,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:54:57,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:54:57,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:57,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:57,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:57,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640930557] [2025-03-08 06:54:57,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640930557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:57,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:57,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:54:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110018827] [2025-03-08 06:54:57,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:57,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:54:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:57,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:54:57,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:57,494 INFO L87 Difference]: Start difference. First operand 45466 states and 87202 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:55:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:55:02,019 INFO L93 Difference]: Finished difference Result 137344 states and 290425 transitions. [2025-03-08 06:55:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:55:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-08 06:55:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:55:02,474 INFO L225 Difference]: With dead ends: 137344 [2025-03-08 06:55:02,474 INFO L226 Difference]: Without dead ends: 94016 [2025-03-08 06:55:02,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:55:02,619 INFO L435 NwaCegarLoop]: 4379 mSDtfsCounter, 4612 mSDsluCounter, 13198 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 17577 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:55:02,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 17577 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:55:02,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94016 states.